Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem

DOI10.1007/978-3-642-38771-5_9zbMath1381.68109arXiv1303.2967OpenAlexW1788369186MaRDI QIDQ5300831

Flavio D'Alessandro, Alberto Bertoni, Christian Choffrut

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

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

zbMATH Keywords

algebraic groupsdecidabilitycontext-free languagesquantum automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (1)

ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES

This page was built for publication: Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem