Tree Automata over Infinite Alphabets
From MaRDI portal
Publication:5452188
DOI10.1007/978-3-540-78127-1_21zbMath1133.68364OpenAlexW1569718229MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Complexity results on register context-free grammars and related formalisms ⋮ Forward and backward application of symbolic tree transducers ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ A note on the emptiness problem for alternating finite-memory automata ⋮ Symbolic tree automata ⋮ Unnamed Item ⋮ FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT ⋮ Projection for Büchi Tree Automata with Constraints between Siblings ⋮ Regular expressions for data words
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
This page was built for publication: Tree Automata over Infinite Alphabets
