SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
Authors:
- 1 February 2010
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 21 (01) , 91-111
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Parikh matrices and amiable wordsTheoretical Computer Science, 2008
- On fairness of D0L systemsDiscrete Applied Mathematics, 2007
- ON LANGUAGES DEFINED BY NUMERICAL PARAMETERS2006
- A q-ANALOGUE OF THE PARIKH MATRIX MAPPING2006
- Connections between subwords and certain matrix mappingsTheoretical Computer Science, 2005
- 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
- A sharpening of the Parikh mappingRAIRO - Theoretical Informatics and Applications, 2001
- Handbook of Formal Languages1997