Parikh word representable graphs and morphisms

DOI10.1007/978-3-030-81508-0_30OpenAlexW3188900762MaRDI QIDQ832963

Somnath Bera, Atulya K. Nagar, K. G. Subramanian, Nobin Thomas, Lisa Mathew

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Words and graphs
• Parikh word representability of bipartite permutation graphs
• Core words and Parikh matrices
• Some results on Parikh word representable graphs and partitions
• Parikh matrices and amiable words
• Structural properties of word representable graphs
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• On Core Words and the Parikh Matrix Mapping
• Word-Representability of Line Graphs
• On Context-Free Languages
• Parikh Matrices: Subword Indicators and Degrees of Ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parikh word representable graphs and morphisms