On the power of tree-walking automata.
From MaRDI portal
Publication:1401944
DOI10.1016/S0890-5401(03)00013-0zbMATH Open1054.68086OpenAlexW1971898721MaRDI QIDQ1401944FDOQ1401944
Authors: Frank Neven, Thomas Schwentick 
Publication date: 19 August 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00013-0
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domains of partial attributed tree transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Translations on a context free grammar
- Parallel and two-way automata on directed ordered acyclic graphs
- A formal model for an expressive fragment of XSLT
- Descriptive complexity: a logician's approach to computation.
- Title not available (Why is that?)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Title not available (Why is that?)
Cited In (11)
- Tree-walking automata do not recognize all regular languages
- Pebble weighted automata and weighted logics
- Deciding determinism of caterpillar expressions
- Deciding twig-definability of node selecting tree automata
- Regular languages with variables on graphs
- Title not available (Why is that?)
- Automata for XML -- a survey
- Title not available (Why is that?)
- Loops and overloops for tree walking automata
- Deterministic Caterpillar Expressions
- Transitive closure logic, nested tree walking automata, and XPath
This page was built for publication: On the power of tree-walking automata.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401944)
