Pages that link to "Item:Q5672196"
From MaRDI portal
The following pages link to Time and tape complexity of pushdown automaton languages (Q5672196):
Displayed 33 items.
- Partitions with minimum entropy of regions in \(\mathbb R^{2}\) (Q287135) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- A multiple-heaps algorithm for parallel simulation of collision systems (Q697736) (← links)
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows (Q1005511) (← links)
- Complexity and decidability for chain code picture languages (Q1058857) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- On pebble automata (Q1088408) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Time complexity of languages recognized by one-way multihead pushdown automata (Q1158973) (← links)
- A note on two-way nondeterministic pushdown automata (Q1170034) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Notes on looping deterministic two-way pushdown automata (Q1318758) (← links)
- Iterative deepening multiobjective \(A^{*}\) (Q1351151) (← links)
- Time complexity of loop-free two-way pushdown automata (Q1838833) (← links)
- A simulation result for two-way pushdown automata (Q1838834) (← links)
- A frame for general divide-and-conquer recurrences (Q1847368) (← links)
- A simplified correctness proof for a well-known algorithm computing strongly connected components. (Q1853027) (← links)
- Improved algorithm for all pairs shortest paths (Q2390321) (← links)
- On the computational power of pushdown automata (Q2542990) (← links)
- Pushdown automata with counters (Q2554231) (← links)
- On two-way multihead automata (Q2559145) (← links)
- Self-reducibility (Q2639637) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- A Practical Simulation Result for Two-Way Pushdown Automata (Q2830212) (← links)
- Maximally-Polyvariant Partial Evaluation in Polynomial Time (Q3179173) (← links)
- (Q3741089) (← links)
- Relationships between pushdown automata with counters and complexity classes (Q4118823) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- (Q4146255) (← links)
- Sweeping input-driven pushdown automata (Q6199874) (← links)