Friedrich Otto
Affiliations:- University of Kassel, Germany
According to our database1,
Friedrich Otto
authored at least 232 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Proceedings of the Developments in Language Theory - 28th International Conference, 2024
2023
Non-returning deterministic and nondeterministic finite automata with translucent letters.
RAIRO Theor. Informatics Appl., 2023
Proceedings of the Implementation and Application of Automata, 2023
2022
J. Autom. Lang. Comb., 2022
Int. J. Found. Comput. Sci., 2022
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022
2021
Theory Comput. Syst., 2021
J. Autom. Lang. Comb., 2021
RAIRO Theor. Informatics Appl., 2021
Fundam. Informaticae, 2021
2020
RAIRO Theor. Informatics Appl., 2020
A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020
Proceedings of the 20th Conference Information Technologies, 2020
2019
Proceedings of the Prague Stringology Conference 2019, 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Window size two suffices for deterministic monotone RWW-automata.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019
2018
J. Autom. Lang. Comb., 2018
RAIRO Theor. Informatics Appl., 2018
On the descriptional complexity of stateless deterministic ordered restarting automata.
Inf. Comput., 2018
Characterizations of LRR-languages by correctness-preserving computations.
Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018
2017
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017
On shrinking restarting automata.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
Proceedings of the 17th Conference on Information Technologies, 2017
Proceedings of the Developments in Language Theory - 21st International Conference, 2017
Proceedings of the Descriptional Complexity of Formal Systems, 2017
2016
RAIRO Theor. Informatics Appl., 2016
Proceedings of the Implementation and Application of Automata, 2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
Cyclically extended variants of Sgraffito and restarting automata for picture languages.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016
Proceedings of the Developments in Language Theory - 20th International Conference, 2016
2015
Theory Comput. Syst., 2015
Int. J. Found. Comput. Sci., 2015
Acta Informatica, 2015
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
Proceedings of the Reversible Computation - 7th International Conference, 2015
On a class of rational functions for pictures.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
Proceedings of the Descriptional Complexity of Formal Systems, 2015
Proceedings of the Algebraic Informatics - 6th International Conference, 2015
2014
RAIRO Theor. Informatics Appl., 2014
RAIRO Theor. Informatics Appl., 2014
Proceedings of the Implementation and Application of Automata, 2014
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014
Proceedings of the Language and Automata Theory and Applications, 2014
Proceedings of the Descriptional Complexity of Formal Systems, 2014
2013
On Centralized Parallel Communicating Grammar Systems with Context-Sensitive Components.
Int. J. Found. Comput. Sci., 2013
Int. J. Found. Comput. Sci., 2013
Int. J. Comput. Math., 2013
Acta Informatica, 2013
Proceedings of the Implementation and Application of Automata, 2013
Proceedings of the Implementation and Application of Automata, 2013
Proceedings of the Language and Automata Theory and Applications, 2013
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
2012
J. Comput. Syst. Sci., 2012
RAIRO Theor. Informatics Appl., 2012
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2012
Limited Context Restarting Automata and McNaughton Families of Languages.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012
Proceedings of the Language and Automata Theory and Applications, 2012
Proceedings of the Developments in Language Theory - 16th International Conference, 2012
Proceedings of the Descriptional Complexity of Formal Systems, 2012
Proceedings of the Languages Alive, 2012
2011
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
Theor. Comput. Sci., 2011
Theory Comput. Syst., 2011
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store.
RAIRO Theor. Informatics Appl., 2011
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems.
Fundam. Informaticae, 2011
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011
Pushdown Automata with Translucent Pushdown Symbols.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011
Proceedings of the Language and Automata Theory and Applications, 2011
Proceedings of the Developments in Language Theory - 15th International Conference, 2011
Proceedings of the Descriptional Complexity of Formal Systems, 2011
2010
Int. J. Found. Comput. Sci., 2010
Proceedings of the Implementation and Application of Automata, 2010
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages.
Proceedings of the Language and Automata Theory and Applications, 2010
Proceedings of the Developments in Language Theory, 14th International Conference, 2010
2009
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages.
Theor. Comput. Sci., 2009
RAIRO Theor. Informatics Appl., 2009
Int. J. Found. Comput. Sci., 2009
Inf. Comput., 2009
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
Proceedings of the Language and Automata Theory and Applications, 2009
Proceedings of the Algebraic Informatics, Third International Conference, 2009
Proceedings of the Algebraic Informatics, Third International Conference, 2009
2008
J. Autom. Lang. Comb., 2008
Proceedings of the Language and Automata Theory and Applications, 2008
Proceedings of the Conference on Theory and Practice of Information Technologies, 2008
2007
RAIRO Theor. Informatics Appl., 2007
Int. J. Found. Comput. Sci., 2007
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata.
IEICE Trans. Inf. Syst., 2007
Proceedings of the Implementation and Application of Automata, 2007
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007
On Determinism Versus Non-Determinism for Restarting Automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Proceedings of the Algebraic Informatics, Second International Conference, 2007
2006
Proceedings of the Recent Advances in Formal Languages and Applications, 2006
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
Theor. Comput. Sci., 2006
Theor. Comput. Sci., 2006
Proceedings of the Implementation and Application of Automata, 2006
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
Proceedings of the Computer Science, 2006
2005
RAIRO Theor. Informatics Appl., 2005
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
Inf. Comput., 2005
Fundam. Informaticae, 2005
Proceedings of the Implementation and Application of Automata, 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
Proceedings of the Developments in Language Theory, 9th International Conference, 2005
2004
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.
J. Autom. Lang. Comb., 2004
Proceedings of the Developments in Language Theory, 2004
2003
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
Theor. Comput. Sci., 2003
Proceedings of the Developments in Language Theory, 7th International Conference, 2003
Restarting Automata and Variants of j-Monotonicity.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003
Church-Rosser Languages and Their Relationship to Other Language Classes.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003
2002
J. Autom. Reason., 2002
Int. J. Algebra Comput., 2002
2001
J. Autom. Lang. Comb., 2001
Int. J. Algebra Comput., 2001
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
On the Power of RRWW-Automata.
Proceedings of the Words, Semigroups, and Transductions, 2001
2000
J. Autom. Lang. Comb., 2000
The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems.
Int. J. Algebra Comput., 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Further Results on Restarting Automata.
Proceedings of the International Colloquium on Words, 2000
Confluent Internal Contextual Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000
1999
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999
Proceedings of the Developments in Language Theory, 1999
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
1998
Theor. Comput. Sci., 1998
Theor. Comput. Sci., 1998
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput., 1998
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998
1997
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.
J. Autom. Reason., 1997
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet.
Fundam. Informaticae, 1997
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997
1996
For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3.
J. Symb. Comput., 1996
1995
Math. Syst. Theory, 1995
Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General.
Inf. Process. Lett., 1995
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995
1994
J. Symb. Comput., 1994
Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups.
Appl. Algebra Eng. Commun. Comput., 1994
Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract).
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994
1993
Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups.
Math. Log. Q., 1993
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4613-9771-7, 1993
1992
The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems.
Math. Syst. Theory, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
1991
J. Symb. Comput., 1991
Discret. Math., 1991
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class.
Acta Informatica, 1991
Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty Word.
Appl. Algebra Eng. Commun. Comput., 1991
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
Proceedings of the Applied Algebra, 1991
1990
A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990
Proceedings of the 10th International Conference on Automated Deduction, 1990
1989
On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity.
Theor. Comput. Sci., 1989
Theor. Comput. Sci., 1989
Theor. Comput. Sci., 1989
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989
1988
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups.
J. Symb. Comput., 1988
RAIRO Theor. Informatics Appl., 1988
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule.
Inf. Process. Lett., 1988
Discret. Math., 1988
Acta Informatica, 1988
1987
Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations.
Math. Syst. Theory, 1987
On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class.
J. Comput. Syst. Sci., 1987
Inf. Process. Lett., 1987
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987
It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free.
Proceedings of the Applied Algebra, 1987
1986
Theor. Comput. Sci., 1986
Theor. Comput. Sci., 1986
1985
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups.
J. Symb. Comput., 1985
Discret. Appl. Math., 1985
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985
Proceedings of the Advances in Cryptology, 1985
1984
Theor. Comput. Sci., 1984
Theor. Comput. Sci., 1984
Inf. Control., 1984
Acta Informatica, 1984