Parikh matrices and amiable words
Authors:
- Adrian AtanasiuAAAdrian Atanasiu
- Radu AtanasiuRARadu Atanasiu
- Ion PetreIPIon Petre
- 1 January 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 390 (1) , 102-109
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- BINARY AMIABLE WORDSInternational Journal of Foundations of Computer Science, 2007
- Independence of certain quantities indicating subword occurrencesTheoretical Computer Science, 2006
- A Low-complexity Distance for DNA StringsFundamenta Informaticae, 2006
- 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
- A sharpening of the Parikh mappingRAIRO - Theoretical Informatics and Applications, 2001
- On Context-Free LanguagesJournal of the ACM, 1966