Tree Automata over Infinite Alphabets
From MaRDI portal
Publication:5452188
DOI10.1007/978-3-540-78127-1_21zbMath1133.68364MaRDI QIDQ5452188
Publication date: 25 March 2008
Published in: Pillars of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_21
68Q45: Formal languages and automata
Related Items
Projection for Büchi Tree Automata with Constraints between Siblings, Forward and backward application of symbolic tree transducers, Symbolic tree automata, Regular expressions for data words, A note on the emptiness problem for alternating finite-memory automata, FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-memory automata
- Context-free languages over infinite alphabets
- Typechecking for XML transformers
- A formal model for an expressive fragment of XSLT
- Query automata over finite trees
- Tree acceptors and some of their applications
- Finite state machines for strings over infinite alphabets
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Decidability of Second-Order Theories and Automata on Infinite Trees