On the decidability of the intersection problem for quantum automata and context-free languages

DOI10.1142/S0129054114400243MaRDI QIDQ5247175zbMATH OpenOpenAlexFDO

Authors Flavio D'Alessandro, Alberto Bertoni, Christian Choffrut

Publication date 23 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054114400243

zbMATH Keywords

algebraic groupscontext-free languagesquantum automata

Mathematics Subject Classification ID

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

Recommendations

• Quantum finite automata and linear context-free languages: a decidable problem
• Decidable and Undecidable Problems about Quantum Automata
• Undecidability on quantum finite automata
• Characterizations of 1-Way Quantum Finite Automata
• SOFSEM 2006: Theory and Practice of Computer Science

Cites work

• Decidable and Undecidable Problems about Quantum Automata
• Quantum automata and algebraic groups
• Quantum automata and quantum grammars
• Quantum finite automata and linear context-free languages: a decidable problem

Cited in

(6)

• Quantum finite automata: advances on Bertoni's ideas
• Quantum finite automata and linear context-free languages: a decidable problem
• Decidable and Undecidable Problems about Quantum Automata
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
• On the intersection problem for quantum finite automata
• On some decision problems on quantum automata

This page was built for publication: On the decidability of the intersection problem for quantum automata and context-free languages

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