Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 3
One-unambiguous regular languages
Information and Computation
Deterministic generalized automata
Theoretical Computer Science
Acta Cybernetica
SGML and XML document grammars and exceptions
Information and Computation
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Codes
One-visit caterpillar tree automata
Fundamenta Informaticae
Characterizing Regular Languages with Polynomial Densities
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the power of tree-walking automata
Information and Computation - Special issue: ICC '99
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Journal of Computer and System Sciences
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Tree-walking automata cannot be determinized
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Fundamenta Informaticae
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hi-index | 5.23 |
Caterpillar expressions have been introduced by Bruggemann-Klein and Wood for applications in markup languages. Caterpillar expressions provide a convenient formalism for specifying the operation of tree-walking automata on unranked trees. Here we give a formal definition of determinism of caterpillar expressions that is based on the language of instruction sequences defined by the expression. We show that determinism of caterpillar expressions can be decided in polynomial time.