Quantum Reversible Fuzzy Grammars
From MaRDI portal
Publication:3305479
DOI10.1007/978-981-15-0105-0_10zbMath1452.68094OpenAlexW2970121892MaRDI QIDQ3305479
Publication date: 7 August 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-0105-0_10
Formal languages and automata (68Q45) Quantum computation (81P68) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grammar theory based on quantum logic
- A theory of computation based on quantum logic. I
- Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
- A Simple and Efficient Universal Reversible Turing Machine
- Reversible arithmetic logic unit for quantum arithmetic
- Finite automata based on quantum logic and monadic second-order quantum logic
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- Logical Reversibility of Computation
- Automata theory based on quantum logic. II.