Energy complexity of regular language recognition

DOI10.1007/978-3-031-07469-1_16OpenAlexW4285271937MaRDI QIDQ2164753

Öykü Yılmaz, A. C. Cem Say, Meriç Üngör, Firat Kiyak

Publication date: 16 August 2022

Full work available at URL: https://arxiv.org/abs/2204.06025

zbMATH Keywords

reversibilityquantum finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Energy complexity of computation ⋮ Energy complexity of regular languages ⋮ Unnamed Item

Cites Work

• Characterizations of one-way general quantum finite automata
• Quantum automata and quantum grammars
• Regular languages accepted by quantum automata
• Automata and quantum computing
• Finite state verifiers with constant randomness
• Aspects of Reversibility for Classical Automata
• Characterizations of 1-Way Quantum Finite Automata
• On quantum and probabilistic communication
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation

This page was built for publication: Energy complexity of regular language recognition