GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA

DOI10.1142/S0129054103002060MaRDI QIDQ5696942zbMATH OpenOpenAlexFDO

Authors Carlo Mereghetti, Beatrice Palano, 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 coversdifference setsGolomb rulersquantum automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Recommendations

• Size lower bounds for quantum automata
• Size lower bounds for quantum automata
• Quantum finite automata and weighted automata
• Lower Bounds for Generalized Quantum Finite Automata
• Succinctness of two-way probabilistic and quantum finite automata
• SOFSEM 2006: Theory and Practice of Computer Science
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• STACS 2004
• Algebraic results on quantum automata
• On the decidability of the intersection problem for quantum automata and context-free languages

Cites work

• A class of binary recurrent codes with limited error propagation
• Characterizations of 1-Way Quantum Finite Automata
• Difference Sets
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• Projective planes and congestion-free networks
• Quantum automata and quantum grammars
• Quorums from difference covers
• Regular languages accepted by quantum automata
• The chords' problem

Cited in

(12)

• On the complexity of constructing Golomb rulers
• The descriptional power of queue automata of constant length
• Boolean language operations on nondeterministic automata with a pushdown of constant height
• The complexity of minimum difference cover
• Small size quantum automata recognizing some regular languages
• Potential of quantum finite automata with exact acceptance
• Quantum finite automata with control language
• Promise problems solved by quantum and classical finite automata
• Quantum finite automata: advances on Bertoni's ideas
• Preface
• Latvian quantum finite state automata for unary languages
• On some decision problems on quantum automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696942)