Counting subwords using a trie automaton

DOI10.1142/S0129054111008817zbMATH Open1233.68151MaRDI QIDQ3173481FDOQ3173481

Authors: 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)

Recommendations

• Subword histories and Parikh matrices
• Parikh Matrices: Subword Indicators and Degrees of Ambiguity
• Combinatorial Pattern Matching
• Efficiently computing runs on a trie
• Subword histories and associated matrices

zbMATH Keywords

scattered subwordParikh mappingParikh matrixtrie automaton

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A sharpening of the Parikh mapping
• On Context-Free Languages
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Generalizations of Parikh mappings
• Subword histories and associated matrices

Cited In (3)

• Counting subwords and regular languages
• Reducing the ambiguity of Parikh matrices
• Several extensions of the Parikh matrix \(L\)-morphism

This page was built for publication: Counting subwords using a trie automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173481)