On infinite words obtained by selective substitution grammars
From MaRDI portal
Publication:1066676
DOI10.1016/0304-3975(85)90143-4zbMath0578.68059MaRDI QIDQ1066676
V. Rajkumar Dare, Rani Siromoney
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90143-4
decidability; closure properties; generation of infinite words; infinite non-repetitive words; limit language families
68Q45: Formal languages and automata
Related Items
One-sided forbidding grammars and selective substitution grammars, Topology on words, Line Languages
Cites Work
- Some remarks on non-algebraic adherences
- Selective substitution array grammars
- On infinite words obtained by iterating morphisms
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Sequential, continuous and parallel grammars
- On ω-sets associated with context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item