Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\)

DOI10.1016/0304-3975(76)90075-XzbMath0331.68045MaRDI QIDQ1227456

Juhani Karhumäki

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item, Iterative devices generating infinite words, Uni-transitional Watson-Crick D0L systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Description of developmental languages using recurrence systems
• On the periodicity of word-length in DOL languages