Search results for "quantum finite automata"
showing 3 items of 73 documents
FINITE AUTOMATA WITH ADVICE TAPES
2014
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, demonstrate an infinite hierarchy of language classes recognized by automata with increasing advice lengths, and establish the relationships between this and the previously studied ways of providing advice to finite automata.
Jauni ieskati kvantu automātu stāvokļu skaita efektivitātē
2022
Kvantu galīgi automāti var sasniegt eksponenciālu stāvokļu skaitu efektivitāti, salīdzinot ar determinētiem galīgiem automātiem. Viena problēma, kurā ir zināms, ka kvantu galīgiem automātiem ir eksponenciālas priekšrocības, ir MODn problēma, taču nav zināma metode, kā uzkonstruēt tādu kvantu automātu. Šajā darbā eksponenciāli efektīvie MODn algoritmi tiek vispārināti jaunā algoritmā, kas samazina vajadzīgo stāvokļu skaitu. Jaunā algoritma saaistības ar esošiem virzieniem literatūrā tiek aprakstītas, un tiek piedāvātas divas jaunas skaitļu virknes, kuras varētu izmantot, lai uzkonstruētu tādus kvantu automātus.
Varieties Generated by Certain Models of Reversible Finite Automata
2006
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.