Proving containment of bounded AFL

DOI10.1016/S0022-0000(75)80048-1zbMath0338.68053MaRDI QIDQ1230665

Branislav Rovan

Publication date: 1975

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Unnamed Item

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Syntactic operators on full semiAFLs
• Checking automata and one-way stack languages
• Principal AFL
• Three theorems concerning principal AFLs
• Substitution and bounded languages
• Bounded Algol-Like Languages
• Bounded Regular Sets
• On Context-Free Languages
• Characteristic and ultrarealtime languages
• Images of AFL under certain families of homomorphisms
• Multi-stack-counter languages

This page was built for publication: Proving containment of bounded AFL