Bounded AFLs

DOI10.1016/S0022-0000(76)80010-4zbMath0331.68043OpenAlexW2914943412MaRDI QIDQ1227455

Jonathan Goldstine

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80010-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Cônes rationnels commutatifs ⋮ The inclusion of D0L in multi-reset ⋮ Some language families generated by one-letter languages ⋮ Chains and fixing blocks in irreducible binary sequences ⋮ A TREE-HEIGHT HIERARCHY OF CONTEXT-FREE LANGUAGES ⋮ Substitution and bounded languages ⋮ Detecting leftmost maximal periodicities ⋮ On some bounded semiAFLs and AFLs

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Some independent families of one-letter languages
• Checking automata and one-way stack languages
• What makes some language theory problems undecidable
• Principal AFL
• Three theorems concerning principal AFLs
• Substitution and bounded languages
• Unending chess, symbolic dynamics and a problem in semi-groups
• Bounded Algol-Like Languages
• Studies in abstract families of languages
• Chains of full AFL's
• Multitape AFA
• Intersection-closed full AFL and the recursively enumerable languages

This page was built for publication: Bounded AFLs