A Note on Pushdown Store Automata and Regular Systems

DOI10.2307/2035275zbMath0183.01703OpenAlexW4254914297MaRDI QIDQ5573974

Sheila A. Greibach

Publication date: 1967

Full work available at URL: https://doi.org/10.2307/2035275

zbMATH Keywords

languages, automata, networks

Related Items

Reactive synthesis from visibly register pushdown automata ⋮ On regular expressions and regular canonical systems ⋮ Deterministic Stack Transducers ⋮ The structure of index sets and reduced indexed grammars ⋮ On the rational subsets of the free group ⋮ On store languages and applications ⋮ A closure property of deterministic context-free languages ⋮ Some decision problems about controlled rewriting systems ⋮ A characterisation of deterministic context-free languages by means of right-congruences ⋮ Restarting transducers, regular languages, and rational relations ⋮ Complexity results for prefix grammars ⋮ Look-ahead on pushdowns ⋮ Sequential monotonicity for restarting automata ⋮ On store languages of language acceptors ⋮ Generators of regular languages ⋮ Some undecidability results concerning the property of preserving regularity ⋮ Regular sets over extended tree structures ⋮ Derivation trees of ground term rewriting systems.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On certain formal properties of grammars
• Recursive Unsolvability of a problem of Thue
• Regular canonical systems
• A note on asymmetry in phrase structure grammars
• Deterministic context free languages
• Quotients of Context-Free Languages
• Stack automata and compiling
• Operations Which Preserve Definability in Languages
• Formal Reductions of the General Combinatorial Decision Problem