The following pages link to (Q5592246):
Displaying 50 items.
- On solving star equations (Q1085619) (← links)
- On the regular equivalence problem for regular Thue systems (Q1087011) (← links)
- On \(\Delta ^ P_ 2\)-immunity (Q1087016) (← links)
- The space complexity of the unique decipherability problem (Q1087017) (← links)
- On pebble automata (Q1088408) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- Microeconomic foundations of cyclical irregularities or ''chaos'' (Q1089240) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- A hierarchy of random-context grammars and automata (Q1091151) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- The parallel complexity of deadlock detection (Q1091805) (← links)
- The undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← links)
- Boolean delay equations. II: Periodic and aperiodic solutions (Q1092243) (← links)
- A Yacc extension for LRR grammar parsing (Q1092677) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- Parallel parsing of programming languages (Q1094886) (← links)
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- A note on complete problems for complexity classes (Q1097029) (← links)
- Several properties of array languages (Q1097039) (← links)
- The membership and equivalence problems for picture languages (Q1098327) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- A classification of complexity core lattices (Q1099613) (← links)
- The method of forced enumeration for nondeterministic automata (Q1099620) (← links)
- Language complexity on the synchronous anonymous ring (Q1102125) (← links)
- Two-dimensional iterative arrays: Characterizations and applications (Q1102749) (← links)
- Automata accepting primitive words (Q1103732) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- Theory of traces (Q1107296) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- There are no fully space constructible functions between log log n and log n (Q1108005) (← links)
- Remarks on string-matching and one-way multihead automata (Q1108049) (← links)
- \(\Sigma_ 2SPACE(n)\) is closed under complement (Q1108795) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- On sparse oracles separating feasible complexity classes (Q1111385) (← links)
- Grammatical inference for even linear languages based on control sets (Q1111403) (← links)
- On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
- Pushdown automata with reversal-bounded counters (Q1112611) (← links)
- A note on three-way two dimensional alternating Turing machines (Q1112612) (← links)
- An incompleteness result in process algebra (Q1113665) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- Some considerations about NPRIORITY(1) without ROM (Q1113673) (← links)
- A generalization of automatic sequences (Q1114405) (← links)
- A pumping result for 2-context-free languages (Q1114418) (← links)
