COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES

DOI10.1142/S0129054107005431zbMath1183.68353MaRDI QIDQ3401488

Arto Salomaa

Publication date: 29 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

iterated morphismsubwordD0L systemscattered subwordParikh matrixsubword balance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

On fairness of D0L systems ⋮ Algebraic properties of Parikh matrices of binary picture arrays ⋮ Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism ⋮ Generalizations of Parikh mappings ⋮ Subword histories and associated matrices

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

This page was built for publication: COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES