Friedrich Otto

According to our database1, Friedrich Otto
  • authored at least 207 papers between 1984 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Weighted restarting automata and pushdown relations.
Theor. Comput. Sci., 2016

Some classes of rational functions for pictures.
RAIRO - Theor. Inf. and Applic., 2016

Preface.
Fundam. Inform., 2016

Weighted Restarting Automata as Language Acceptors.
Proceedings of the Implementation and Application of Automata, 2016

On the Effects of Nondeterminism on Ordered Restarting Automata.
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

On Ordered RRWW-Automata.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Lambda-confluence for context rewriting systems.
Theor. Comput. Sci., 2015

Restarting Transducers, Regular Languages, and Rational Relations.
Theory Comput. Syst., 2015

Asynchronous Parallel Communicating Systems of Pushdown Automata.
Int. J. Found. Comput. Sci., 2015

Preface.
Fundam. Inform., 2015

Deterministic ordered restarting automata for picture languages.
Acta Inf., 2015

On Visibly Pushdown Trace Languages.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Reversible Ordered Restarting Automata.
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

Deterministic Ordered Restarting Automata that Compute Functions.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Weighted Restarting Automata and Pushdown Relations.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
Systems of parallel communicating restarting automata.
RAIRO - Theor. Inf. and Applic., 2014

Two-dimensional Sgraffito automata.
RAIRO - Theor. Inf. and Applic., 2014

On the classes of languages accepted by limited context restarting automata.
RAIRO - Theor. Inf. and Applic., 2014

Free Word-Order and Restarting Automata.
Fundam. Inform., 2014

Restarting Automata for Picture Languages: A Survey on Recent Developments.
Proceedings of the Implementation and Application of Automata, 2014

Ordered Restarting Automata for Picture Languages.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Extended Two-Way Ordered Restarting Automata for Picture Languages.
Proceedings of the Language and Automata Theory and Applications, 2014

On the Descriptional Complexity of Deterministic Ordered Restarting Automata.
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

On the Descriptional Complexity of the Window Size for Deleting Restarting Automata.
Int. J. Found. Comput. Sci., 2013

Globally deterministic CD-systems of stateless R-automata with window size 1.
Int. J. Comput. Math., 2013

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata.
Acta Inf., 2013

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata.
Proceedings of the Implementation and Application of Automata, 2013

Lambda-Confluence Is Undecidable for Clearing Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2013

Asynchronous PC Systems of Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2013

New Results on Deterministic Sgraffito Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
On CD-systems of stateless deterministic R-automata with window size one.
J. Comput. Syst. Sci., 2012

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011).
RAIRO - Theor. Inf. and Applic., 2012

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2012

Systems of Parallel Communicating Restarting Automata.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Limited Context Restarting Automata and McNaughton Families of Languages.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Characterizing the Rational Functions by Restarting Transducers.
Proceedings of the Language and Automata Theory and Applications, 2012

On Centralized PC Grammar Systems with Context-Sensitive Components.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata.
Proceedings of the Languages Alive, 2012

2011
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
Theor. Comput. Sci., 2011

A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata.
Theory Comput. Syst., 2011

CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store.
RAIRO - Theor. Inf. and Applic., 2011

On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems.
Fundam. Inform., 2011

Preface.
Fundam. Inform., 2011

An Automata-Theoretical Characterization of Context-Free Trace Languages.
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

Globally Deterministic CD-Systems of Stateless R(1)-Automata.
Proceedings of the Language and Automata Theory and Applications, 2011

Characterizing the Regular Languages by Nonforgetting Restarting Automata.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

On Restarting Automata with Window Size One.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
On Alternating Phrase-Structure Grammars.
Int. J. Found. Comput. Sci., 2010

On Stateless Two-Pushdown Automata and Restarting Automata.
Int. J. Found. Comput. Sci., 2010

On stateless deterministic restarting automata.
Acta Inf., 2010

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata.
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

On Lexicalized Well-Behaved Restarting Automata That Are Monotone.
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

Left-to-right regular languages and two-way restarting automata.
ITA, 2009

On Deterministic CD-Systems of Restarting Automata.
Int. J. Found. Comput. Sci., 2009

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.
Inf. Comput., 2009

On Stateless Deterministic Restarting Automata.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Parallel Communicating Grammar Systems with Regular Control.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

Single-Path Restarting Tree Automata.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
On the Complexity of 2-Monotone Restarting Automata.
Theory Comput. Syst., 2008

Church-Rosser Groups and Growing Context-Sensitive Groups.
Journal of Automata, Languages and Combinatorics, 2008

On determinism versus nondeterminism for restarting automata.
Inf. Comput., 2008

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

On Alternating Phrase-Structure Grammars.
Proceedings of the Language and Automata Theory and Applications, 2008

On Stateless Two-Pushdown Automata and Restarting Automata.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Sequential monotonicity for restarting automata.
ITA, 2007

Cooperating Distributed Systems of Restarting Automata.
Int. J. Found. Comput. Sci., 2007

Shrinking Restarting Automata.
Int. J. Found. Comput. Sci., 2007

Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata.
IEICE Transactions, 2007

A Measure for the Degree of Nondeterminism of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2007

Restarting Tree Automata.
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

Free Word-Order and Restarting Automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 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

Strictly Deterministic CD-Systems of Restarting Automata.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Restarting Tree Automata and Linear Context-Free Tree Languages.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Restarting Automata.
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

Restarting automata with restricted utilization of auxiliary symbols.
Theor. Comput. Sci., 2006

Degrees of non-monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Correctness Preservation and Complexity of Simple RL-Automata.
Proceedings of the Implementation and Application of Automata, 2006

Learning Analysis by Reduction from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

On the Gap-Complexity of Simple RL-Automata.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone.
Proceedings of the Computer Science, 2006

2005
On state-alternating context-free grammars.
Theor. Comput. Sci., 2005

Hierarchies of weakly monotone restarting automata.
ITA, 2005

The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
Inf. Comput., 2005

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Fundam. Inform., 2005

Restricting the Use of Auxiliary Symbols for Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2005

Shrinking Restarting Automata.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Shrinking Multi-pushdown Automata.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Reduction relations for monoid semirings.
J. Symb. Comput., 2004

Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.
Journal of Automata, Languages and Combinatorics, 2004

Shrinking Alternating Two-Pushdown Automata.
IEICE Transactions, 2004

On Oleshchuk's Public Key Cryptosystem.
IACR Cryptology ePrint Archive, 2004

On Left-Monotone Deterministic Restarting Automata.
Proceedings of the Developments in Language Theory, 2004

On the Complexity of 2-Monotone Restarting Automata.
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

McNaughton families of languages.
Theor. Comput. Sci., 2003

Restarting Automata and Their Relations to the Chomsky Hierarchy.
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
A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles.
J. Autom. Reasoning, 2002

Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid.
IJAC, 2002

2001
Confluent Monadic String-Rewriting Systems and Automatic Structures.
Journal of Automata, Languages and Combinatorics, 2001

On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids.
IJAC, 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
Repetitiveness of languages generated by morphisms.
Theor. Comput. Sci., 2000

On Dehn Functions of Finitely Presented Bi-Automatic Monoids.
Journal of Automata, Languages and Combinatorics, 2000

The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems.
IJAC, 2000

Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
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
On the Connections between Rewriting and Formal Language Theory.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Restarting automata, Church-Rosser languages, and representations of r.e. languages.
Proceedings of the Developments in Language Theory, 1999

On S-Regular Prefix-Rewriting Systems and Automatic Structures.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Equational Unification, Word Unification, and 2nd-Order Equational Unification.
Theor. Comput. Sci., 1998

Some Undecidability Results Concerning the Property of Preserving Regularity.
Theor. Comput. Sci., 1998

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput., 1998

Growing Context-Sensitive Languages and Church-Rosser Languages.
Inf. Comput., 1998

Automatic Monoids Versus Monoids with Finite Convergent Presentations.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.
J. Autom. Reasoning, 1997

Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet.
Fundam. Inform., 1997

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

On the Property of Preserving Regularity for String-Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.
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

FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
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
On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems.
Mathematical Systems Theory, 1995

Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General.
Inf. Process. Lett., 1995

Growing Context-Sensitive Languages and Church-Rosser Languages.
STACS, 1995

Some Independent Results for Equational Unification.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1994
A Finiteness Condition for Rewriting Systems.
Theor. Comput. Sci., 1994

Codes Modulo Finite Monadic String-Rewriting Systems.
Theor. Comput. Sci., 1994

Finite Derivation Type Implies the Homological Finiteness Condition FP_3.
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
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci., 1993

Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups.
Math. Log. Q., 1993

On the Problem of Generating Small Convergent Systems.
J. Symb. Comput., 1993

String-Rewriting Systems.
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.
Mathematical Systems Theory, 1992

One-Rule Trace-Rewriting Systems and Confluence.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Computing Presentations for Subgroups of Context-Free Groups.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

Generating Small Convergent Systems Can Be Extremely Hard.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
When is an Extension of a Specification Consistent? Decidable and Undecidable Cases.
J. Symb. Comput., 1991

Overlaps in Free Partially Commutative Monoids.
J. Comput. Syst. Sci., 1991

It is undecidable whether a finite special string-rewriting system presents a group.
Discrete Mathematics, 1991

Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class.
Acta Inf., 1991

Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty Word.
Appl. Algebra Eng. Commun. Comput., 1991

Decidable Sentences for Context-Free Groups.
Proceedings of the STACS 91, 1991

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems.
Proceedings of the Applied Algebra, 1991

1990
On Ground-Confluence of Term Rewriting Systems
Inf. Comput., May, 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

Some Results on Equational Unification.
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

Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems.
Theor. Comput. Sci., 1989

About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems.
Theor. Comput. Sci., 1989

Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems.
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

Church-Rosser Thue systems and formal languages.
J. ACM, 1988

Commutativity in Groups Presented By Finite Church-Rosser Thue Systems.
ITA, 1988

Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule.
Inf. Process. Lett., 1988

An example of a one-relator group that is not a one-relation monoid.
Discrete Mathematics, 1988

Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems.
Acta Inf., 1988

1987
Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations.
Mathematical Systems Theory, 1987

On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class.
J. Comput. Syst. Sci., 1987

Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups.
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

Some Results about Confluence on a Given Congruence Class.
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
The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems.
Theor. Comput. Sci., 1986

The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems.
Theor. Comput. Sci., 1986

Church-Rosser Thue Systems that Present Free Monoids.
SIAM J. Comput., 1986

On Deciding Whether a Monoid is a Free Monoid or is a Group.
Acta Inf., 1986

1985
Complexity Results on the Conjugacy Problem for Monoids.
Theor. Comput. Sci., 1985

On the Verifiability of Two-Party Algebraic Protocols.
Theor. Comput. Sci., 1985

On the Security of Name-Stamp Protocols.
Theor. Comput. Sci., 1985

A Note on Thue Systems with a Single Defining Relation.
Mathematical Systems Theory, 1985

Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups.
J. Symb. Comput., 1985

Cancellation Rules and Extended Word Problems.
Inf. Process. Lett., 1985

Classes of regular and context-free languages over countably infinite alphabets.
Discrete Applied Mathematics, 1985

Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

The Verifiability of Two-Party Protocols.
Proceedings of the Advances in Cryptology, 1985

1984
Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems.
Theor. Comput. Sci., 1984

Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group.
Theor. Comput. Sci., 1984

The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete
Information and Control, 1984

Finite Complete Rewriting Systems and the Complexity of the Word Problem.
Acta Inf., 1984


  Loading...