\(M\)-equivalence of Parikh matrix over a ternary alphabet

DOI10.1007/978-3-031-40247-0_10OpenAlexW4385701251MaRDI QIDQ6199870

Yo-Sub Han, Hyunjoon Cheon, Joonghyuk Hahn

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_10

zbMATH Keywords

\(M\)-equivalenceParikh vectorParikh matrix\(M\)-unambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Order of weak \(M\)-relation and Parikh matrices
• Parikh matrices and amiable words
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• Generalized Parikh mappings and homomorphisms
• On M-Equivalence and Strong M-Equivalence for Parikh Matrices
• On Core Words and the Parikh Matrix Mapping
• On the Parikh Membership Problem for FAs, PDAs, and CMs
• On Context-Free Languages

This page was built for publication: \(M\)-equivalence of Parikh matrix over a ternary alphabet