Pages that link to "Item:Q3495661"
From MaRDI portal
The following pages link to A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata (Q3495661):
Displaying 34 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Learning finite cover automata from queries (Q414872) (← links)
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- Automaticity. IV: Sequences, sets, and diversity (Q679096) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
- New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES (Q3021940) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- Probabilistic Acceptors for Languages over Infinite Words (Q3599062) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Similarity relations and cover automata (Q4680729) (← links)
- QUANTUM COUNTER AUTOMATA (Q4902895) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES (Q5249267) (← links)
- COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES (Q5696949) (← links)
- COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN (Q5704369) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Minimal cover-automata for finite languages (Q5958721) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
