Factorization forests of finite height
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Lower bounds for dynamic algebraic problems
Information and Computation
Automata theory for XML researchers
ACM SIGMOD Record
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
The Height of Factorization Forests
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
Efficient evaluation of nondeterministic automata using factorization forests
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
| Hi-index | 0.00 |
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield efficient algorithms on strings and trees.