On a conjecture about Parikh matrices
DOI10.1016/J.TCS.2016.03.008zbMATH Open1338.68163OpenAlexW2296691651WikidataQ123155981 ScholiaQ123155981MaRDI QIDQ266265FDOQ266265
Authors: Wen Chean Teh, Adrian Atanasiu 
Publication date: 13 April 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.008
Recommendations
- ON PARIKH MATRICES
- Theory Is Forever
- Publication:4724782
- Some algebraic aspects of Parikh \(q\)-matrices
- On a matrix partition conjecture
- Parikh matrices and strong \(M\)-equivalence
- A new study of Parikh matrices restricted to terms
- scientific article
- On commuting Parikh \(q\)-matrices
- On a conjecture on the eigenvalues ofp-matrices
\(M\)-equivalenceAtanasiu's systeminjectivity problemParikh matricesParikh matrix mappingsubword occurrences
Formal languages and automata (68Q45) Combinatorics on words (68R15) Thue and Post systems, etc. (03D03)
Cites Work
- Title not available (Why is that?)
- Core words and Parikh matrices
- Parikh matrices and amiable words
- Parikh matrices, amiability and Istrail morphism
- A sharpening of the Parikh mapping
- Injectivity of the Parikh matrix mappings revisited
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parikh matrices and Parikh rewriting systems
- On core words and the Parikh matrix mapping
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
- Criteria for the matrix equivalence of words
Cited In (18)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
- Theory Is Forever
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- On \(M\)-equivalence and strong \(M\)-equivalence for Parikh matrices
- Parikh word representability of bipartite permutation graphs
- A new design formula exploited for accelerating Zhang neural network and its application to time-varying matrix inversion
- Parikh matrices and Parikh rewriting systems
- A new study of Parikh matrices restricted to terms
- Counting subwords in circular words and their Parikh matrices
- Parapermanents of triangular matrices and some general theorems on number sequences
- Order of weak \(M\)-relation and Parikh matrices
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
- Algebraic properties of Parikh matrices of binary picture arrays
- Parikh matrices for powers of words
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
This page was built for publication: On a conjecture about Parikh matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266265)
