Some formal tools for analyzing quantum automata. (Q2490805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4536348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages accepted by quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small size quantum automata recognizing some regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable and Undecidable Problems about Quantum Automata / 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: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Finite and Pushdown Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems on integer matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and algebraic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of One-way Quantum Finite Automata with Periodic Behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5792485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of linear problems in fields / rank
 
Normal rank

Latest revision as of 14:19, 24 June 2024

scientific article
Language Label Description Also known as
English
Some formal tools for analyzing quantum automata.
scientific article

    Statements

    Some formal tools for analyzing quantum automata. (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2006
    0 references
    quantum automata
    0 references

    Identifiers