O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In Proc. 11th IEEE Symp. on Logic in Computer Science, pages 322-333, DIMACS, June 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Tree Extension Algebras: Logics, Automata, and Query Languages - Benedikt, Libkin (Correct)
....exists comparing the expressive power of each of these formalisms (see [12, 33] and for translating between declarative formalisms and their procedural implementations. In particular, work on analyzing specifications of trees plays a significant role in program analysis [3, 24] verification [15, 20, 26], logic and constraint programming [29, 30] and linguistics [14, 19] Over the last few years, applications in information exchange have appeared that necessitate new tools for synthesizing tree processing code from a declarative specification. These applications all revolve around XML [1, 35] ....
O. Kupferman, S. Safra, M. Vardi. Relating word and tree automata. In LICS'96, pages 322--332.
Relating Hierarchies of Word and Tree Automata - Niwinski, Walukiewicz (1998) (4 citations) (Correct)
....of the cases our language L will be an regular language. It is easy to transform a deterministic automaton recognising L into a deterministic automaton recognising Path(L) However, we may a priori hope that using nondeterminism in some clever way we can simplify the automaton for Path(L) In [6], Kupferman, Safra and Vardi investigated this question and showed a result that refutes such a hope in a special case of Buchi automata. More specifically, these authors show that a derived tree language is recognizable by a nondeterministic Buchi tree automaton if and only if the original ....
....of the Mostowski index (1,2) Our main result is that Path(L) can be recognized by a nondeterministic tree automaton of Mostowski index ( n) iff L can be recognized by a deterministic automaton of the same index. That is, L and Path(L) are on the same level in the corresponding hierarchies. In [6] the result was shown for index (1; 2) Let us comment on the advantages of the Mostowski criterion compared to other acceptance criteria considered in the literature, and on the relevance of the aforementioned hierarchies. The Mostowski condition is as powerful as Muller condition for ....
[Article contains additional citation context not shown here]
O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In 11th IEEE Symp. on Logic in Comput. Sci., pages 322--332, 1996.
Relating hierarchies of word and tree automata (Extended.. - Niwinski, Walukiewicz (Correct)
....of the cases our language L would be an regular language. It is easy to transform a deterministic automaton recognising L into a deterministic automaton recognising Path(L) However, we may a priori hope that using nondeterminism in some clever way we can simplify the automaton for Path(L) In [6], Kupferman, Safra and Vardi investigated this question and showed a result that refutes such a hope in a special case of Buchi automata. More specifically, these authors show that a derived tree language is recognizable by a nondeterministic Buchi tree automaton if and only if the original ....
.... Up to current knowledge, the deterministic complexity of the emptiness check depends exponentially on the size of the index (in general it is NP complete for Rabin automata [2] and in NP co NP for Mostowski automata [1] Our work was directly inspired by the work of Kupferman, Safra and 2 Vardi [6], but our proof is different from theirs. For our proof we need a characterization of the index of an word language in terms of properties of the graph of a deterministic automaton recognising the language. This characterization is related with the work of Wagner [16] One may see our ....
O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In 11th IEEE Symp. on Logic in Comput. Sci., pages 322--332, 1996.
Fair Equivalence Relations - Orna Kupferman And Self-citation (Kupferman Vardi) (Correct)
No context found.
O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In Proc. 11th IEEE Symp. on Logic in Computer Science, pages 322-333, DIMACS, June 1996.
Fair Equivalence Relations - Kupferman, Piterman, Vardi Self-citation (Kupferman Vardi) (Correct)
....automata. While loose tree automata are weaker than conventional tree automata [Tho90] the expressiveness hierarchy of loose tree automata coincides with that of tree automata (this is beacause the latter coincides with the hierarchy of deterministic word automata [Wag79,Kam85] and is proven in [KSV96,DJW97,Niw97,NW98] by means of languages that can be recognized by loose tree automata) It follows that the expressiveness hierarchy in the context of game bisimulation and 8 bisimulation coincides with that of tree automata. 5 Discussion We considered two equivalence criteria bisimulation ....
O. Kupferman, S. Safra, and M.Y. Vardi. Relating word and tree automata. In Proc. 11th LICS, pp. 322--333, 1996.
Sometimes and Not Never Re-revisited: On Branching Versus Linear.. - Vardi (1998) (1 citation) Self-citation (Vardi) (Correct)
.... equivalent AFMC(2) formula and therefore, by Theorem 6, der 2 (L) can be recognized by an AWT(2) It is proved in [40] that if a language of trees can be recognized by an AWT(2) then it can also be recognized by an NBT(2) It follows that der 2 (L) can be recognized by an NBT(2) It is proved in [26] that for every regular language R, if der 2 (R) can be recognized by an NBT(2) then R can be recognized by a DBW. It follows that L can be recognized by a DBW. Assume now that L can be recognized by a DBW. Let A = h Sigma; Q; q 0 ; ffi; ffi be a DBW that recognizes L. We define an AFMC ....
O. Kupferman, S. Safra, and M.Y. Vardi. Relating word and tree automata. In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 322--333, DIMACS, June 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC