Feature automata and recognizable sets of feature trees
From MaRDI portal
Publication:5044748
Recommendations
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)
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)