Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_33 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1597440471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability on quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic results on quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogies and differences between quantum and stochastic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of 1-Way Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the equivalence for one-way quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A context-free language which is not acceptable by a probabilistic automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Automata and Stochastic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probability amplification in two-way quantum finite automata / rank
 
Normal rank

Latest revision as of 20:57, 1 July 2024

scientific article
Language Label Description Also known as
English
Languages Recognized with Unbounded Error by Quantum Finite Automata
scientific article

    Statements

    Identifiers