Pages that link to "Item:Q3526538"
From MaRDI portal
The following pages link to TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538):
Displaying 12 items.
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- New results on the minimum amount of useful space (Q2814840) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS (Q3056282) (← links)
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* (Q5089680) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- (Q6070604) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- Push complexity: optimal bounds and unary inputs (Q6666805) (← links)