Finite-turn checking automata

DOI10.1016/S0022-0000(71)80015-6zbMath0231.68032MaRDI QIDQ2550634

Rani Siromoney

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Single-tape reset machines, Unnamed Item, The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index, Equivalence problem of mappings relative to languages, Familles de langages fermées par crochet ouvert, Tree transducers, L systems, and two-way machines, Reset machines, Controlled pushdown automata, 2DST mappings of languages and related problems, Image theorems for simple matrix languages andn-parallel languages, On languages with a certain prefix property, Control sets on context-free grammar forms, One way finite visit automata, Classes of formal grammars, On two-way sequential transductions of full semi-AFL's, A note on Parikh maps, abstract languages, and decision problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multitape one-way nonwriting automata
• Checking automata and one-way stack languages
• Finite-Turn Pushdown Automata
• The Unsolvability of the Recognition of Linear Context-Free Languages
• On equal matrix languages
• One-way stack automata
• A Characterization of Semilinear Sets
• Studies in abstract families of languages
• Simple matrix languages
• Unambiguous equal matrix languages