Energy complexity of regular language recognition

DOI10.1007/978-3-031-07469-1_16MaRDI QIDQ2164753zbMATH OpenOpenAlexFDO

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

Publication date 16 August 2022

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

zbMATH Keywords

quantum finite automatareversibility

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

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

Cited in

(3)

• Energy complexity of computation
• Reversible computations of one-way counter automata
• Energy complexity of regular languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164753)