Characterization of tree automata based on quantum logic
From MaRDI portal
Publication:2113952
Recommendations
- A theory of computation based on quantum logic. I
- Automata theory based on quantum logic: Some characterizations
- Automata theory based on quantum logic: reversibilities and pushdown automata
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
Cites work
- scientific article; zbMATH DE number 1200800 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- A theory of computation based on quantum logic. I
- Automata theory based on quantum logic. I
- Automata theory based on quantum logic. II.
- Automata theory based on quantum logic: Some characterizations
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Characterization of sequential quantum machines
- Characterizations of 1-Way Quantum Finite Automata
- Characterizations of complete residuated lattice-valued finite tree automata
- Characterizations of quantum automata
- Coding tree languages based on lattice-valued logic
- Fuzzy tree automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Grammar theory based on quantum logic
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
- On characterization of fuzzy tree pushdown automata
- On the power of two-way multihead quantum finite automata
- Orthomodular structures as quantum logics. Transl. from the Slovak
- Quantum \(\omega\)-automata over infinite words and their relationships
- Quantum automata and quantum grammars
- Quantum finite automata: advances on Bertoni's ideas
- Quantum pushdown automata
- Quantum pushdown automata with garbage tape
- State hyperstructures of tree automata based on lattice-valued logic
- Subdirect decompositions of lattice effect algebras
- The descriptional power of queue automata of constant length
- The logic of quantum mechanics
- Tree acceptors and some of their applications
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
This page was built for publication: Characterization of tree automata based on quantum logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113952)
