Variable tree automata over infinite ranked alphabets

DOI10.1007/978-3-642-21493-6_16MaRDI QIDQ3014945zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Variable automata over infinite alphabets
• Tree Automata over Infinite Alphabets
• Tree automata
• Weighted recognizability over infinite alphabets
• Weighted variable automata over infinite alphabets

Cites work

• Algebraic automata and context-free sets
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• Finite-state unification automata and relational languages
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• Pushdown tree automata
• Rewriting Techniques and Applications
• Synchronized tree automata
• The IO- and OI-hierarchies
• Tree acceptors and some of their applications
• Two-variable logic on data trees and XML reasoning
• Two-variable logic on data words
• Variable automata over infinite alphabets

Cited in

(4)

• Variable automata over infinite alphabets
• Forward and backward application of symbolic tree transducers
• Tree automata
• Tree Automata over Infinite Alphabets

This page was built for publication: Variable tree automata over infinite ranked alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014945)