The following pages link to Friedrich Otto (Q287428):
Displaying 28 items.
- Weighted restarting automata and pushdown relations (Q287429) (← links)
- On CD-systems of stateless deterministic R-automata with window size one (Q439938) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- On higher order homological finiteness of rewriting systems. (Q557065) (← links)
- On state-alternating context-free grammars (Q557822) (← links)
- On stateless deterministic restarting automata (Q611046) (← links)
- Parallel communicating grammar systems with regular control and skeleton preserving FRR automata (Q620962) (← links)
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\) (Q674765) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- Restarting automata with restricted utilization of auxiliary symbols (Q860860) (← links)
- Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata (Q860892) (← links)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- On the complexity of 2-monotone restarting automata (Q927391) (← links)
- On determinism versus nondeterminism for restarting automata (Q948093) (← links)
- Two-dimensional hierarchies of proper languages of lexicalized FRR-automata (Q1041046) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids (Q1273769) (← links)
- On the problem of generating small convergent systems (Q1332650) (← links)
- Finite derivation type implies the homological finiteness condition \(FP_ 3\) (Q1338340) (← links)
- Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- Some results on equational unification (Q6488537) (← links)
