The following pages link to (Q5180413):
Displaying 50 items.
- On regular realizability problems for context-free languages (Q327306) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- On iterated hairpin completion (Q551189) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- Decreasing the bandwidth of a transition matrix (Q673904) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
- The recursion-theoretic structure of complexity classes (Q1064320) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- Lower bounds on communication overlap of networks (Q1095665) (← links)
- Remarks on languages acceptable in log log n space (Q1107318) (← links)
- There are no fully space constructible functions between log log n and log n (Q1108005) (← links)
- Optimal node ranking of trees (Q1113677) (← links)
- A space efficient algorithm for the monotone planar circuit value problem (Q1133895) (← links)
- A simulation result for the auxiliary pushdown automata (Q1136497) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- \(\varepsilon\)-productions in context-free grammars (Q1148693) (← links)
- Space complexity in on-line computation (Q1167539) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- WCS-analysis of the context-sensitive (Q1214919) (← links)
- On tape-bounded complexity classes and multihead finite automata (Q1215271) (← links)
- An observation on time-storage trade off (Q1217591) (← links)
- Space bounds for processing contentless inputs (Q1218269) (← links)
- The tape-complexity of context-independent developmental languages (Q1220791) (← links)
- Storage requirements for deterministic polynomial time recognizable languages (Q1230508) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- Bracket-languages are recognizable in logarithmic space (Q1235984) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)
- Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
- On inverse deterministic pushdown transductions (Q1245575) (← links)
- Lower bounds on space complexity for contextfree recognition (Q1251077) (← links)
- On the space complexity of recursive algorithms (Q1253916) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
- Size-depth tradeoffs for Boolean formulae (Q1318766) (← links)
- An optimal lower bound for nonregular languages (Q1330656) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Some notes on strong and weak log log n space complexity (Q1824397) (← links)
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space (Q1825656) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
