Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with space-bounded
Search options answers only
not deleted
user 2367
Questions about space resources of computations in computational complexity or algorithms.
9
votes
Accepted
Completeness and Context-Sensitive Languages.
To answer your first question, a reducibility fitting your needs is log-lin-reducibility, which is logspace reducibility with the additional constraint that the size of the output string of the reduct …
- 6,795
6
votes
Accepted
Alternative to LBA for recognising context-sensitive languages
Here is an alternative model:
Benedek Nagy: Left-most derivation and shadow-pushdown automata for context-sensitive languages, ICCOMP'06: Proceedings of the 10th WSEAS international conference on Comp …
- 6,795
2
votes
Converting Kuroda normal form rules to the Penttonen normal form
You can find the proof in Penttonen's original research article:
Martti Penttonen, One-Sided and Two-Sided Context in Formal Grammars. Information and Control 25, pp. 371-392 (1974). https://doi.org …
- 6,795
4
votes
Problems complete for non-deterministic PSPACE
A class that was more familiar at the time than NPSPACE was the class of context-sensitive languages.
Let CSL denote the set of context-sensitive languages. By Kuroda's theorem (1960), this set is equ …
- 6,795
6
votes
NFA to 2DFA: what are the upper and lower bounds?
The recent survey Two-Way Finite Automata: Old and Recent Results by Pighizzini states in the introduction:
The costs of the simulations of 1NFAs by 2DFAs and of 2NFAs by 2DFAs
are still unknown …
- 6,795