On fairness of D0L systems
Author:
- 15 August 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (13) , 1769-1773
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCESInternational Journal of Foundations of Computer Science, 2007
- Some characterizations of Parikh matrix equivalent binary wordsInformation Processing Letters, 2004
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITYInternational Journal of Foundations of Computer Science, 2004
- Subword histories and Parikh matricesJournal of Computer and System Sciences, 2004
- Algebraic Aspects of Parikh MatricesLecture Notes in Computer Science, 2004
- A sharpening of the Parikh mappingRAIRO - Theoretical Informatics and Applications, 2001
- On Context-Free LanguagesJournal of the ACM, 1966