Volker Diekert

185 papers A* 10A 17B 15C 13Misc 5Journal 105Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
Quadratic Equations in Graph Products of Groups and the Exponent of Periodicity.
Groups Complex. Cryptol.
Volker Diekert, Silas Natterer, Alexander Thumm
2025 J jnl
Word equations and the exponent of periodicity.
CoRR
Volker Diekert, Silas Natterer, Alexander Thumm
2024 J jnl
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices.
SIAM J. Comput.
Volker Diekert, Igor Potapov, Pavel Semukhin
2024 J jnl
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022.
Theory Comput. Syst.
Volker Diekert, Mikhail Volkov
2022 C ed.
Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings
DLT
Volker Diekert, Mikhail V. Volkov
2022 J jnl
Properties of graphs specified by a regular language.
Acta Informatica
Volker Diekert, Henning Fernau, Petra Wolf
2022 C conf
Reachability Games and Parity Games.
ICTAC
Volker Diekert, Manfred Kufleitner
2022 J jnl
Reachability Games and Parity Games.
CoRR
Volker Diekert, Manfred Kufleitner
2022 J jnl
Regular matching problems for infinite trees.
Log. Methods Comput. Sci.
Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues
2021 C conf
Properties of Graphs Specified by a Regular Language.
DLT
Volker Diekert, Henning Fernau, Petra Wolf
2021 J jnl
Properties of Graphs Specified by a Regular Language.
CoRR
Volker Diekert, Henning Fernau, Petra Wolf
2020 B conf
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices.
ISSAC
Volker Diekert, Igor Potapov, Pavel Semukhin
2020 J jnl
Regular matching problems for infinite trees.
CoRR
Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues
2020 J jnl
Solutions to twisted word equations and equations in virtually free groups.
Int. J. Algebra Comput.
Volker Diekert, Murray Elder
2019 J jnl
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131).
Dagstuhl Reports
Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov
2019 J jnl
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices.
CoRR
Volker Diekert, Igor Potapov, Pavel Semukhin
2017 J jnl
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
J. Symb. Comput.
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2017 J jnl
Characterizing classes of regular languages using prefix codes of bounded synchronization delay.
Int. J. Algebra Comput.
Volker Diekert, Tobias Walter
2017 — conf
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.
WORDS
Volker Diekert, Lukas Fleischer
2017 J jnl
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.
CoRR
Volker Diekert, Lukas Fleischer
2017 J jnl
Equations Over Free Inverse Monoids with Idempotent Variables.
Theory Comput. Syst.
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
2017 A* conf
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups.
ICALP
Volker Diekert, Murray Elder
2017 J jnl
Solutions of twisted word equations, EDT0L languages, and context-free groups.
CoRR
Volker Diekert, Murray Elder
2016 J jnl
A survey on the local divisor technique.
Theor. Comput. Sci.
Volker Diekert, Manfred Kufleitner
2016 A* conf
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay.
ICALP
Volker Diekert, Tobias Walter
2016 J jnl
Characterizing classes of regular languages using prefix codes of bounded synchronization delay.
CoRR
Volker Diekert, Tobias Walter
2016 J jnl
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits.
Algorithmica
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2016 — book
Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups.
Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf
2016 J jnl
Finding all solutions of equations in free groups and monoids with involution.
Inf. Comput.
Volker Diekert, Artur Jez, Wojciech Plandowski
2016 J jnl
Logspace computations in graph products.
J. Symb. Comput.
Volker Diekert, Jonathan Kausch
2016 J jnl
QuickHeapsort: Modifications and Improved Analysis.
Theory Comput. Syst.
Volker Diekert, Armin Weiß
2016 J jnl
Solution sets for equations over free groups are EDT0L languages.
Int. J. Algebra Comput.
Laura Ciobanu, Volker Diekert, Murray Elder
2016 A* conf
Solutions of Word Equations Over Partially Commutative Structures.
ICALP
Volker Diekert, Artur Jez, Manfred Kufleitner
2016 J jnl
Solutions of Word Equations over Partially Commutative Structures.
CoRR
Volker Diekert, Artur Jez, Manfred Kufleitner
2015 C conf
A Note on Monitors and Büchi Automata.
ICTAC
Volker Diekert, Anca Muscholl, Igor Walukiewicz
2015 J jnl
A Note on Monitors and Büchi automata.
CoRR
Volker Diekert, Anca Muscholl, Igor Walukiewicz
2015 B conf
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem.
ISSAC
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2015 J jnl
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
CoRR
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2015 J jnl
Asymptotic Approximation for the Quotient Complexities of Atoms.
Acta Cybern.
Volker Diekert, Tobias Walter
2015 Misc conf
Equations over Free Inverse Monoids with Idempotent Variables.
CSR
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
2015 — conf
More Than 1700 Years of Word Equations.
CAI
Volker Diekert
2015 J jnl
More Than 1700 Years of Word Equations.
CoRR
Volker Diekert
2015 J jnl
Omega-Rational Expressions with Bounded Synchronization Delay.
Theory Comput. Syst.
Volker Diekert, Manfred Kufleitner
2015 J jnl
Regular Languages Are Church-Rosser Congruential.
J. ACM
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
2015 J jnl
SLP compression for solutions of equations with constraints in free and hyperbolic groups.
Int. J. Algebra Comput.
Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam
2015 — conf
Solution Sets for Equations over Free Groups are EDT0L Languages.
ICALP (2)
Laura Ciobanu, Volker Diekert, Murray Elder
2015 J jnl
Solution sets for equations over free groups are EDT0L languages.
CoRR
Laura Ciobanu, Volker Diekert, Murray Elder
2015 J jnl
Solution sets for equations over free groups are EDT0L languages.
CoRR
Laura Ciobanu, Volker Diekert, Murray Elder
2014 J jnl
A Survey on the Local Divisor Technique.
CoRR
Volker Diekert, Manfred Kufleitner
2014 B conf
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits.
LATIN
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2014 J jnl
Equations over free inverse monoids with idempotent variables.
CoRR
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
2014 Misc conf
Finding All Solutions of Equations in Free Groups and Monoids with Involution.
CSR
Volker Diekert, Artur Jez, Wojciech Plandowski
2014 J jnl
Finding All Solutions of Equations in Free Groups and Monoids with Involution.
CoRR
Volker Diekert, Artur Jez, Wojciech Plandowski
2014 B conf
Logspace computations in graph products.
ISSAC
Volker Diekert, Jonathan Kausch
2014 J jnl
Topology, monitorable properties and runtime verification.
Theor. Comput. Sci.
Volker Diekert, Martin Leucker
2013 J jnl
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits.
CoRR
Volker Diekert, Alexei Miasnikov, Armin Weiß
2013 J jnl
Context-Free Groups and their Structure Trees.
Int. J. Algebra Comput.
Volker Diekert, Armin Weiß
2013 — book
Diskrete algebraische Methoden - Arithmetik, Kryptographie, Automaten und Gruppen.
Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger
2013 — book
Elemente der diskreten Mathematik - Zahlen und Zählen, Graphen und Verbände.
Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger
2013 J jnl
Logspace computations in graph products.
CoRR
Volker Diekert, Jonathan Kausch
2013 Misc conf
QuickHeapsort: Modifications and Improved Analysis.
CSR
Volker Diekert, Armin Weiß
2013 J jnl
SLP compression for solutions of equations with constraints in free and hyperbolic groups.
CoRR
Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam
2012 Misc conf
Bounded Synchronization Delay in Omega-Rational Expressions.
CSR
Volker Diekert, Manfred Kufleitner
2012 J jnl
Cyclic rewriting and conjugacy problems.
Groups Complex. Cryptol.
Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov
2012 J jnl
Deciding regularity of hairpin completions of regular languages in polynomial time.
Inf. Comput.
Volker Diekert, Steffen Kopecki, Victor Mitrana
2012 J jnl
Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P.
Int. J. Algebra Comput.
Volker Diekert, Jürn Laun, Alexander Ushakov
2012 A conf
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P.
STACS
Volker Diekert, Jürn Laun, Alexander Ushakov
2012 J jnl
Group Extensions over Infinite Words.
Int. J. Found. Comput. Sci.
Volker Diekert, Alexei G. Myasnikov
2012 J jnl
Language theoretical properties of hairpin formations.
Theor. Comput. Sci.
Volker Diekert, Steffen Kopecki
2012 B conf
Logspace Computations in Graph Groups and Coxeter Groups.
LATIN
Volker Diekert, Jonathan Kausch, Markus Lohrey
2012 C conf
On Distributed Monitoring of Asynchronous Systems.
WoLLIC
Volker Diekert, Anca Muscholl
2012 J jnl
On distributed monitoring of asynchronous systems
CoRR
Volker Diekert, Anca Muscholl
2012 J jnl
QuickHeapsort: Modifications and improved analysis
CoRR
Volker Diekert, Armin Weiß
2012 — conf
Regular Languages Are Church-Rosser Congruential.
ICALP (2)
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
2012 J jnl
Regular Languages are Church-Rosser Congruential
CoRR
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
2012 J jnl
Star-free languages are Church-Rosser congruential.
Theor. Comput. Sci.
Volker Diekert, Manfred Kufleitner, Pascal Weil
2012 J jnl
The Krohn-Rhodes Theorem and Local Divisors.
Fundam. Informaticae
Volker Diekert, Manfred Kufleitner, Benjamin Steinberg
2011 J jnl
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
CoRR
Volker Diekert, Steffen Kopecki, Victor Mitrana
2011 J jnl
Fragments of First-Order Logic over Infinite Words.
Theory Comput. Syst.
Volker Diekert, Manfred Kufleitner
2011 J jnl
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular
CoRR
Volker Diekert, Steffen Kopecki
2011 J jnl
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular.
Int. J. Found. Comput. Sci.
Volker Diekert, Steffen Kopecki
2011 — ch.
Marriage Broker.
Algorithms Unplugged
Volker Claus, Volker Diekert, Holger Petersen
2011 J jnl
On Computing Geodesics in Baumslag-Solitar Groups.
Int. J. Algebra Comput.
Volker Diekert, Jürn Laun
2011 J jnl
Preface.
Int. J. Found. Comput. Sci.
Volker Diekert, Dirk Nowotka
2011 C conf
Solving Word Problems in Group Extensions over Infinite Words.
Developments in Language Theory
Volker Diekert, Alexei G. Myasnikov
2011 J jnl
Star-Free Languages are Church-Rosser Congruential
CoRR
Volker Diekert, Manfred Kufleitner, Pascal Weil
2011 J jnl
The Krohn-Rhodes Theorem and Local Divisors
CoRR
Volker Diekert, Manfred Kufleitner, Benjamin Steinberg
2011 — ch.
Trace Theory.
Encyclopedia of Parallel Computing
Volker Diekert, Anca Muscholl
2010 C conf
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract).
CIAA
Volker Diekert, Steffen Kopecki
2010 J jnl
Group extensions over infinite words
CoRR
Volker Diekert, Alexei G. Myasnikov
2010 J jnl
Preface.
Theory Comput. Syst.
Sergei N. Artëmov, Volker Diekert, Dima Grigoriev
2010 J jnl
Preface.
Theory Comput. Syst.
Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov
2009 C ed.
Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings
Developments in Language Theory
Volker Diekert, Dirk Nowotka
2009 A conf
Fragments of First-Order Logic over Infinite Words.
STACS
Volker Diekert, Manfred Kufleitner
2009 J jnl
Fragments of first-order logic over infinite words
CoRR
Volker Diekert, Manfred Kufleitner
2009 C conf
On the Hairpin Completion of Regular Languages.
ICTAC
Volker Diekert, Steffen Kopecki, Victor Mitrana
2009 J jnl
Some remarks about stabilizers.
Theor. Comput. Sci.
Volker Diekert, Dalia Krieger
2008 J jnl
A Survey on Small Fragments of First-Order Logic over Finite Words.
Int. J. Found. Comput. Sci.
Volker Diekert, Paul Gastin, Manfred Kufleitner
2008 J jnl
Algorithmic Problems on Inverse Monoids over Virtually Free Groups.
Int. J. Algebra Comput.
Volker Diekert, Nicole Ondrusch, Markus Lohrey
2008 — conf
First-order definable languages.
Logic and Automata
Volker Diekert, Paul Gastin
2008 J jnl
Foreword.
Theory Comput. Syst.
Sergei N. Artëmov, Volker Diekert, Dima Grigoriev
2008 — ch.
Partnerschaftsvermittlung.
Taschenbuch der Algorithmen
Volker Claus, Volker Diekert, Holger Petersen
2008 J jnl
Word Equations over Graph Products.
Int. J. Algebra Comput.
Volker Diekert, Markus Lohrey
2007 Misc ed.
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings
CSR
Volker Diekert, Mikhail V. Volkov, Andrei Voronkov
2007 C conf
Equations: From Words to Graph Products.
LATA
Volker Diekert
2007 J jnl
Foreword.
Theory Comput. Syst.
Volker Diekert, Bruno Durand
2007 J jnl
On First-Order Fragments for Mazurkiewicz Traces.
Fundam. Informaticae
Volker Diekert, Martin Horsch, Manfred Kufleitner
2007 C conf
On First-Order Fragments for Words and Mazurkiewicz Traces.
Developments in Language Theory
Volker Diekert, Manfred Kufleitner
2006 J jnl
Foreword.
Theory Comput. Syst.
Volker Diekert, Michel Habib
2006 J jnl
From local to global temporal logics over Mazurkiewicz traces.
Theor. Comput. Sci.
Volker Diekert, Paul Gastin
2006 B conf
Partially Commutative Inverse Monoids.
MFCS
Volker Diekert, Markus Lohrey, Alexander Miller
2006 J jnl
Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
Inf. Comput.
Volker Diekert, Paul Gastin
2006 J jnl
Solvability of Equations in Graph Groups Is Decidable.
Int. J. Algebra Comput.
Volker Diekert, Anca Muscholl
2005 J jnl
Regular frequency computations.
Theor. Comput. Sci.
Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen
2005 A ed.
STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings
STACS
Volker Diekert, Bruno Durand
2005 J jnl
The existential theory of equations with rational constraints in free groups is PSPACE-complete.
Inf. Comput.
Volker Diekert, Claudio Gutierrez, Christian Hagenah
2004 J jnl
Existential and Positive Theories of Equations in Graph Products.
Theory Comput. Syst.
Volker Diekert, Markus Lohrey
2004 J jnl
Local temporal logic is expressively complete for cograph dependence alphabets.
Inf. Comput.
Volker Diekert, Paul Gastin
2004 B conf
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
LATIN
Volker Diekert, Paul Gastin
2004 A ed.
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings
STACS
Volker Diekert, Michel Habib
2003 J jnl
A structural property of regular frequency computations.
Theor. Comput. Sci.
Holger Austinat, Volker Diekert, Ulrich Hertrampf
2003 — conf
Word Equations over Graph Products.
FSTTCS
Volker Diekert, Markus Lohrey
2002 J jnl
A Note on The Existential Theory of Equations in Plain Groups.
Int. J. Algebra Comput.
Volker Diekert, Markus Lohrey
2002 C conf
A Remark about Quadratic Trace Equations.
Developments in Language Theory
Volker Diekert, Manfred Kufleitner
2002 A conf
Existential and Positive Theories of Equations in Graph Products.
STACS
Volker Diekert, Markus Lohrey
2002 J jnl
LTL Is Expressively Complete for Mazurkiewicz Traces.
J. Comput. Syst. Sci.
Volker Diekert, Paul Gastin
2002 — conf
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.
Formal and Natural Computing
Volker Diekert, Paul Gastin
2001 B conf
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
LPAR
Volker Diekert, Paul Gastin
2001 A* conf
Solvability of Equations in Free Partially Commutative Groups Is Decidable.
ICALP
Volker Diekert, Anca Muscholl
2001 J jnl
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
CoRR
Volker Diekert, Claudio Gutierrez, Christian Hagenah
2001 A conf
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete.
STACS
Volker Diekert, Claudio Gutierrez, Christian Hagenah
2000 A* conf
LTL Is Expressively Complete for Mazurkiewicz Traces.
ICALP
Volker Diekert, Paul Gastin
1999 B conf
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
CSL
Volker Diekert, Paul Gastin
1999 A conf
On Quadratic Word Equations.
STACS
John Michael Robson, Volker Diekert
1999 — conf
Quadratic Word Equations.
Jewels are Forever
Volker Diekert, John Michael Robson
1999 J jnl
Solving Word Equations modulo Partial Commutations.
Theor. Comput. Sci.
Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl
1998 J jnl
Approximating Traces.
Acta Informatica
Volker Diekert, Paul Gastin
1998 J jnl
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Informaticae
Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
1997 — conf
A Remark on Trace Equations.
Foundations of Computer Science: Potential - Theory - Cognition
Volker Diekert
1997 — ch.
Partial Commutation and Traces.
Handbook of Formal Languages (3)
Volker Diekert, Yves Métivier
1997 A conf
Removing epsilon-Transitions in Timed Automata.
STACS
Volker Diekert, Paul Gastin, Antoine Petit
1997 A* conf
Solving Trace Equations Using Lexicographical Normal Forms.
ICALP
Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl
1996 J jnl
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.
Fundam. Informaticae
Volker Diekert, Anca Muscholl
1996 B conf
Code Problems on Traces.
MFCS
Volker Diekert, Anca Muscholl
1996 A conf
Trace Rewriting: Computing Normal Forms in Time O(n log n).
STACS
Michael Bertol, Volker Diekert
1995 A* conf
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
ICALP
Volker Diekert, Paul Gastin
1995 — ch.
Construction of Asynchronous Automata.
The Book of Traces
Volker Diekert, Anca Muscholl
1995 A conf
On Codings of Traces.
STACS
Volker Diekert, Anca Muscholl, Klaus Reinhardt
1995 J jnl
On Confluence of One-Rule Trace-Rewriting Systems.
Math. Syst. Theory
Celia Wrathall, Volker Diekert
1995 J jnl
Rational and Recognizable Complex Trace Languages
Inf. Comput.
Volker Diekert, Paul Gastin, Antoine Petit
1995 C conf
Recent Developments in Trace Theory.
Developments in Language Theory
Volker Diekert, Paul Gastin, Antoine Petit
1995 — book
The Book of Traces
Volker Diekert, Grzegorz Rozenberg
1994 J jnl
A Partial Trace Semantics for Petri Nets.
Theor. Comput. Sci.
Volker Diekert
1994 J jnl
Deterministic Asynchronous Automata for Infinite Traces.
Acta Informatica
Volker Diekert, Anca Muscholl
1994 J jnl
On Confluent Semi-commutations: Decidability and Complexity Results
Inf. Comput.
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1993 B conf
Complex and Complex-Like Traces.
MFCS
Volker Diekert
1993 A conf
Deterministic Asynchronous Automata for Infinite Traces.
STACS
Volker Diekert, Anca Muscholl
1993 J jnl
Möbius Functions and Confluent Semi-Commutations.
Theor. Comput. Sci.
Volker Diekert
1993 — conf
On Efficient Reduction Algorithms for Some Trace Rewriting Systems.
Term Rewriting
Michael Bertol, Volker Diekert
1993 J jnl
On the Concentration of Infinite Traces.
Theor. Comput. Sci.
Volker Diekert
1993 B conf
Rewriting, Möbius Functions and Semi-Commutations.
FCT
Volker Diekert
1992 B conf
One-Rule Trace-Rewriting Systems and Confluence.
MFCS
Celia Wrathall, Volker Diekert, Friedrich Otto
1991 J jnl
On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores.
Inf. Process. Lett.
Volker Diekert, Ronald V. Book
1991 A* conf
On Confluent Semi-Commutations - Decidability and Complexity Results.
ICALP
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1991 A conf
On the Concatenation of Infinite Traces.
STACS
Volker Diekert
1991 B conf
Recognizable Complex Trace Languages.
MFCS
Volker Diekert, Paul Gastin, Antoine Petit
1990 A conf
Combinatorial Rewriting on Traces.
STACS
Volker Diekert
1990 — book
Combinatorics on Traces
Volker Diekert
1990 J jnl
On confluent semi-commutations: decidability and complexity results
Forschungsberichte, TU Munich
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1990 J jnl
Two contributions to the theory of Marzukiewicz traces
Forschungsberichte, TU Munich
Volker Diekert
1990 J jnl
Word Problems Over Traces which are Solvable in Linear Time.
Theor. Comput. Sci.
Volker Diekert
1989 J jnl
Hotz-Isomorphism Theorems In Formal Language Theory.
RAIRO Theor. Informatics Appl.
Volker Diekert, Axel Möbus
1989 J jnl
On the Knuth-Bendix Completion for Concurrent Processes.
Theor. Comput. Sci.
Volker Diekert
1989 J jnl
On the Synchronization of Traces.
Math. Syst. Theory
Volker Diekert, Walter Vogler
1989 A conf
Word Problems over TRaces Which are Solvable in Linear Time.
STACS
Volker Diekert
1988 A conf
Hotz-Isomorphism Theorems in Formal Language Theory.
STACS
Volker Diekert, Axel Möbus
1988 B conf
Local Checking of Trace Synchroniziability.
MFCS
Volker Diekert, Walter Vogler
1988 A* conf
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids.
ICALP
Volker Diekert
1987 A* conf
On the Knuth-Bendix Completion for Concurrent Processes.
ICALP
Volker Diekert
1987 A conf
Some Remarks on Presentations by Finite Church-Rosser Thue Systems.
STACS
Volker Diekert
1986 J jnl
Commutative monoids have complete presentations by free (non-commutative) monoids.
Theor. Comput. Sci.
Volker Diekert
1986 J jnl
Complete Semi-Thue Systems for Abelian Groups.
Theor. Comput. Sci.
Volker Diekert
1986 J jnl
Investigations on Hotz Groups for Arbitrary Grammars.
Acta Informatica
Volker Diekert
1986 J jnl
On some variants of the Ehrenfeucht conjecture.
Theor. Comput. Sci.
Volker Diekert
1985 A conf
On Hotz Groups and Homomorphic Images of Sentential Form Languages.
STACS
Volker Diekert