COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES
From MaRDI portal
Publication:3401488
DOI10.1142/S0129054107005431zbMath1183.68353MaRDI QIDQ3401488
Publication date: 29 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism, Subword histories and associated matrices, Algebraic properties of Parikh matrices of binary picture arrays, On fairness of D0L systems, Generalizations of Parikh mappings
Cites Work
- Unnamed Item
- Some characterizations of Parikh matrix equivalent binary words
- Subword conditions and subword histories
- Subword histories and Parikh matrices
- Extending Parikh matrices
- Connections between subwords and certain matrix mappings
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- A sharpening of the Parikh mapping
- On Context-Free Languages