The following pages link to Friedrich Otto (Q287428):
Displaying 50 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)
- Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← 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)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
- (Q791313) (redirect page) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Conjugacy in monoids with a special Church-Rosser presentation is decidable (Q801163) (← 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)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← 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)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- Classes of regular and context-free languages over countably infinite alphabets (Q1068559) (← links)
- On two problems related to cancellativity (Q1070349) (← links)
- On the security of name-stamp protocols (Q1071729) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- On deciding whether a monoid is a free monoid or is a group (Q1075439) (← links)
- On the verifiability of two-party algebraic protocols (Q1083426) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- The undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← links)
- An example of a one-relator group that is not a one-relation monoid (Q1101550) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- Elements of finite order for finite weight-reducing and confluent Thue systems (Q1121013) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- It is undecidable whether a finite special string-rewriting system presents a group (Q1184861) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids (Q1273769) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
