On the power of two-way multihead quantum finite automata (Q5223828): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1051/ita/2018020 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Undecidability on quantum finite 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: Multi-letter Reversible and Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling of RNA secondary structures using two-way quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying matrix product state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of multi-head finite automata: origins and directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Reversible Multi-head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible space equals deterministic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of equivalence between quantum sequential machines / 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: Characterizations of one-way general quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minimizing probabilistic and quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Way Reversible Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of sequential quantum machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchy and equivalence of multi-letter quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-letter quantum finite automata: decidability of the equivalence and minimization of states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially more concise quantum recognition of non-RMM regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-reversal multihead finite automata languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Finite State Based Models and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Promise problems solved by quantum and classical finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-tape finite automata with quantum and classical states / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of semi-quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State succinctness of two-way finite automata with quantum and classical states / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/ITA/2018020 / rank
 
Normal rank

Latest revision as of 16:25, 30 December 2024

scientific article; zbMATH DE number 7082539
Language Label Description Also known as
English
On the power of two-way multihead quantum finite automata
scientific article; zbMATH DE number 7082539

    Statements

    On the power of two-way multihead quantum finite automata (English)
    0 references
    0 references
    0 references
    18 July 2019
    0 references
    two-way deterministic finite automata (2DFA)
    0 references
    two-way reversible finite automata (2RFA)
    0 references
    two-way deterministic multihead finite automata (DMFA)
    0 references
    two-way reversible multihead finite automata (RMFA)
    0 references
    two-way quantum finite automata (2QFA)
    0 references
    two-way multihead quantum finite automata (2MQFA)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references