Some independent families of one-letter languages

DOI10.1016/S0022-0000(75)80006-7zbMath0305.68059MaRDI QIDQ1217463

Jonathan Goldstine

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 (3)

Finite automata and unary languages ⋮ Continuous operations on languages ⋮ Bounded AFLs

Cites Work

• Unnamed Item
• Substitution in families of languages
• Three theorems concerning principal AFLs
• Substitution and bounded languages
• Studies in abstract families of languages
• Chains of full AFL's

This page was built for publication: Some independent families of one-letter languages