A Kleene Theorem for Forest Languages
From MaRDI portal
Recommendations
Cites work
- A Characterization of Machine Mappings
- A Kleene theorem for weighted tree automata
- Algebraic recognizability of regular tree languages
- Bottom-up and top-down tree transformations— a comparison
- Forest Expressions
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3744559 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 1200800 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (Why is no real title available?)
- Morphismes et bimorphismes d'arbres
- On the definition of a family of automata
- On the minimization of XML schemas and tree automata for unranked trees
- Properties of substitutions and unifications
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
Cited in
(5)- Kleene and Büchi theorems for weighted forest languages over M-monoids
- Forest Expressions
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- scientific article; zbMATH DE number 4182835 (Why is no real title available?)
- scientific article; zbMATH DE number 4182836 (Why is no real title available?)
This page was built for publication: A Kleene Theorem for Forest Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618626)