GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA (Q5696942): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages accepted by 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: Quorums from difference covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective planes and congestion-free networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chords' problem / 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: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and 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 class of binary recurrent codes with limited error propagation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054103002060 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053030148 / rank
 
Normal rank

Latest revision as of 09:39, 30 July 2024

scientific article; zbMATH DE number 2216312
Language Label Description Also known as
English
GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
scientific article; zbMATH DE number 2216312

    Statements

    Identifiers