Deterministic caterpillar expressions

Authors:
Kai Salomaa;Sheng Yu;Jinfeng Zan
Affiliations:
School of Computing, Queen's University, Kingston, Ontario, Canada;Department of Computer Science, University of Western Ontario, London, Ontario, Canada;School of Computing, Queen's University, Kingston, Ontario, Canada
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 21
Cited 1

Regular languages

Handbook of formal languages, vol. 1
Tree languages

Handbook of formal languages, vol. 3
One-unambiguous regular languages

Information and Computation
Trips on trees

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
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Theory of Codes

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
Tree-Walking Pebble Automata

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
Translation of binary regular expressions into nondeterministic ɛ-free automata with O(n log n)transitions

Journal of Computer and System Sciences
Tree-walking automata do not recognize all regular languages

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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)
Intercode Regular Languages

Fundamenta Informaticae
Ambiguity in Graphs and Expressions

IEEE Transactions on Computers
Regular expressions and NFAs without Ε-transitions

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Operational state complexity of nested word automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Caterpillar expressions have been introduced by Brüggemann-Klein and Wood for applications in markup languages. A caterpillar expression can be implemented as a tree walking automaton operating 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.