Results 131 to 140 of about 1,479 (163)
Some of the next articles are maybe not open access.
J. Autom. Lang. Comb., 2006
Journal of Automata, Languages and Combinatorics, Volume 11, Number 2, 2006, 161 ...
Ferenc Gécseg, Balázs Imreh
openaire +1 more source
Journal of Automata, Languages and Combinatorics, Volume 11, Number 2, 2006, 161 ...
Ferenc Gécseg, Balázs Imreh
openaire +1 more source
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2004
Formal languages play an important role for many aspects of XML processing. This is obvious for type specifications (as DTD) which use context-free grammars and for navigation in documents (as in XPath) which is based on regular expressions. But the investigation of query, typing, navigation and transformation languages for XML has used many more ...
openaire +1 more source
Formal languages play an important role for many aspects of XML processing. This is obvious for type specifications (as DTD) which use context-free grammars and for navigation in documents (as in XPath) which is based on regular expressions. But the investigation of query, typing, navigation and transformation languages for XML has used many more ...
openaire +1 more source
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982
In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you did most probably use Rabin's result. But did you make your way through Rabin's cumbersome proof with its induction on countable ordinals?
Yuri Gurevich, Leo Harrington
openaire +1 more source
In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you did most probably use Rabin's result. But did you make your way through Rabin's cumbersome proof with its induction on countable ordinals?
Yuri Gurevich, Leo Harrington
openaire +1 more source
SYSTOLIC TREE WITH BASE AUTOMATA
International Journal of Foundations of Computer Science, 1991Different systolic tree automata (STA) with base (T(b)−STA) are compared. This is a subclass of STA with interesting properties of modularity. We give a necessary and sufficient condition for the inclusion between classes of languages accepted by T(b)− STA, (L(T(b)−STA)), as b varies.
MONTI, Angelo, D. Parente
openaire +2 more sources
Nondeterministic Tree Automata
2002The automaton models introduced so far mainly differ in their acceptance conditions. However, they all consume infinite sequences of alphabet symbols, i.e., they consume ω-words. We therefore call these automata word automata. In this chapter we define finite-state automata which process infinite trees instead of infinite words and consequently we call
openaire +1 more source
Bisimulation Minimization of Tree Automata
International Journal of Foundations of Computer Science, 2006We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize nondeterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of [Formula: see text], where [Formula: see text] is the maximum rank of any ...
Parosh Aziz Abdulla +2 more
openaire +1 more source
From Tree Automata to String Automata Minimization
Theory of Computing Systems, 2017The authors associate with any given deterministic finite bottom-up tree automaton (DFTA) a deterministic finite string automaton (DFA) that can be used for minimizing the tree automaton. By this reduction the existing efficient minimization algorithms designed for string automata become applicable to tree automata.
Younes Guellouma +3 more
openaire +1 more source
Mathematical Systems Theory, 1983
We define topdown pushdown tree automata (PDTA's) which extend the usual string pushdown automata by allowing trees instead of strings in both the input and the stack. We prove that PDTA's recognize the class of context-free tree languages. (Quasi)realtime and deterministic PDTA's accept the classes of Greibach and deterministic tree languages ...
openaire +2 more sources
We define topdown pushdown tree automata (PDTA's) which extend the usual string pushdown automata by allowing trees instead of strings in both the input and the stack. We prove that PDTA's recognize the class of context-free tree languages. (Quasi)realtime and deterministic PDTA's accept the classes of Greibach and deterministic tree languages ...
openaire +2 more sources
2007
Restarting automata were introduced to model the linguistic concept of analysis by reduction. In recent years there was a growing effort to study classes of formal languages that are generated by different variants of these automata. We follow this line of research and generalize the model to a more complex data structure: free term algebras (or trees).
Heiko Stamer, Friedrich Otto
openaire +1 more source
Restarting automata were introduced to model the linguistic concept of analysis by reduction. In recent years there was a growing effort to study classes of formal languages that are generated by different variants of these automata. We follow this line of research and generalize the model to a more complex data structure: free term algebras (or trees).
Heiko Stamer, Friedrich Otto
openaire +1 more source
2007
We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.
Zoltán Ésik, Szabolcs Iván
openaire +1 more source
We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.
Zoltán Ésik, Szabolcs Iván
openaire +1 more source