The following pages link to (Q5592246):
Displaying 50 items.
- Regular production systems and triangle tilings (Q1013129) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- Small overlap monoids. I: The word problem. (Q1024387) (← links)
- Small overlap monoids. II: Automatic structures and normal forms. (Q1024392) (← links)
- Space-filling curves in adaptive curvilinear coordinates for computer numerically controlled five-axis machining (Q1025326) (← links)
- A formal approach to subgrammar extraction for NLP (Q1025681) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- An axiom system for sequence-based specification (Q1044834) (← links)
- Limitations of learning in automata-based systems (Q1046075) (← links)
- Real functions and numbers defined by Turing machines (Q1050122) (← links)
- A low and a high hierarchy within NP (Q1052097) (← links)
- Analyse numérique du problème des ondes longues en eau peu profonde (Q1055265) (← links)
- Init and Anf operating on \(\omega\)-languages (Q1056238) (← links)
- A note on the ''parallel computation thesis'' (Q1056537) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- A space-hierarchy result on two-dimensional alternating Turing machines with only universal states (Q1057650) (← links)
- An application of the matrix representation of transductions (Q1057659) (← links)
- The complexity of finding minimum-length generator sequences (Q1058290) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- Complexity and decidability for chain code picture languages (Q1058857) (← links)
- Hierarchies of hyper-AFLs (Q1058860) (← links)
- On proving time constructibility of functions (Q1059393) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- The complexity of some decision problems about two-dimensional array grammars (Q1062464) (← links)
- Robust algorithms: a different approach to oracles (Q1063417) (← links)
- A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Exposure to deadlock for communicating processes is hard to detect (Q1064050) (← links)
- Parallel and sequential transformations on digital images (Q1064066) (← links)
- Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit (Q1064067) (← links)
- Variations on the technique of Ďuriš and Galil (Q1064791) (← links)
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538) (← links)
- Classes of regular and context-free languages over countably infinite alphabets (Q1068559) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Three-way automata on rectangular types over a one-letter alphabet (Q1075759) (← links)
- Three-way two-dimensional finite automata with rotated inputs (Q1077165) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
- Pattern selector grammars and several parsing algorithms in the context- free style (Q1081314) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Alternating on-line Turing machines with only universal states and small space bounds (Q1083207) (← links)
- The theory of ends, pushdown automata, and second-order logic (Q1084096) (← links)
- Finite automata play the repeated prisoner's dilemma (Q1084866) (← links)
