Pages that link to "Item:Q5168415"
From MaRDI portal
The following pages link to TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415):
Displaying 8 items.
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Minimal useful size of counters for (real-time) multicounter automata (Q1647318) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- New results on the minimum amount of useful space (Q2814840) (← links)
- A time-space tradeoff for language recognition (Q3316594) (← links)
- RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIME (Q3680305) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)