One-way stack automata

Authors:
Seymour Ginsburg;Sheila A. Greibach;Michael A. Harrison
Affiliations:
System Development Corporation, Santa Monica, California;Harvard University, Cambridge, Massachusetts;University of California, Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 1
Cited 53

Stack automata and compiling

Journal of the ACM (JACM)

Stack automata and compiling

Journal of the ACM (JACM)
Decidable and Undecidable Questions About Automata

Journal of the ACM (JACM)
One-way nondeterministic real-time list-storage languages

Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
Programmed Grammars and Classes of Formal Languages

Journal of the ACM (JACM)
Nested Stack Automata

Journal of the ACM (JACM)
Halting Stack Automata

Journal of the ACM (JACM)
A Grammatical Characterization of One-Way Nondeterministic Stack Languages

Journal of the ACM (JACM)
Multitape AFA

Journal of the ACM (JACM)
A Note on Bracketed Grammars

Journal of the ACM (JACM)
Stack Machines and Classes of Nonnested Macro Languages

Journal of the ACM (JACM)
SIGACT news complexity theory column 35

ACM SIGACT News
On interacting automata with limited nondeterminism

Fundamenta Informaticae - Special issue on cellular automata
Turing universality of the game of life

Collision-based computing
Alternating and empty alternating auxiliary stack automata

Theoretical Computer Science
Degree-languages, polynomial time recognition, and the LBA problem

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Some restrictions on W-grammars

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition—(Extended Abstract)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Absolutely parallel grammars and two-way deterministic finite-state transducers

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Quasi-realtime languages (Extended Abstract)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Abstract families of deterministic languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Intercalation theorems for stack languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Lambda calculus schemata

Proceedings of ACM conference on Proving assertions about programs
Recognition of two-dimensional patterns

ACM '77 Proceedings of the 1977 annual conference
Strong generative capacity, weak generative capacity, and modern linguistic theories

Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Sublogarithmic ambiguity

Theoretical Computer Science - Mathematical foundations of computer science 2004
Self-regulating finite automata

Acta Cybernetica
Cellular Devices and Unary Languages

Fundamenta Informaticae - Special issue on DLT'04
Deterministic Input-Reversal and Input-Revolving Finite Automata

Language and Automata Theory and Applications
On input-revolving deterministic and nondeterministic finite automata

Information and Computation
The equivalence of stack-counter acceptors and quasi-realtime stack-counter acceptors

Journal of Computer and System Sciences
Finite-turn checking automata

Journal of Computer and System Sciences
Scattered context grammars

Journal of Computer and System Sciences
Checking automata and one-way stack languages

Journal of Computer and System Sciences
1-Way stack automaton with jumps

Journal of Computer and System Sciences
On the extension of Gladkij's Theorem and the Hierarchies of languages

Journal of Computer and System Sciences
Absolutely parallel grammars and two-way finite-state transducers

Journal of Computer and System Sciences
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences
What makes some language theory problems undecidable

Journal of Computer and System Sciences
Syntactic operators on full semiAFLs

Journal of Computer and System Sciences
Flip-pushdown automata: nondeterminism is better than determinism

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Building context-sensitive parsers from CF grammars with regular control language

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
On pure multi-pushdown automata that perform complete pushdown pops

Acta Cybernetica
Gaining power by input operations: finite automata and beyond

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Hybrid extended finite automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Revolving-input finite automata

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Cellular Devices and Unary Languages

Fundamenta Informaticae - Special issue on DLT'04
On Interacting Automata with Limited Nondeterminism

Fundamenta Informaticae - Cellular Automata
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY

Fundamenta Informaticae
Input-Driven stack automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Input-Driven queue automata: finite turns, decidability, and closure properties

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.01

Visualization

Abstract

A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequential transduction preserves the former; set complementation, the latter. Several solvability questions are also considered.