default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVolker Diekert
Person information
- affiliation: University of Stuttgart, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Volker Diekert
, Mikhail Volkov:
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022. Theory Comput. Syst. 68(3): 299-300 (2024)- 2022
- [j69]Volker Diekert, Henning Fernau, Petra Wolf:
Properties of graphs specified by a regular language. Acta Informatica 59(4): 357-385 (2022) - [j68]Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues:
Regular matching problems for infinite trees. Log. Methods Comput. Sci. 18(1) (2022) - [c65]Volker Diekert, Manfred Kufleitner:
Reachability Games and Parity Games. ICTAC 2022: 14-35 - [e6]Volker Diekert, Mikhail V. Volkov:
Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings. Lecture Notes in Computer Science 13257, Springer 2022, ISBN 978-3-031-05577-5 [contents] - [i32]Volker Diekert, Manfred Kufleitner:
Reachability Games and Parity Games. CoRR abs/2208.10121 (2022) - 2021
- [c64]Volker Diekert, Henning Fernau, Petra Wolf:
Properties of Graphs Specified by a Regular Language. DLT 2021: 117-129 - [i31]Volker Diekert, Henning Fernau, Petra Wolf:
Properties of Graphs Specified by a Regular Language. CoRR abs/2105.00436 (2021) - 2020
- [j67]Volker Diekert, Murray Elder:
Solutions to twisted word equations and equations in virtually free groups. Int. J. Algebra Comput. 30(04): 731-819 (2020) - [c63]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. ISSAC 2020: 122-129 - [i30]Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues:
Regular matching problems for infinite trees. CoRR abs/2004.09926 (2020)
2010 – 2019
- 2019
- [i29]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. CoRR abs/1910.02302 (2019) - [i28]Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov:
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). Dagstuhl Reports 9(3): 83-110 (2019) - 2017
- [j66]Volker Diekert, Tobias Walter:
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. Int. J. Algebra Comput. 27(6): 561-589 (2017) - [j65]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. J. Symb. Comput. 83: 147-165 (2017) - [j64]Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva:
Equations Over Free Inverse Monoids with Idempotent Variables. Theory Comput. Syst. 61(2): 494-520 (2017) - [c62]Volker Diekert, Lukas Fleischer:
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. WORDS 2017: 6-16 - [c61]Volker Diekert, Murray Elder:
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups. ICALP 2017: 96:1-96:14 - [i27]Volker Diekert, Murray Elder:
Solutions of twisted word equations, EDT0L languages, and context-free groups. CoRR abs/1701.03297 (2017) - [i26]Volker Diekert, Lukas Fleischer:
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. CoRR abs/1707.00101 (2017) - 2016
- [b4]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf:
Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups. de Gruyter 2016, ISBN 978-3-11-041332-8, pp. I-XII, 1-342 - [j63]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. Algorithmica 76(4): 961-988 (2016) - [j62]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251: 263-286 (2016) - [j61]Laura Ciobanu, Volker Diekert, Murray Elder:
Solution sets for equations over free groups are EDT0L languages. Int. J. Algebra Comput. 26(5): 843-886 (2016) - [j60]Volker Diekert, Jonathan Kausch:
Logspace computations in graph products. J. Symb. Comput. 75: 94-109 (2016) - [j59]Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and Improved Analysis. Theory Comput. Syst. 59(2): 209-230 (2016) - [j58]Volker Diekert, Manfred Kufleitner:
A survey on the local divisor technique. Theor. Comput. Sci. 610: 13-23 (2016) - [c60]Volker Diekert, Artur Jez, Manfred Kufleitner:
Solutions of Word Equations Over Partially Commutative Structures. ICALP 2016: 127:1-127:14 - [c59]Volker Diekert, Tobias Walter:
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay. ICALP 2016: 129:1-129:14 - [i25]Volker Diekert, Tobias Walter:
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. CoRR abs/1602.08981 (2016) - [i24]Volker Diekert, Artur Jez, Manfred Kufleitner:
Solutions of Word Equations over Partially Commutative Structures. CoRR abs/1603.02966 (2016) - 2015
- [j57]Volker Diekert, Tobias Walter:
Asymptotic Approximation for the Quotient Complexities of Atoms. Acta Cybern. 22(2): 349-357 (2015) - [j56]Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam:
SLP compression for solutions of equations with constraints in free and hyperbolic groups. Int. J. Algebra Comput. 25(1-2): 81-111 (2015) - [j55]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. J. ACM 62(5): 39:1-39:20 (2015) - [j54]Volker Diekert, Manfred Kufleitner:
Omega-Rational Expressions with Bounded Synchronization Delay. Theory Comput. Syst. 56(4): 686-696 (2015) - [c58]Volker Diekert:
More Than 1700 Years of Word Equations. CAI 2015: 22-28 - [c57]Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva:
Equations over Free Inverse Monoids with Idempotent Variables. CSR 2015: 173-188 - [c56]Laura Ciobanu, Volker Diekert, Murray Elder:
Solution Sets for Equations over Free Groups are EDT0L Languages. ICALP (2) 2015: 134-145 - [c55]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi Automata. ICTAC 2015: 39-57 - [c54]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. ISSAC 2015: 141-148 - [i23]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. CoRR abs/1501.05579 (2015) - [i22]Laura Ciobanu, Volker Diekert, Murray Elder:
Solution sets for equations over free groups are EDT0L languages. CoRR abs/1502.03426 (2015) - [i21]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi automata. CoRR abs/1507.01020 (2015) - [i20]Volker Diekert:
More Than 1700 Years of Word Equations. CoRR abs/1507.03215 (2015) - [i19]Laura Ciobanu, Volker Diekert, Murray Elder:
Solution sets for equations over free groups are EDT0L languages. CoRR abs/1508.02149 (2015) - 2014
- [j53]Volker Diekert, Martin Leucker:
Topology, monitorable properties and runtime verification. Theor. Comput. Sci. 537: 29-41 (2014) - [c53]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR 2014: 1-15 - [c52]Volker Diekert, Jonathan Kausch:
Logspace computations in graph products. ISSAC 2014: 138-145 - [c51]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. LATIN 2014: 1-12 - [i18]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CoRR abs/1405.5133 (2014) - [i17]Volker Diekert, Manfred Kufleitner:
A Survey on the Local Divisor Technique. CoRR abs/1410.6026 (2014) - [i16]Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva:
Equations over free inverse monoids with idempotent variables. CoRR abs/1412.4737 (2014) - 2013
- [b3]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger:
Elemente der diskreten Mathematik - Zahlen und Zählen, Graphen und Verbände. De Gruyter Studium, de Gruyter 2013, ISBN 978-3-11-027767-8, pp. I-XI, 1-246 - [b2]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger:
Diskrete algebraische Methoden - Arithmetik, Kryptographie, Automaten und Gruppen. De Gruyter Studium, de Gruyter 2013, ISBN 978-3-11-031260-7, pp. I-XI, 1-318 - [j52]Volker Diekert, Armin Weiß:
Context-Free Groups and their Structure Trees. Int. J. Algebra Comput. 23(3): 611-642 (2013) - [c50]Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and Improved Analysis. CSR 2013: 24-35 - [i15]Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam:
SLP compression for solutions of equations with constraints in free and hyperbolic groups. CoRR abs/1308.5586 (2013) - [i14]Volker Diekert, Jonathan Kausch:
Logspace computations in graph products. CoRR abs/1309.1290 (2013) - [i13]Volker Diekert, Alexei Miasnikov, Armin Weiß:
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits. CoRR abs/1309.5314 (2013) - 2012
- [j51]Volker Diekert, Manfred Kufleitner, Benjamin Steinberg:
The Krohn-Rhodes Theorem and Local Divisors. Fundam. Informaticae 116(1-4): 65-77 (2012) - [j50]Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov:
Cyclic rewriting and conjugacy problems. Groups Complex. Cryptol. 4(2): 321-355 (2012) - [j49]Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput. 217: 12-30 (2012) - [j48]Volker Diekert, Jürn Laun, Alexander Ushakov:
Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P. Int. J. Algebra Comput. 22(8) (2012) - [j47]Volker Diekert, Alexei G. Myasnikov:
Group Extensions over Infinite Words. Int. J. Found. Comput. Sci. 23(5): 1001-1020 (2012) - [j46]Volker Diekert, Steffen Kopecki:
Language theoretical properties of hairpin formations. Theor. Comput. Sci. 429: 65-73 (2012) - [j45]Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454: 129-135 (2012) - [c49]Volker Diekert, Manfred Kufleitner:
Bounded Synchronization Delay in Omega-Rational Expressions. CSR 2012: 89-98 - [c48]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. ICALP (2) 2012: 177-188 - [c47]Volker Diekert, Jonathan Kausch, Markus Lohrey:
Logspace Computations in Graph Groups and Coxeter Groups. LATIN 2012: 243-254 - [c46]Volker Diekert, Jürn Laun, Alexander Ushakov:
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. STACS 2012: 218-229 - [c45]Volker Diekert, Anca Muscholl:
On Distributed Monitoring of Asynchronous Systems. WoLLIC 2012: 70-84 - [i12]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages are Church-Rosser Congruential. CoRR abs/1202.1148 (2012) - [i11]Volker Diekert, Anca Muscholl:
On distributed monitoring of asynchronous systems. CoRR abs/1208.2125 (2012) - [i10]Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and improved analysis. CoRR abs/1209.4214 (2012) - 2011
- [j44]Volker Diekert, Jürn Laun:
On Computing Geodesics in Baumslag-Solitar Groups. Int. J. Algebra Comput. 21(1-2): 119-145 (2011) - [j43]Volker Diekert, Dirk Nowotka:
Preface. Int. J. Found. Comput. Sci. 22(2): 275-276 (2011) - [j42]Volker Diekert, Steffen Kopecki:
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. Int. J. Found. Comput. Sci. 22(8): 1813-1828 (2011) - [j41]Volker Diekert, Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words. Theory Comput. Syst. 48(3): 486-516 (2011) - [c44]Volker Diekert, Alexei G. Myasnikov:
Solving Word Problems in Group Extensions over Infinite Words. Developments in Language Theory 2011: 192-203 - [p4]Volker Claus, Volker Diekert, Holger Petersen:
Marriage Broker. Algorithms Unplugged 2011: 345-355 - [r1]Volker Diekert, Anca Muscholl:
Trace Theory. Encyclopedia of Parallel Computing 2011: 2071-2079 - [i9]Volker Diekert, Steffen Kopecki:
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular. CoRR abs/1101.4824 (2011) - [i8]Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time. CoRR abs/1108.2427 (2011) - [i7]Volker Diekert, Manfred Kufleitner, Benjamin Steinberg:
The Krohn-Rhodes Theorem and Local Divisors. CoRR abs/1111.1585 (2011) - [i6]Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-Free Languages are Church-Rosser Congruential. CoRR abs/1111.4300 (2011) - 2010
- [j40]Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Preface. Theory Comput. Syst. 46(1): 1 (2010) - [j39]Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov:
Preface. Theory Comput. Syst. 46(4): 619 (2010) - [c43]Volker Diekert, Steffen Kopecki:
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). CIAA 2010: 105-114 - [i5]Volker Diekert, Alexei G. Myasnikov:
Group extensions over infinite words. CoRR abs/1011.2024 (2010)
2000 – 2009
- 2009
- [j38]Volker Diekert, Dalia Krieger:
Some remarks about stabilizers. Theor. Comput. Sci. 410(30-32): 2935-2946 (2009) - [c42]Volker Diekert, Steffen Kopecki, Victor Mitrana:
On the Hairpin Completion of Regular Languages. ICTAC 2009: 170-184 - [c41]Volker Diekert, Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words. STACS 2009: 325-336 - [e5]Volker Diekert, Dirk Nowotka:
Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings. Lecture Notes in Computer Science 5583, Springer 2009, ISBN 978-3-642-02736-9 [contents] - [i4]Volker Diekert, Manfred Kufleitner:
Fragments of first-order logic over infinite words. CoRR abs/0906.2995 (2009) - 2008
- [j37]Volker Diekert, Nicole Ondrusch, Markus Lohrey:
Algorithmic Problems on Inverse Monoids over Virtually Free Groups. Int. J. Algebra Comput. 18(1): 181-208 (2008) - [j36]Volker Diekert, Markus Lohrey:
Word Equations over Graph Products. Int. J. Algebra Comput. 18(3): 493-533 (2008) - [j35]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) - [j34]Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Foreword. Theory Comput. Syst. 43(2): 99 (2008) - [c40]Volker Diekert, Paul Gastin:
First-order definable languages. Logic and Automata 2008: 261-306 - [p3]Volker Claus, Volker Diekert, Holger Petersen:
Partnerschaftsvermittlung. Taschenbuch der Algorithmen 2008: 373-383 - 2007
- [j33]Volker Diekert, Martin Horsch, Manfred Kufleitner:
On First-Order Fragments for Mazurkiewicz Traces. Fundam. Informaticae 80(1-3): 1-29 (2007) - [j32]Volker Diekert, Bruno Durand:
Foreword. Theory Comput. Syst. 40(4): 301 (2007) - [c39]Volker Diekert, Manfred Kufleitner:
On First-Order Fragments for Words and Mazurkiewicz Traces. Developments in Language Theory 2007: 1-19 - [c38]Volker Diekert:
Equations: From Words to Graph Products. LATA 2007: 1-6 - [e4]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. Lecture Notes in Computer Science 4649, Springer 2007, ISBN 978-3-540-74509-9 [contents] - 2006
- [j31]Volker Diekert, Paul Gastin:
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204(11): 1597-1619 (2006) - [j30]Volker Diekert, Anca Muscholl:
Solvability of Equations in Graph Groups Is Decidable. Int. J. Algebra Comput. 16(6): 1047-1070 (2006) - [j29]Volker Diekert, Michel Habib:
Foreword. Theory Comput. Syst. 39(1): 1 (2006) - [j28]Volker Diekert, Paul Gastin:
From local to global temporal logics over Mazurkiewicz traces. Theor. Comput. Sci. 356(1-2): 126-135 (2006) - [c37]Volker Diekert, Markus Lohrey, Alexander Miller:
Partially Commutative Inverse Monoids. MFCS 2006: 292-304 - 2005
- [j27]Volker Diekert, Claudio Gutierrez, Christian Hagenah:
The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. Comput. 202(2): 105-140 (2005) - [j26]Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen:
Regular frequency computations. Theor. Comput. Sci. 330(1): 15-21 (2005) - [e3]Volker Diekert, Bruno Durand:
STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Lecture Notes in Computer Science 3404, Springer 2005, ISBN 3-540-24998-2 [contents] - 2004
- [j25]Volker Diekert, Paul Gastin:
Local temporal logic is expressively complete for cograph dependence alphabets. Inf. Comput. 195(1-2): 30-52 (2004) - [j24]Volker Diekert, Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products. Theory Comput. Syst. 37(1): 133-156 (2004) - [c36]Volker Diekert, Paul Gastin:
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. LATIN 2004: 232-241 - [e2]Volker Diekert, Michel Habib:
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Lecture Notes in Computer Science 2996, Springer 2004, ISBN 3-540-21236-1 [contents] - 2003
- [j23]Holger Austinat, Volker Diekert, Ulrich Hertrampf:
A structural property of regular frequency computations. Theor. Comput. Sci. 292(1): 33-43 (2003) - [c35]Volker Diekert, Markus Lohrey:
Word Equations over Graph Products. FSTTCS 2003: 156-167 - 2002
- [j22]Volker Diekert, Markus Lohrey:
A Note on The Existential Theory of Equations in Plain Groups. Int. J. Algebra Comput. 12(1-2): 1-7 (2002) - [j21]Volker Diekert, Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces. J. Comput. Syst. Sci. 64(2): 396-418 (2002) - [c34]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 - [c33]Volker Diekert, Manfred Kufleitner:
A Remark about Quadratic Trace Equations. Developments in Language Theory 2002: 59-66 - [c32]Volker Diekert, Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products. STACS 2002: 501-512 - 2001
- [c31]Volker Diekert, Anca Muscholl:
Solvability of Equations in Free Partially Commutative Groups Is Decidable. ICALP 2001: 543-554 - [c30]Volker Diekert, Paul Gastin:
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. LPAR 2001: 55-69 - [c29]Volker Diekert, Claudio Gutierrez, Christian Hagenah:
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. STACS 2001: 170-182 - [i3]Volker Diekert, Claudio Gutierrez, Christian Hagenah:
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. CoRR cs.DS/0103018 (2001) - 2000
- [c28]Volker Diekert, Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces. ICALP 2000: 211-222
1990 – 1999
- 1999
- [j20]Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl:
Solving Word Equations modulo Partial Commutations. Theor. Comput. Sci. 224(1-2): 215-235 (1999) - [c27]Volker Diekert, John Michael Robson:
Quadratic Word Equations. Jewels are Forever 1999: 314-326 - [c26]Volker Diekert, Paul Gastin:
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. CSL 1999: 188-203 - [c25]John Michael Robson, Volker Diekert:
On Quadratic Word Equations. STACS 1999: 217-226 - 1998
- [j19]Volker Diekert, Paul Gastin:
Approximating Traces. Acta Informatica 35(7): 567-593 (1998) - [j18]Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin:
Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundam. Informaticae 36(2-3): 145-182 (1998) - 1997
- [c24]Volker Diekert:
A Remark on Trace Equations. Foundations of Computer Science: Potential - Theory - Cognition 1997: 251-260 - [c23]Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl:
Solving Trace Equations Using Lexicographical Normal Forms. ICALP 1997: 336-346 - [c22]Volker Diekert, Paul Gastin, Antoine Petit:
Removing epsilon-Transitions in Timed Automata. STACS 1997: 583-594 - [p2]Volker Diekert, Yves Métivier:
Partial Commutation and Traces. Handbook of Formal Languages (3) 1997: 457-533 - 1996
- [j17]Volker Diekert, Anca Muscholl:
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. Fundam. Informaticae 25(3): 241-246 (1996) - [c21]Volker Diekert, Anca Muscholl:
Code Problems on Traces. MFCS 1996: 2-17 - [c20]Michael Bertol, Volker Diekert:
Trace Rewriting: Computing Normal Forms in Time O(n log n). STACS 1996: 269-280 - 1995
- [j16]Volker Diekert, Paul Gastin, Antoine Petit:
Rational and Recognizable Complex Trace Languages. Inf. Comput. 116(1): 134-153 (1995) - [j15]Celia Wrathall, Volker Diekert:
On Confluence of One-Rule Trace-Rewriting Systems. Math. Syst. Theory 28(4): 341-361 (1995) - [c19]Volker Diekert, Paul Gastin, Antoine Petit:
Recent Developments in Trace Theory. Developments in Language Theory 1995: 373-385 - [c18]Volker Diekert, Paul Gastin:
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). ICALP 1995: 15-26 - [c17]Volker Diekert, Anca Muscholl, Klaus Reinhardt:
On Codings of Traces. STACS 1995: 385-396 - [p1]Volker Diekert, Anca Muscholl:
Construction of Asynchronous Automata. The Book of Traces 1995: 249-267 - [e1]Volker Diekert, Grzegorz Rozenberg:
The Book of Traces. World Scientific 1995, ISBN 978-981-02-2058-7 [contents] - 1994
- [j14]Volker Diekert, Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces. Acta Informatica 31(4): 379-397 (1994) - [j13]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-commutations: Decidability and Complexity Results. Inf. Comput. 110(1): 164-182 (1994) - [j12]Volker Diekert:
A Partial Trace Semantics for Petri Nets. Theor. Comput. Sci. 134(1): 87-105 (1994) - 1993
- [j11]Volker Diekert:
Möbius Functions and Confluent Semi-Commutations. Theor. Comput. Sci. 108(1): 25-43 (1993) - [j10]Volker Diekert:
On the Concentration of Infinite Traces. Theor. Comput. Sci. 113(1): 35-54 (1993) - [c16]Michael Bertol, Volker Diekert:
On Efficient Reduction Algorithms for Some Trace Rewriting Systems. Term Rewriting 1993: 114-126 - [c15]Volker Diekert:
Rewriting, Möbius Functions and Semi-Commutations. FCT 1993: 1-15 - [c14]Volker Diekert:
Complex and Complex-Like Traces. MFCS 1993: 68-82 - [c13]Volker Diekert, Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces. STACS 1993: 617-628 - 1992
- [c12]Celia Wrathall, Volker Diekert, Friedrich Otto:
One-Rule Trace-Rewriting Systems and Confluence. MFCS 1992: 511-521 - 1991
- [j9]Volker Diekert, Ronald V. Book:
On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores. Inf. Process. Lett. 40(1): 21-23 (1991) - [c11]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241 - [c10]Volker Diekert, Paul Gastin, Antoine Petit:
Recognizable Complex Trace Languages. MFCS 1991: 131-140 - [c9]Volker Diekert:
On the Concatenation of Infinite Traces. STACS 1991: 105-117 - 1990
- [b1]Volker Diekert:
Combinatorics on Traces. Lecture Notes in Computer Science 454, Springer 1990, ISBN 3-540-53031-2 - [j8]Volker Diekert:
Word Problems Over Traces which are Solvable in Linear Time. Theor. Comput. Sci. 74(1): 3-18 (1990) - [c8]Volker Diekert:
Combinatorial Rewriting on Traces. STACS 1990: 138-151 - [i2]Volker Diekert:
Two contributions to the theory of Marzukiewicz traces. Forschungsberichte, TU Munich TUM I 9036: 1-37 (1990) - [i1]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On confluent semi-commutations: decidability and complexity results. Forschungsberichte, TU Munich TUM I 9041: 1-18 (1990)
1980 – 1989
- 1989
- [j7]Volker Diekert, Axel Möbus:
Hotz-Isomorphism Theorems In Formal Language Theory. RAIRO Theor. Informatics Appl. 23(1): 29-43 (1989) - [j6]Volker Diekert, Walter Vogler:
On the Synchronization of Traces. Math. Syst. Theory 22(3): 161-175 (1989) - [j5]Volker Diekert:
On the Knuth-Bendix Completion for Concurrent Processes. Theor. Comput. Sci. 66(2): 117-136 (1989) - [c7]Volker Diekert:
Word Problems over TRaces Which are Solvable in Linear Time. STACS 1989: 168-180 - 1988
- [c6]Volker Diekert:
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. ICALP 1988: 176-187 - [c5]Volker Diekert, Walter Vogler:
Local Checking of Trace Synchroniziability. MFCS 1988: 271-279 - [c4]Volker Diekert, Axel Möbus:
Hotz-Isomorphism Theorems in Formal Language Theory. STACS 1988: 126-135 - 1987
- [c3]Volker Diekert:
On the Knuth-Bendix Completion for Concurrent Processes. ICALP 1987: 42-53 - [c2]Volker Diekert:
Some Remarks on Presentations by Finite Church-Rosser Thue Systems. STACS 1987: 272-285 - 1986
- [j4]Volker Diekert:
Investigations on Hotz Groups for Arbitrary Grammars. Acta Informatica 22(6): 679-698 (1986) - [j3]Volker Diekert:
Complete Semi-Thue Systems for Abelian Groups. Theor. Comput. Sci. 44: 199-208 (1986) - [j2]Volker Diekert:
On some variants of the Ehrenfeucht conjecture. Theor. Comput. Sci. 46: 313-318 (1986) - [j1]Volker Diekert:
Commutative monoids have complete presentations by free (non-commutative) monoids. Theor. Comput. Sci. 46: 319-327 (1986) - 1985
- [c1]Volker Diekert:
On Hotz Groups and Homomorphic Images of Sentential Form Languages. STACS 1985: 87-97
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
