COUNTING SUBWORDS USING A TRIE AUTOMATON

DOI10.1142/S0129054111008817zbMath1233.68151MaRDI QIDQ3173481

Hamed M. K. Alazemi, Anton Černý

Publication date: 10 October 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

scattered subwordParikh matrixParikh mappingtrie automaton

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Formal languages and automata (68Q45) Enumeration in graph theory (05C30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Several extensions of the Parikh matrix \(L\)-morphism ⋮ Reducing the ambiguity of Parikh matrices

Cites Work

• Unnamed Item
• Subword histories and associated matrices
• Subword histories and Parikh matrices
• Extending Parikh matrices
• A sharpening of the Parikh mapping
• Generalizations of Parikh mappings
• On Context-Free Languages

This page was built for publication: COUNTING SUBWORDS USING A TRIE AUTOMATON