Mathematical logic and quantum finite state automata
type: Item
instance of: scholarly article
title: Mathematical logic and quantum finite state automata
zbMATH Open document ID: 1163.68324
author: Ilze Dzelme-Bērziņa
published in: Theoretical Computer Science
publication date: 2009-05-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 5554710
zbMATH Keywords: quantum finite-state automata
zbMATH Keywords: first-order logic
zbMATH Keywords: modular logic
zbMATH Keywords: measure-once quantum finite-state automata
zbMATH Keywords: measure-many quantum finite-state automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.01.030
OpenAlex ID: W2298616885
cites work: Q4542516
cites work: STACS 2004
cites work: Q4938665
cites work: Exact results for accepting probabilities of quantum automata.
cites work: Two-way finite automata with quantum and classical states.
cites work: Q4452048
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q5525343
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Q4058132
cites work: Relational queries computable in polynomial time
cites work: Languages that Capture Complexity Classes
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Quantum automata and quantum grammars
cites work: On a generalization of quantifiers
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q3806849
DOI: 10.1016/J.TCS.2009.01.030
description: scientific article; zbMATH DE number 5554710