Feature automata and recognizable sets of feature trees

DOI10.1007/3-540-56610-4_76zbMath1497.68146OpenAlexW1573343649MaRDI QIDQ5044748

Andreas Podelski, Joachim Niehren

Publication date: 2 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_76

Mathematics Subject Classification ID

Theory of programming languages (68N15) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Data structures (68P05)

Related Items

Alternating two-way AC-tree automata ⋮ Equational and membership constraints for infinite trees ⋮ Logics for unordered trees with data constraints ⋮ Automata for unordered trees ⋮ Multitree automata that count

Cites Work

• An algebraic semantics approach to the effective resolution of type equations
• A new method for undecidability proofs of first order theories
• Tree acceptors and some of their applications
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Feature-constraint logics for unification grammars
• The Logic of Typed Feature Structures
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item