On infinite words obtained by selective substitution grammars
From MaRDI portal
Publication:1066676
DOI10.1016/0304-3975(85)90143-4zbMath0578.68059OpenAlexW2066803834MaRDI 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
decidabilityclosure propertiesgeneration of infinite wordsinfinite non-repetitive wordslimit language families
Related Items (3)
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
This page was built for publication: On infinite words obtained by selective substitution grammars
