Variable Tree Automata over Infinite Ranked Alphabets

DOI10.1007/978-3-642-21493-6_16zbMath1339.68152OpenAlexW1010118384MaRDI QIDQ3014945

Irini-Eleftheria Mens, George Rahonis

Publication date: 8 July 2011

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_16

zbMATH Keywords

infinite ranked alphabetsrelabelingsvariable bottom-up tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Forward and backward application of symbolic tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• The IO- and OI-hierarchies
• Synchronized tree automata
• Finite-memory automata
• Finite-state unification automata and relational languages
• Tree acceptors and some of their applications
• Two-variable logic on data words
• Pushdown tree automata
• Two-variable logic on data trees and XML reasoning
• Variable Automata over Infinite Alphabets
• Finite state machines for strings over infinite alphabets
• Algebraic automata and context-free sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Rewriting Techniques and Applications

This page was built for publication: Variable Tree Automata over Infinite Ranked Alphabets