On the existence of generators for certain AFL

DOI10.1016/0020-0255(70)90037-XzbMath0204.31904OpenAlexW2042197600MaRDI QIDQ2541640

Seymour Ginsburg, Gene F. Rose

Publication date: 1970

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(70)90037-x

Related Items (5)

A model for ergodic automorphisms on groups ⋮ A hardest language recognized by two-way nondeterministic pushdown automata ⋮ Complete symmetry in d2l systems and cellular automata ⋮ Abstract families of length-preserving processors ⋮ Theory of formal grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Nonerasing stack automata
• Principal AFL
• Writing pushdown acceptors
• A generator of context-sensitive languages
• Stack automata and compiling
• Two-way pushdown automata
• Nested Stack Automata
• Studies in abstract families of languages
• Two-way balloon automata and AFL

This page was built for publication: On the existence of generators for certain AFL