Friedrich Otto

From MaRDI portal
Person:287428

Available identifiers

zbMath Open otto.friedrichMaRDI QIDQ287428

List of research outcomes

PublicationDate of PublicationType
A survey on automata with translucent letters2024-02-28Paper
https://portal.mardi4nfdi.de/entity/Q61904392024-02-06Paper
Non-returning deterministic and nondeterministic finite automata with translucent letters2024-02-02Paper
One-Way Restarting Automata and Their Sensitivitys2023-08-15Paper
Restrictions of congruences generated by finite canonical string-rewriting systems2022-12-09Paper
Some independence results for equational unification2022-12-09Paper
FDT is undecidable for finitely presented monoids with solvable word problems2022-12-09Paper
ON THE POWER OF RRWW-AUTOMATA2022-12-06Paper
https://portal.mardi4nfdi.de/entity/Q58675242022-09-14Paper
https://portal.mardi4nfdi.de/entity/Q50615212022-03-11Paper
On restarting automata with auxiliary symbols and small window size2022-01-12Paper
https://portal.mardi4nfdi.de/entity/Q50163722021-12-13Paper
Two-Sided Strictly Locally Testable Languages2021-11-15Paper
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*2021-11-15Paper
On the expressive power of stateless ordered restart-delete automata2021-09-28Paper
Reversibility for stateless ordered RRWW-automata2021-07-23Paper
https://portal.mardi4nfdi.de/entity/Q49881642021-05-12Paper
https://portal.mardi4nfdi.de/entity/Q49881652021-05-12Paper
Two-head finite-state acceptors with translucent letters2020-10-22Paper
Linear automata with translucent letters and linear context-free trace languages2020-07-21Paper
A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata2020-07-20Paper
On deterministic ordered restart-delete automata2019-10-18Paper
On shrinking restarting automata of window size one and two2019-10-15Paper
Automata with cyclic move operations for picture languages2019-07-18Paper
https://portal.mardi4nfdi.de/entity/Q46230402019-02-18Paper
On deterministic ordered restart-delete automata2018-11-22Paper
Weighted restarting automata2018-10-22Paper
Nondeterministic Ordered Restarting Automata2018-07-24Paper
The word matching problem is undecidable for finite special string-rewriting systems that are confluent2018-07-04Paper
On the descriptional complexity of stateless deterministic ordered restarting automata2018-03-21Paper
Growing context-sensitive languages and Church-Rosser languages2017-12-04Paper
Cross-sections for finitely presented monoids with decidable word problems2017-11-17Paper
On the property of preserving regularity for string-rewriting systems2017-11-17Paper
Deleting deterministic restarting automata with two windows2017-10-13Paper
A pumping lemma for ordered restarting automata2017-08-31Paper
Regulated variants of limited context restarting automata2017-06-15Paper
Some classes of rational functions for pictures2017-03-24Paper
Weighted Restarting Automata as Language Acceptors2016-11-09Paper
Reversible Ordered Restarting Automata2016-09-30Paper
On Ordered RRWW-Automata2016-08-30Paper
https://portal.mardi4nfdi.de/entity/Q57404312016-07-26Paper
Weighted restarting automata and pushdown relations2016-05-26Paper
On the Effects of Nondeterminism on Ordered Restarting Automata2016-03-10Paper
Deterministic Ordered Restarting Automata that Compute Functions2015-11-10Paper
Deterministic ordered restarting automata for picture languages2015-10-29Paper
Asynchronous Parallel Communicating Systems of Pushdown Automata2015-10-02Paper
Weighted Restarting Automata and Pushdown Relations2015-09-22Paper
Restarting transducers, regular languages, and rational relations2015-09-04Paper
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata2015-08-07Paper
Free Word-Order and Restarting Automata2015-06-26Paper
Lambda-confluence for context rewriting systems2015-05-18Paper
Two-dimensional Sgraffito automata2015-04-28Paper
On Visibly Pushdown Trace Languages2015-02-20Paper
Ordered Restarting Automata for Picture Languages2015-01-13Paper
Restarting Automata for Picture Languages: A Survey on Recent Developments2014-09-26Paper
Systems of parallel communicating restarting automata2014-08-22Paper
On the classes of languages accepted by limited context restarting automata2014-08-22Paper
On the Descriptional Complexity of Deterministic Ordered Restarting Automata2014-08-07Paper
Extended Two-Way Ordered Restarting Automata for Picture Languages2014-03-31Paper
ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA2014-03-10Paper
ON CENTRALIZED PARALLEL COMMUNICATING GRAMMAR SYSTEMS WITH CONTEXT-SENSITIVE COMPONENTS2013-10-23Paper
Globally deterministic CD-systems of stateless R-automata with window size 12013-10-22Paper
Lambda-Confluence Is Undecidable for Clearing Restarting Automata2013-08-07Paper
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata2013-08-07Paper
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata2013-08-05Paper
New Results on Deterministic Sgraffito Automata2013-06-28Paper
ON PROPER LANGUAGES AND TRANSFORMATIONS OF LEXICALIZED TYPES OF AUTOMATA2013-06-03Paper
Asynchronous PC Systems of Pushdown Automata2013-03-18Paper
On Centralized PC Grammar Systems with Context-Sensitive Components2012-11-02Paper
Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata2012-11-02Paper
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata2012-11-01Paper
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata2012-09-20Paper
On CD-systems of stateless deterministic R-automata with window size one2012-08-17Paper
Characterizing the Rational Functions by Restarting Transducers2012-06-08Paper
https://portal.mardi4nfdi.de/entity/Q28823912012-05-04Paper
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store2012-02-28Paper
Characterizing the Regular Languages by Nonforgetting Restarting Automata2011-07-29Paper
On Restarting Automata with Window Size One2011-07-29Paper
Globally Deterministic CD-Systems of Stateless R(1)-Automata2011-06-03Paper
A hierarchy of monotone deterministic non-forgetting restarting automata2011-03-30Paper
An Automata-Theoretical Characterization of Context-Free Trace Languages2011-02-15Paper
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata2011-02-11Paper
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata2011-02-02Paper
On stateless deterministic restarting automata2010-12-13Paper
ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA2010-11-11Paper
On Lexicalized Well-Behaved Restarting Automata That Are Monotone2010-08-31Paper
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages2010-05-26Paper
ON ALTERNATING PHRASE-STRUCTURE GRAMMARS2010-03-09Paper
COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA2010-01-29Paper
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions2010-01-28Paper
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata2009-11-27Paper
Single-Path Restarting Tree Automata2009-11-05Paper
Parallel Communicating Grammar Systems with Regular Control2009-11-05Paper
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages2009-09-14Paper
https://portal.mardi4nfdi.de/entity/Q51929842009-08-10Paper
Left-to-right regular languages and two-way restarting automata2009-07-15Paper
ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA2009-04-14Paper
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata2009-04-02Paper
On the Gap-Complexity of Simple RL-Automata2009-03-26Paper
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata2009-03-05Paper
On Stateless Deterministic Restarting Automata2009-02-03Paper
Learning Analysis by Reduction from Positive Data2008-11-27Paper
On Alternating Phrase-Structure Grammars2008-11-20Paper
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata2008-11-20Paper
On determinism versus nondeterminism for restarting automata2008-10-08Paper
Restarting Tree Automata and Linear Context-Free Tree Languages2008-09-04Paper
A Measure for the Degree of Nondeterminism of Context-Free Languages2008-06-10Paper
On the complexity of 2-monotone restarting automata2008-06-06Paper
Restarting Tree Automata2008-03-07Paper
Strictly Deterministic CD-Systems of Restarting Automata2008-02-26Paper
Sequential monotonicity for restarting automata2008-02-15Paper
Some decidability and undecidability results on Green's relations for automatic monoids.2007-12-19Paper
https://portal.mardi4nfdi.de/entity/Q54299782007-12-05Paper
Correctness Preservation and Complexity of Simple RL-Automata2007-09-06Paper
Reduction relations for monoid semirings2007-08-24Paper
On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone2007-05-02Paper
SHRINKING RESTARTING AUTOMATA2007-04-25Paper
Restarting automata with restricted utilization of auxiliary symbols2007-01-09Paper
Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata2007-01-09Paper
Degrees of non-monotonicity for restarting automata2007-01-09Paper
Implementation and Application of Automata2006-11-13Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Fundamentals of Computation Theory2006-10-20Paper
Uniform decision problems for automatic semigroups.2006-10-19Paper
Developments in Language Theory2006-06-23Paper
https://portal.mardi4nfdi.de/entity/Q57166112006-01-10Paper
Developments in Language Theory2005-12-22Paper
Developments in Language Theory2005-12-22Paper
Hierarchies of weakly monotone restarting automata2005-07-13Paper
On state-alternating context-free grammars2005-06-30Paper
On higher order homological finiteness of rewriting systems.2005-06-23Paper
https://portal.mardi4nfdi.de/entity/Q30222982005-06-23Paper
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages2005-05-12Paper
FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT2004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q47379212004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44725002004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44532192004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44520522004-02-11Paper
McNaughton families of languages.2003-08-17Paper
For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide2003-07-30Paper
Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.2003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q47904432003-05-22Paper
THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS2002-12-15Paper
ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS2002-12-15Paper
SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID2002-12-15Paper
Some results on Green's relations for monoids presented by monadic string-rewriting systems2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q43307302002-09-29Paper
A completion procedure for finitely presented groups that is based on word cycles2002-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27020532002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q27089562001-11-07Paper
https://portal.mardi4nfdi.de/entity/Q27047142001-09-30Paper
https://portal.mardi4nfdi.de/entity/Q45147362000-11-14Paper
https://portal.mardi4nfdi.de/entity/Q46993102000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q49422742000-10-09Paper
Repetitiveness of languages generated by morphisms2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49386132000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q49386772000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42342471999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q38387581999-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42342991999-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42467371999-06-15Paper
https://portal.mardi4nfdi.de/entity/Q42271341999-05-31Paper
https://portal.mardi4nfdi.de/entity/Q38390751999-03-14Paper
Some undecidability results concerning the property of preserving regularity1999-01-12Paper
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids1999-01-06Paper
https://portal.mardi4nfdi.de/entity/Q44215991999-01-01Paper
Growing context-sensitive languages and Church-Rosser languages1998-08-30Paper
Equational unification, word unification, and 2nd-order equational unification1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43495781998-06-01Paper
Single versus simultaneous equational unification and equational unification for variable-permuting theories1998-02-04Paper
https://portal.mardi4nfdi.de/entity/Q43645961997-11-17Paper
https://portal.mardi4nfdi.de/entity/Q43479781997-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43480231997-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43480241997-11-09Paper
For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)1997-09-25Paper
https://portal.mardi4nfdi.de/entity/Q43362751997-08-07Paper
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general1997-02-28Paper
Finite derivation type implies the homological finiteness condition \(FP_ 3\)1996-03-18Paper
Codes modulo finite monadic string-rewriting systems1995-11-06Paper
https://portal.mardi4nfdi.de/entity/Q43103271995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q48462571995-08-23Paper
On confluence versus strong confluence for one-rule trace-rewriting systems1995-07-24Paper
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups1994-11-24Paper
On the problem of generating small convergent systems1994-08-31Paper
Computing presentations for subgroups of polycyclic groups and of context-free groups1994-08-29Paper
A finiteness condition for rewriting systems1994-08-29Paper
On weakly confluent monadic string-rewriting systems1994-01-09Paper
https://portal.mardi4nfdi.de/entity/Q40356661993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40365701993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40387661993-05-18Paper
Completing a finite special string-rewriting system on the congruence class of the empty word1992-09-27Paper
The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems1992-09-27Paper
It is undecidable whether a finite special string-rewriting system presents a group1992-06-28Paper
When is an extension of a specification consistent? Decidable and undecidable cases1992-06-28Paper
Decision problems for finite special string-rewriting systems that are confluent on some congruence class1991-01-01Paper
Overlaps in free partially commutative monoids1991-01-01Paper
On ground-confluence of term rewriting systems1990-01-01Paper
About the descriptive power of certain classes of finite string-rewriting systems1989-01-01Paper
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems1989-01-01Paper
On deciding confluence of finite string-rewriting systems modulo partial commutativity1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38327751989-01-01Paper
An example of a one-relator group that is not a one-relation monoid1988-01-01Paper
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule1988-01-01Paper
Pseudo-natural algorithms for finitely generated presentations of monoids and groups1988-01-01Paper
Elements of finite order for finite weight-reducing and confluent Thue systems1988-01-01Paper
Commutativity in groups presented by finite Church-Rosser Thue systems1988-01-01Paper
Church-Rosser Thue systems and formal languages1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38252361988-01-01Paper
Using string-rewriting for solving the word problem for finitely presented groups1987-01-01Paper
On deciding the confluence of a finite string-rewriting system on a given congruence class1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30269921987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37757141987-01-01Paper
Finite canonical rewriting systems for congruences generated by concurrency relations1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37879901987-01-01Paper
On two problems related to cancellativity1986-01-01Paper
On deciding whether a monoid is a free monoid or is a group1986-01-01Paper
The problems of cyclic equality and conjugacy for finite complete rewriting systems1986-01-01Paper
The undecidability of self-embedding for finite semi-Thue and Thue systems1986-01-01Paper
Church–Rosser Thue Systems that Present Free Monoids1986-01-01Paper
Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems1986-01-01Paper
The Verifiability of Two-Party Protocols1986-01-01Paper
Classes of regular and context-free languages over countably infinite alphabets1985-01-01Paper
On the security of name-stamp protocols1985-01-01Paper
Complexity results on the conjugacy problem for monoids1985-01-01Paper
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups1985-01-01Paper
On the verifiability of two-party algebraic protocols1985-01-01Paper
Cancellation rules and extended word problems1985-01-01Paper
Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37186941985-01-01Paper
A note on thue systems with a single defining relation1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47220581985-01-01Paper
Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group1984-01-01Paper
Finite complete rewriting systems and the complexity of word problem1984-01-01Paper
Conjugacy in monoids with a special Church-Rosser presentation is decidable1984-01-01Paper
Some undecidability results for non-monadic Church-Rosser Thue systems1984-01-01Paper
The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39346011982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39029901980-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Friedrich Otto

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:287428&oldid=10626011"
Powered by MediaWiki