Characterization of tree automata based on quantum logic
From MaRDI portal
Publication:2113952
DOI10.1007/S10773-022-04974-6OpenAlexW4210799552MaRDI QIDQ2113952FDOQ2113952
Publication date: 14 March 2022
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-022-04974-6
Formal languages and automata (68Q45) Quantum computation (81P68) Quantum logic (03G12) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)
Cites Work
- The logic of quantum mechanics
- Orthomodular structures as quantum logics. Transl. from the Slovak
- Characterizations of complete residuated lattice-valued finite tree automata
- Title not available (Why is that?)
- Subdirect decompositions of lattice effect algebras
- Quantum automata and quantum grammars
- Tree acceptors and some of their applications
- Characterizations of 1-Way Quantum Finite Automata
- Automata theory based on quantum logic. I
- Characterizations of quantum automata
- Automata theory based on quantum logic: reversibilities and pushdown automata
- A theory of computation based on quantum logic. I
- Automata theory based on quantum logic. II.
- Automata theory based on quantum logic: Some characterizations
- Characterization of sequential quantum machines
- Quantum finite automata: advances on Bertoni's ideas
- Title not available (Why is that?)
- Quantum pushdown automata
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Fuzzy tree automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Quantum \(\omega\)-automata over infinite words and their relationships
- On the power of two-way multihead quantum finite automata
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- Grammar theory based on quantum logic
- Coding tree languages based on lattice-valued logic
- Quantum Pushdown Automata with Garbage Tape
- On characterization of fuzzy tree pushdown automata
- The descriptional power of queue automata of constant length
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
- State hyperstructures of tree automata based on lattice-valued logic
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)
