On some bounded semiAFLs and AFLs

DOI10.1016/0020-0255(81)90039-6zbMath0507.68048OpenAlexW2063701350MaRDI QIDQ1837538

Paavo Turakainen

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0020-0255(81)90039-6

zbMATH Keywords

closure propertiescontext-free languagesinclusion relationsprincipalityabstract families of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

The inclusion of D0L in multi-reset ⋮ On nonstochastic languages and homomorphic images of stochastic languages ⋮ On some transducer equivalence problems for families of languages ⋮ Some language families generated by one-letter languages ⋮ On simple generators of recursively enumerable languages ⋮ On families of full trios containing counter machine languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cônes rationnels commutatifs
• Reset machines
• One counter languages and the IRS condition
• Reversal-bounded multipushdown machines
• Bounded AFLs
• Remarks on the complexity of nondeterministic counter languages
• Remarks on blind and partially blind one-way multicounter machines
• Unending chess, symbolic dynamics and a problem in semi-groups
• On complements of some bounded context-sensitive languages
• Reversal-Bounded Acceptors and Intersections of Linear Languages
• On homomorphic images of rational stochastic languages
• Elementary bounded languages
• Images of AFL under certain families of homomorphisms

This page was built for publication: On some bounded semiAFLs and AFLs