Three theorems concerning principal AFLs

DOI10.1016/S0022-0000(71)80038-7zbMath0217.22701OpenAlexW2016434171MaRDI QIDQ2546302

Joseph S. Ullian

Publication date: 1971

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(71)80038-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

On the intersection of stacks and queues ⋮ Cônes rationnels commutatifs ⋮ A model for ergodic automorphisms on groups ⋮ Some independent families of one-letter languages ⋮ On characterisation of language families in terms of inverse morphisms ⋮ Bounded AFLs ⋮ Proving containment of bounded AFL ⋮ Some uniformly erasable families of languages ⋮ Classes of formal grammars

Cites Work

• Principal AFL
• Bounded Regular Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three theorems concerning principal AFLs