 | 2009 |
|---|
| 84 |       | Volker Diekert,
Dirk Nowotka:
Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings
Springer 2009 |
| 83 | | Volker Diekert,
Steffen Kopecki,
Victor Mitrana:
On the Hairpin Completion of Regular Languages.
ICTAC 2009: 170-184 |
| 82 | | Volker Diekert,
Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words.
STACS 2009: 325-336 |
| 81 | | Volker Diekert,
Manfred Kufleitner:
Fragments of first-order logic over infinite words
CoRR abs/0906.2995: (2009) |
| 80 | | Volker Diekert,
Dalia Krieger:
Some remarks about stabilizers.
Theor. Comput. Sci. 410(30-32): 2935-2946 (2009) |
| 2008 |
|---|
| 79 | | Volker Claus,
Volker Diekert,
Holger Petersen:
Partnerschaftsvermittlung.
Taschenbuch der Algorithmen 2008: 373-383 |
| 78 | | Volker Diekert,
Nicole Ondrusch,
Markus Lohrey:
Algorithmic Problems on Inverse Monoids over Virtually Free Groups.
IJAC 18(1): 181-208 (2008) |
| 77 | | Volker Diekert,
Markus Lohrey:
Word Equations over Graph Products.
IJAC 18(3): 493-533 (2008) |
| 76 | | Volker Diekert,
Paul Gastin,
Manfred Kufleitner:
A Survey on Small Fragments of First-Order Logic over Finite Words.
Int. J. Found. Comput. Sci. 19(3): 513-548 (2008) |
| 75 | | Sergei N. Artëmov,
Volker Diekert,
Dima Grigoriev:
Foreword.
Theory Comput. Syst. 43(2): 99 (2008) |
| 2007 |
|---|
| 74 |  | Volker Diekert,
Mikhail V. Volkov,
Andrei Voronkov:
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings
Springer 2007 |
| 73 | | Volker Diekert,
Manfred Kufleitner:
On First-Order Fragments for Words and Mazurkiewicz Traces.
Developments in Language Theory 2007: 1-19 |
| 72 | | Volker Diekert,
Martin Horsch,
Manfred Kufleitner:
On First-Order Fragments for Mazurkiewicz Traces.
Fundam. Inform. 80(1-3): 1-29 (2007) |
| 71 | | Volker Diekert,
Bruno Durand:
Foreword.
Theory Comput. Syst. 40(4): 301 (2007) |
| 2006 |
|---|
| 70 | | Volker Diekert,
Markus Lohrey,
Alexander Miller:
Partially Commutative Inverse Monoids.
MFCS 2006: 292-304 |
| 69 | | Volker Diekert,
Anca Muscholl:
Solvability of Equations in Graph Groups Is Decidable.
IJAC 16(6): 1047-1070 (2006) |
| 68 | | Volker Diekert,
Paul Gastin:
Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
Inf. Comput. 204(11): 1597-1619 (2006) |
| 67 | | Volker Diekert,
Paul Gastin:
From local to global temporal logics over Mazurkiewicz traces.
Theor. Comput. Sci. 356(1-2): 126-135 (2006) |
| 66 | | Volker Diekert,
Michel Habib:
Foreword.
Theory Comput. Syst. 39(1): 1 (2006) |
| 2005 |
|---|
| 65 | | Volker Diekert,
Bruno Durand:
STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings
Springer 2005 |
| 64 | | Volker Diekert,
Claudio Gutiérrez,
Christian Hagenah:
The existential theory of equations with rational constraints in free groups is PSPACE-complete.
Inf. Comput. 202(2): 105-140 (2005) |
| 63 | | Holger Austinat,
Volker Diekert,
Ulrich Hertrampf,
Holger Petersen:
Regular frequency computations.
Theor. Comput. Sci. 330(1): 15-21 (2005) |
| 2004 |
|---|
| 62 | | Volker Diekert,
Michel Habib:
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings
Springer 2004 |
| 61 | | Volker Diekert,
Paul Gastin:
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
LATIN 2004: 232-241 |
| 60 | | Volker Diekert,
Paul Gastin:
Local temporal logic is expressively complete for cograph dependence alphabets.
Inf. Comput. 195(1-2): 30-52 (2004) |
| 59 | | Volker Diekert,
Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products.
Theory Comput. Syst. 37(1): 133-156 (2004) |
| 2003 |
|---|
| 58 | | Volker Diekert,
Markus Lohrey:
Word Equations over Graph Products.
FSTTCS 2003: 156-167 |
| 57 | | Holger Austinat,
Volker Diekert,
Ulrich Hertrampf:
A structural property of regular frequency computations.
Theor. Comput. Sci. 292(1): 33-43 (2003) |
| 2002 |
|---|
| 56 | | Volker Diekert,
Manfred Kufleitner:
A Remark about Quadratic Trace Equations.
Developments in Language Theory 2002: 59-66 |
| 55 | | Volker Diekert,
Paul Gastin:
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.
Formal and Natural Computing 2002: 26-38 |
| 54 | | Volker Diekert,
Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products.
STACS 2002: 501-512 |
| 53 | | Volker Diekert,
Markus Lohrey:
A Note on The Existential Theory of Equations in Plain Groups.
IJAC 12(1-2): 1-7 (2002) |
| 52 | | Volker Diekert,
Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces.
J. Comput. Syst. Sci. 64(2): 396-418 (2002) |
| 2001 |
|---|
| 51 | | Volker Diekert,
Anca Muscholl:
Solvability of Equations in Free Partially Commutative Groups Is Decidable.
ICALP 2001: 543-554 |
| 50 | | Volker Diekert,
Paul Gastin:
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
LPAR 2001: 55-69 |
| 49 | | Volker Diekert,
Claudio Gutiérrez,
Christian Hagenah:
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete.
STACS 2001: 170-182 |
| 48 | | Volker Diekert,
Claudio Gutiérrez,
Christian Hagenah:
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
CoRR cs.DS/0103018: (2001) |
| 2000 |
|---|
| 47 | | Volker Diekert,
Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces.
ICALP 2000: 211-222 |
| 1999 |
|---|
| 46 | | Volker Diekert,
Paul Gastin:
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
CSL 1999: 188-203 |
| 45 | | Volker Diekert,
John Michael Robson:
Quadratic Word Equations.
Jewels are Forever 1999: 314-326 |
| 44 | | John Michael Robson,
Volker Diekert:
On Quadratic Word Equations.
STACS 1999: 217-226 |
| 43 | | Volker Diekert,
Yuri Matiyasevich,
Anca Muscholl:
Solving Word Equations modulo Partial Commutations.
Theor. Comput. Sci. 224(1-2): 215-235 (1999) |
| 1998 |
|---|
| 42 | | Volker Diekert,
Paul Gastin:
Approximating Traces.
Acta Inf. 35(7): 567-593 (1998) |
| 41 | | Béatrice Bérard,
Antoine Petit,
Volker Diekert,
Paul Gastin:
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform. 36(2-3): 145-182 (1998) |
| 1997 |
|---|
| 40 | | Volker Diekert:
A Remark on Trace Equations.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 251-260 |
| 39 | | Volker Diekert,
Yuri Matiyasevich,
Anca Muscholl:
Solving Trace Equations Using Lexicographical Normal Forms.
ICALP 1997: 336-346 |
| 38 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Removing epsilon-Transitions in Timed Automata.
STACS 1997: 583-594 |
| 1996 |
|---|
| 37 | | Volker Diekert,
Anca Muscholl:
Code Problems on Traces.
MFCS 1996: 2-17 |
| 36 | | Michael Bertol,
Volker Diekert:
Trace Rewriting: Computing Normal Forms in Time O(n log n).
STACS 1996: 269-280 |
| 35 | | Volker Diekert,
Anca Muscholl:
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.
Fundam. Inform. 25(3): 241-246 (1996) |
| 1995 |
|---|
| 34 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Recent Developments in Trace Theory.
Developments in Language Theory 1995: 373-385 |
| 33 | | Volker Diekert,
Paul Gastin:
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
ICALP 1995: 15-26 |
| 32 | | Volker Diekert,
Anca Muscholl,
Klaus Reinhardt:
On Codings of Traces.
STACS 1995: 385-396 |
| 31 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Rational and Recognizable Complex Trace Languages
Inf. Comput. 116(1): 134-153 (1995) |
| 30 | | Celia Wrathall,
Volker Diekert:
On Confluence of One-Rule Trace-Rewriting Systems.
Mathematical Systems Theory 28(4): 341-361 (1995) |
| 1994 |
|---|
| 29 | | Volker Diekert,
Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces.
Acta Inf. 31(4): 379-397 (1994) |
| 28 | | Volker Diekert,
Edward Ochmanski,
Klaus Reinhardt:
On Confluent Semi-commutations: Decidability and Complexity Results
Inf. Comput. 110(1): 164-182 (1994) |
| 27 | | Volker Diekert:
A Partial Trace Semantics for Petri Nets.
Theor. Comput. Sci. 134(1): 87-105 (1994) |
| 1993 |
|---|
| 26 | | Volker Diekert:
Rewriting, Möbius Functions and Semi-Commutations.
FCT 1993: 1-15 |
| 25 | | Volker Diekert:
Complex and Complex-Like Traces.
MFCS 1993: 68-82 |
| 24 | | Volker Diekert,
Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces.
STACS 1993: 617-628 |
| 23 | | Michael Bertol,
Volker Diekert:
On Efficient Reduction Algorithms for Some Trace Rewriting Systems.
Term Rewriting 1993: 114-126 |
| 22 | | Volker Diekert:
Möbius Functions and Confluent Semi-Commutations.
Theor. Comput. Sci. 108(1): 25-43 (1993) |
| 21 | | Volker Diekert:
On the Concentration of Infinite Traces.
Theor. Comput. Sci. 113(1): 35-54 (1993) |
| 1992 |
|---|
| 20 | | Celia Wrathall,
Volker Diekert,
Friedrich Otto:
One-Rule Trace-Rewriting Systems and Confluence.
MFCS 1992: 511-521 |
| 1991 |
|---|
| 19 | | Volker Diekert,
Edward Ochmanski,
Klaus Reinhardt:
On Confluent Semi-Commutations - Decidability and Complexity Results.
ICALP 1991: 229-241 |
| 18 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Recognizable Complex Trace Languages.
MFCS 1991: 131-140 |
| 17 | | Volker Diekert:
On the Concatenation of Infinite Traces.
STACS 1991: 105-117 |
| 16 | | Volker Diekert,
Ronald V. Book:
On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores.
Inf. Process. Lett. 40(1): 21-23 (1991) |
| 1990 |
|---|
| 15 | | Volker Diekert:
Combinatorics on Traces
Springer 1990 |
| 14 | | Volker Diekert:
Combinatorial Rewriting on Traces.
STACS 1990: 138-151 |
| 13 | | Volker Diekert:
Word Problems Over Traces which are Solvable in Linear Time.
Theor. Comput. Sci. 74(1): 3-18 (1990) |
| 1989 |
|---|
| 12 | | Volker Diekert:
Word Problems over TRaces Which are Solvable in Linear Time.
STACS 1989: 168-180 |
| 11 | | Volker Diekert,
Axel Möbus:
Hotz-Isomorphism Theorems In Formal Language Theory.
ITA 23(1): 29-43 (1989) |
| 10 | | Volker Diekert,
Walter Vogler:
On the Synchronization of Traces.
Mathematical Systems Theory 22(3): 161-175 (1989) |
| 9 | | Volker Diekert:
On the Knuth-Bendix Completion for Concurrent Processes.
Theor. Comput. Sci. 66(2): 117-136 (1989) |
| 1988 |
|---|
| 8 | | Volker Diekert:
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids.
ICALP 1988: 176-187 |
| 7 | | Volker Diekert,
Walter Vogler:
Local Checking of Trace Synchroniziability.
MFCS 1988: 271-279 |
| 6 | | Volker Diekert,
Axel Möbus:
Hotz-Isomorphism Theorems in Formal Language Theory.
STACS 1988: 126-135 |
| 1987 |
|---|
| 5 | | Volker Diekert:
On the Knuth-Bendix Completion for Concurrent Processes.
ICALP 1987: 42-53 |
| 4 | | Volker Diekert:
Some Remarks on Presentations by Finite Church-Rosser Thue Systems.
STACS 1987: 272-285 |
| 1986 |
|---|
| 3 | | Volker Diekert:
Investigations on Hotz Groups for Arbitrary Grammars.
Acta Inf. 22(6): 679-698 (1986) |
| 2 | | Volker Diekert:
Complete Semi-Thue Systems for Abelian Groups.
Theor. Comput. Sci. 44: 199-208 (1986) |
| 1985 |
|---|
| 1 | | Volker Diekert:
On Hotz Groups and Homomorphic Images of Sentential Form Languages.
STACS 1985: 87-97 |
