Mathematical logic and quantum finite state automata

DOI10.1016/j.tcs.2009.01.030zbMath1163.68324OpenAlexW2298616885MaRDI QIDQ1017412

Ilze Dzelme-Bērziņa

Publication date: 19 May 2009

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

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

zbMATH Keywords

first-order logicmodular logicmeasure-many quantum finite-state automatameasure-once quantum finite-state automataquantum finite-state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Logic in artificial intelligence (68T27)

Related Items (2)

Quantum \(\omega\)-automata over infinite words and their relationships ⋮ On relation between linear temporal logic and quantum finite automata

Cites Work

• Exact results for accepting probabilities of quantum automata.
• Quantum automata and quantum grammars
• Two-way finite automata with quantum and classical states.
• On a generalization of quantifiers
• Weak Second‐Order Arithmetic and Finite Automata
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• Decision Problems of Finite Automata Design and Related Arithmetics
• STACS 2004
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• SOFSEM 2006: Theory and Practice of Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical logic and quantum finite state automata