Energy complexity of regular languages

DOI10.1016/j.tcs.2023.114291OpenAlexW4388486943MaRDI QIDQ6199407

Firat Kiyak, A. C. Cem Say

Publication date: 23 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114291

zbMATH Keywords

information theoryreversibilityquantum finite automataenergy complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Characterizations of one-way general quantum finite automata
• Quantum automata and quantum grammars
• Reversible space equals deterministic space
• Regular languages accepted by quantum automata
• Energy complexity of regular language recognition
• Aspects of Reversibility for Classical Automata
• Quantum Finite Automata: A Modern Introduction
• Reversibility and adiabatic computation: trading time and space for energy
• Characterizations of 1-Way Quantum Finite Automata
• On quantum and probabilistic communication
• Irreversibility and Heat Generation in the Computing Process
• Finite Markov Chains and Algorithmic Applications
• Logical Reversibility of Computation

This page was built for publication: Energy complexity of regular languages