article

Free access

Two-way balloon automata and AFL

Authors:

Seymour Ginsburg,

John HopcroftAuthors Info & Claims

Journal of the ACM (JACM), Volume 17, Issue 1

Pages 3 - 13

https://doi.org/10.1145/321556.321558

Published: 01 January 1970 Publication History

PDF eReader

References

[1]

GINSBURG, S., AND GREIBACH, S. Abstract families of languages. In Studies in Abstract Families of Languages, Amer. Math. Soc. Memoir 87, 1969, pp. 1-32.

Google Scholar

[2]

, AND HARRISON, M. Stack automata and compiling. J. ACM 14, 1 (Jan. 1967), 172-201.

Digital Library

Google Scholar

[3]

HOPCROFT, J., AND ULLMAN, J. An approach to a unified theory of automata. Bell Syst. Tech. J. 46 (1967), 1793-1829.

Crossref

Google Scholar

[4]

ULLMAN, J .D . Halting stack automata. J. ACM 16, 4 (Oct. 1969), 550-563.

Digital Library

Google Scholar

Cited By

View all

Buchholz TKlein AKutrib M(2006)One guess one-way cellular arraysMathematical Foundations of Computer Science 199810.1007/BFb0055832(807-815)Online publication date: 28-May-2006
https://doi.org/10.1007/BFb0055832
Buchholz TKlein AKutrib M(2002)On interacting automata with limited nondeterminismFundamenta Informaticae10.5555/639405.63940852:1-3(15-38)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.5555/639405.639408
Buchholz TKlein AKutrib M(2002)On Interacting Automata with Limited NondeterminismFundamenta Informaticae10.5555/2371144.237114652:1-3(15-38)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/2371144.2371146
Show More Cited By

Index Terms

Two-way balloon automata and AFL
1. Theory of computation

Recommendations

Oblivious two-way finite automata: Decidability and complexity

We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs ...
Complementing two-way finite automata

We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, ...
Two-way balloon automata and AFL
SWAT '68: Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)

It is shown that if the family of languages accepted by a closed class of two-way balloon automata is closed under length-preserving homomorphism, then this family is an AFL closed under intersection and ε-free substitution. It is then proved that the ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 17, Issue 1

Jan. 1970

195 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321556

Editor:
Gerard Salton
Cornell Univ., Ithaca, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1970

Published in JACM Volume 17, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
415
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)8

Reflects downloads up to 29 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Buchholz TKlein AKutrib M(2006)One guess one-way cellular arraysMathematical Foundations of Computer Science 199810.1007/BFb0055832(807-815)Online publication date: 28-May-2006
https://doi.org/10.1007/BFb0055832
Buchholz TKlein AKutrib M(2002)On interacting automata with limited nondeterminismFundamenta Informaticae10.5555/639405.63940852:1-3(15-38)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.5555/639405.639408
Buchholz TKlein AKutrib M(2002)On Interacting Automata with Limited NondeterminismFundamenta Informaticae10.5555/2371144.237114652:1-3(15-38)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/2371144.2371146
Kazmierczak HSchärf RLütjen KSties MPirsch PBargel BBohner MDittel RKreifelts TWoetzel G(1980)Allgemeine Methoden und VerfahrenErfassung und maschinelle Verarbeitung von Bilddaten10.1007/978-3-7091-2255-6_2(9-172)Online publication date: 1980
https://doi.org/10.1007/978-3-7091-2255-6_2
Greibach S(1979)Formal languagesProceedings of the 20th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1979.19(66-90)Online publication date: 29-Oct-1979
https://dl.acm.org/doi/10.1109/SFCS.1979.19
Dennis Lawrence JDenbigh Starkey J(1976)Experimental tests of resolution-based theorem-proving strategiesInformation Sciences: an International Journal10.1016/S0020-0255(76)90698-810:2(131-154)Online publication date: 1-Jan-1976
https://dl.acm.org/doi/10.1016/S0020-0255%2876%2990698-8
McCloskey S(1975)Abstract families of length-preserving processorsJournal of Computer and System Sciences10.1016/S0022-0000(75)80009-210:3(394-427)Online publication date: 1-Jun-1975
https://dl.acm.org/doi/10.1016/S0022-0000%2875%2980009-2
Santos E(1974)One-way acceptors and languagesInternational Journal of Computer & Information Sciences10.1007/BF009766403:2(141-151)Online publication date: 1974
https://doi.org/10.1007/BF00976640
Aho AUllman J(1970)A characterization of two-way deterministic classes of languagesJournal of Computer and System Sciences10.1016/S0022-0000(70)80027-74:6(523-538)Online publication date: 1-Dec-1970
https://dl.acm.org/doi/10.1016/S0022-0000%2870%2980027-7
Ginsburg SHarrison M(1970)On the closure of AFL under reversalInformation and Control10.1016/S0019-9958(70)80035-317:4(395-409)Online publication date: Nov-1970
https://doi.org/10.1016/S0019-9958(70)80035-3
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Oblivious two-way finite automata: Decidability and complexity

Complementing two-way finite automata