Energy complexity of regular languages

DOI10.1016/J.TCS.2023.114291MaRDI QIDQ6199407zbMATH OpenOpenAlexFDO

Authors 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

energy complexityinformation theoryquantum finite automatareversibility

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Aspects of reversibility for classical automata
• Characterizations of 1-Way Quantum Finite Automata
• Characterizations of one-way general quantum finite automata
• Energy complexity of regular language recognition
• Finite Markov Chains and Algorithmic Applications
• 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
• Quantum finite automata: a modern introduction
• Regular languages accepted by quantum automata
• Reversibility and adiabatic computation: trading time and space for energy
• Reversible space equals deterministic space

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

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