Cascades of tree-automata and computations in universal algebras
From MaRDI portal
Publication:4404146
DOI10.1007/BF01795940zbMath0277.94031OpenAlexW2009679967MaRDI QIDQ4404146
Publication date: 1973
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01795940
Related Items (2)
Characterizing CTL-like logics on finite trees. ⋮ Cascade Products and Temporal Logics on Finite Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Generalized sequential machine maps
- Tree acceptors and some of their applications
- The minimalization of tree automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Mappings and grammars on trees
- Heterogeneous algebras
This page was built for publication: Cascades of tree-automata and computations in universal algebras