Feature automata and recognizable sets of feature trees

DOI10.1007/3-540-56610-4_76MaRDI QIDQ5044748zbMATH OpenOpenAlexFDO

Authors Joachim Niehren, Andreas Podelski

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) Data structures (68P05) Algebraic theory of languages and automata (68Q70) Applications of universal algebra in computer science (08A70)

Recommendations

• scientific article; zbMATH DE number 2150292
• A complete and recursive feature theory
• Symbolic tree automata
• scientific article; zbMATH DE number 1841842
• A rational reconstruction of the domain of feature structures

Cites work

• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 475416 (Why is no real title available?)
• scientific article; zbMATH DE number 549955 (Why is no real title available?)
• scientific article; zbMATH DE number 970739 (Why is no real title available?)
• A new method for undecidability proofs of first order theories
• An algebraic semantics approach to the effective resolution of type equations
• Feature-constraint logics for unification grammars
• Generalized finite automata theory with an application to a decision problem of second-order logic
• The Logic of Typed Feature Structures
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Tree acceptors and some of their applications

Cited in

(6)

• Logics for unordered trees with data constraints
• Multitree automata that count
• Alternating two-way AC-tree automata
• Basic theory of feature trees
• Equational and membership constraints for infinite trees
• Automata for unordered trees

This page was built for publication: Feature automata and recognizable sets of feature trees

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