14 search results - page 1 / 3 » Tree-walking automata do not recognize all regular languages |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
ICALP
2000
Springer
14 years 3 days ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
LICS
2005
IEEE
14 years 2 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
FROCOS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...