MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "On Pushdown Tree Automata." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 15 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Tree Automata with Memory, Visibility and Structural Constraints  
  • by Hubert Comon-lundh, Florent Jacquemard, Nicolas Perrin — 2007 — in "Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS’07
  • … in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality…
  • Cited by 2 (0 self) – Add To MetaCart
  • Languages of nested trees  
  • by Rajeev Alur, Swarat Chaudhuri, P. Madhusudan — 2006 — In Proc. 18th International Conference on Computer-Aided Verification, LNCS 4144
  • … is EXPTIMEcomplete, matching that for alternating tree automata on pushdown systems. Our candidate for a canonical…
  • Cited by 4 (0 self) – Add To MetaCart
  • Pushdown Specifications  
  • by Orna Kupferman, Nir Piterman, Moshe Y. Vardi — 2002
  • … is nondeterministic pushdown parity tree automata (PD-NPT). We show that the model-checking problem for regular…
  • Cited by 15 (5 self) – Add To MetaCart
  • Locating Matches of Tree Patterns in Forests  
  • by Andreas Neumann, Helmut Seidl — 1998 — Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science
  • … to recursive descent parsing. A different class of pushdown tree automata was given in [Mor94]: a two…
  • Cited by 47 (5 self) – Add To MetaCart
  • Pushdown Module Checking  
  • by Laura Bozzelli, Aniello Murano, Adriano Peron — 2005 — In LPAR’05, LNCS 3835
  • … |=r ψ. 3 Tree Automata In order to solve the pushdown module checking problem for CTL and CTL ∗ , we…
  • Cited by 9 (9 self) – Add To MetaCart
  • Formal tree series  
  • by Copyright C, Zoltán Ésik, Zoltán Ésik, Werner Kuich, Werner Kuich, Werner Kuich — 2003 — J. Autom. Lang. Combin
  • … of equations 4. Closure properties and a Kleene Theorem for recognizable tree series 5. Pushdown tree automata…
  • Cited by 24 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB