The following pages link to A. C. Cem Say (Q256421):
Displaying 43 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← 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)
- Problems in representing liquid tanks with monotonicity constraints: A case study in model-imposed limitations on the coverage of qualitative simulators (Q698431) (← links)
- Sound and complete qualitative simulation is impossible (Q814512) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- Sound and complete qualitative simulation needs ``quantitative'' filtering (Q1810896) (← links)
- Duration consistency filtering for qualitative simulation (Q1810898) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Advice hierarchies among finite automata (Q2084773) (← links)
- Energy complexity of regular language recognition (Q2164753) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q2164756) (← links)
- Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations (Q2576076) (← links)
- Real-Time Vector Automata (Q2842793) (← links)
- Finite State Verifiers with Constant Randomness (Q2904461) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- Optimal Bounds for Estimating Entropy with PMF Queries (Q2946389) (← links)
- Homing vector automata (Q2969985) (← links)
- One Time-traveling Bit is as Good as Logarithmically Many (Q2978537) (← links)
- Computation with Narrow CTCs (Q3007717) (← links)
- (Q3139197) (← links)
- (Q3171611) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- (Q3624042) (← links)
- (Q4435131) (← links)
- (Q4560202) (← links)
- QUANTUM COUNTER AUTOMATA (Q4902895) (← links)
- Proving the Power of Postselection (Q4914314) (← links)
- The Weakness of CTC Qubits and the Power of Approximate Counting (Q4973873) (← links)
- (Q5016373) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
- Models of Pushdown Automata with Reset (Q5199986) (← links)
- New Results on Vector and Homing Vector Automata (Q5207237) (← links)
- Language classes associated with automata over matrix groups (Q5223619) (← links)
- (Q5232904) (← links)
- FINITE AUTOMATA WITH ADVICE TAPES (Q5247170) (← links)
- Finite Automata with Advice Tapes (Q5300849) (← links)
- Debates with small transparent quantum verifiers (Q5890816) (← links)
- Debates with Small Transparent Quantum Verifiers (Q5891817) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q6077068) (← links)
- Energy complexity of regular languages (Q6199407) (← links)
