On fairness of D0L systems

DOI10.1016/J.DAM.2007.04.004zbMath1127.68048OpenAlexW2111492193MaRDI QIDQ2381541

Anton Černý

Publication date: 18 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.004

zbMATH Keywords

D0L systemParikh mappingfair word

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism ⋮ Subword balance, position indices and power sums ⋮ Generalizations of Parikh mappings ⋮ Subword histories and associated matrices ⋮ Criteria for the matrix equivalence of words ⋮ SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES

Cites Work

• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Subword histories and Parikh matrices
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES
• On Context-Free Languages
• Theory Is Forever

This page was built for publication: On fairness of D0L systems