The following pages link to Abuzer Yakaryılmaz (Q256422):
Displaying 50 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- The complexity of debate checking (Q493647) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- A new family of nonstochastic languages (Q656590) (← links)
- Error-free affine, unitary, and probabilistic OBDDs (Q778003) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- (Q1992111) (redirect page) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Automata and quantum computing (Q2244834) (← links)
- Computational limitations of affine automata (Q2326807) (← links)
- Quantum alternation (Q2361668) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Real-Time Vector Automata (Q2842793) (← links)
- Finite state verifiers with constant randomness (Q2878753) (← links)
- Finite State Verifiers with Constant Randomness (Q2904461) (← links)
- The Minimum Amount of Useful Space: New Results and New Directions (Q2921994) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- Quantum, Stochastic, and Pseudo Stochastic Languages with Few States (Q2945548) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- Computation with Narrow CTCs (Q3007717) (← links)
- (Q3171611) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- Implications of Quantum Automata for Contextuality (Q3192275) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- (Q3455037) (← links)
- (Q4560202) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Superiority of one-way and realtime quantum machines (Q4649459) (← links)
- QUANTUM COUNTER AUTOMATA (Q4902895) (← links)
- Proving the Power of Postselection (Q4914314) (← links)
- Quantum Alternation (Q4928497) (← links)
- One-Counter Verifiers for Decidable Languages (Q4928501) (← links)
- (Q5016371) (← links)
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (Q5130748) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
- New Results on Vector and Homing Vector Automata (Q5207237) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- (Q5232904) (← links)
- FINITE AUTOMATA WITH ADVICE TAPES (Q5247170) (← links)
- Finite Automata with Advice Tapes (Q5300849) (← links)
