Succinctness of two-way probabilistic and quantum finite automata

Abstract

special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications

Keywords

• quantum and probabilistic automata
• succinctness
• probability amplification
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]