scientific article; zbMATH DE number 2090013
From MaRDI portal
Publication:4808680
zbMath1077.68043MaRDI QIDQ4808680
Marats Golovkins, Maksim Kravtsev
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2387/23870574.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Complexity of Promise Problems on Classical and Quantum Automata ⋮ Size lower bounds for quantum automata ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Some formal tools for analyzing quantum automata. ⋮ Trace monoids with idempotent generators and measure-only quantum automata ⋮ Artin’s Conjecture and Size of Finite Probabilistic Automata ⋮ On a class of languages recognizable by probabilistic reversible decide-and-halt automata ⋮ Characterizations of one-way general quantum finite automata ⋮ Quantum finite automata with control language
This page was built for publication:
