GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA

DOI10.1142/S0129054103002060zbMath1075.68028OpenAlexW2053030148MaRDI QIDQ5696942

Beatrice Palano, Carlo Mereghetti, Alberto Bertoni

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103002060

zbMATH Keywords

difference setsquantum automataGolomb rulersdifference covers

Mathematics Subject Classification ID

Related Items (10)

Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ Potential of Quantum Finite Automata with Exact Acceptance ⋮ Preface ⋮ The complexity of minimum difference cover ⋮ Promise problems solved by quantum and classical finite automata ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Small size quantum automata recognizing some regular languages ⋮ The descriptional power of queue automata of constant length ⋮ On the complexity of constructing Golomb rulers ⋮ Quantum finite automata with control language

Cites Work

• Unnamed Item
• Quorums from difference covers
• Quantum automata and quantum grammars
• The chords' problem
• Projective planes and congestion-free networks
• Regular languages accepted by quantum automata
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• Characterizations of 1-Way Quantum Finite Automata
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• A class of binary recurrent codes with limited error propagation
• Difference Sets

This page was built for publication: GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA