×
Author ID: diekert.volker Recent zbMATH articles by "Diekert, Volker"
Published as: Diekert, Volker; Diekert, V.; Dieckert, Volker; Diekert, Volkert
Homepage: http://www.fmi.uni-stuttgart.de/ti/team/diekert/
External Links: MGP · ORCID · Math-Net.Ru · dblp · GND
Member of Collective: Lothaire, M.

Publications by Year

Citations contained in zbMATH Open

124 Publications have been cited 731 times in 474 Documents Cited by Year
Combinatorics on traces. Zbl 0717.68002
Diekert, Volker
84
1990
Characterization of the expressive power of silent transitions in timed automata. Zbl 0930.68077
Bérard, Béatrice; Petit, Antoine; Diekert, Volker; Gastin, Paul
39
1998
First-order definable languages. Zbl 1234.03024
Diekert, Volker; Gastin, Paul
35
2008
A survey on small fragments of first-order logic over finite words. Zbl 1157.03003
Diekert, Volker; Gastin, Paul; Kufleitner, Manfred
33
2008
The existential theory of equations with rational constraints in free groups is PSPACE-complete. Zbl 1101.68649
Diekert, Volker; Gutierrez, Claudio; Hagenah, Christian
24
2005
Solvability of equations in graph groups is decidable. Zbl 1112.03009
Diekert, Volker; Muscholl, Anca
16
2006
Word equations over graph products. Zbl 1186.20041
Diekert, Volker; Lohrey, Markus
15
2008
Solution sets for equations over free groups are EDT0L languages. Zbl 1401.68156
Ciobanu, Laura; Diekert, Volker; Elder, Murray
14
2016
The existential theory of equations with rational constraints in free groups is PSPACE-complete. Zbl 0976.68095
Diekert, Volker; Gutiérrez, Claudio; Hagenah, Christian
12
2001
Finding all solutions of equations in free groups and monoids with involution. Zbl 1382.68347
Diekert, Volker; Jeż, Artur; Plandowski, Wojciech
12
2016
Solutions of word equations over partially commutative structures. Zbl 1388.68164
Diekert, Volker; Jez, Artur; Kufleitner, Manfred
12
2016
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Zbl 1113.03016
Diekert, Volker; Gastin, Paul
11
2006
Solution sets for equations over free groups are EDT0L languages. Zbl 1412.68124
Ciobanu, Laura; Diekert, Volker; Elder, Murray
11
2015
On quadratic word equations. Zbl 0928.68088
Robson, John Michael; Diekert, Volker
10
1999
Complete semi-Thue systems for abelian groups. Zbl 0609.68028
Diekert, Volker
10
1986
LTL is expressively complete for Mazurkiewicz traces. Zbl 1013.68130
Diekert, Volker; Gastin, Paul
10
2002
Context-free groups and their structure trees. Zbl 1270.20030
Diekert, Volker; Weiß, Armin
10
2013
On the concatenation of infinite traces. (Extended abstract). Zbl 0773.68057
Diekert, Volker
9
1991
Fragments of first-order logic over infinite words. Zbl 1258.03045
Diekert, Volker; Kufleitner, Manfred
9
2011
Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Zbl 1245.68103
Diekert, Volker; Laun, Jürn; Ushakov, Alexander
8
2012
On the hairpin completion of regular languages. Zbl 1250.68153
Diekert, Volker; Kopecki, Steffen; Mitrana, Victor
8
2009
Existential and positive theories of equations in graph products. Zbl 1067.03017
Diekert, Volker; Lohrey, Markus
8
2004
Recognizable complex trace languages. (Abstract). Zbl 0777.68057
Diekert, Volker; Gastin, Paul; Petit, Antoine
8
1991
The Krohn-Rhodes theorem and local divisors. Zbl 1263.68116
Diekert, Volker; Kufleitner, Manfred; Steinberg, Benjamin
8
2012
Removing \(\epsilon \)-transitions in timed automata. Zbl 1498.68135
Diekert, Volker; Gastin, Paul; Petit, Antoine
8
1997
Deterministic asynchronous automata for infinite traces. Zbl 0818.68100
Diekert, Volker; Muscholl, Anca
7
1994
Finding all solutions of equations in free groups and monoids with involution. Zbl 1382.68348
Diekert, Volker; Jeż, Artur; Plandowski, Wojciech
7
2014
More than 1700 years of word equations. Zbl 1402.68146
Diekert, Volker
7
2015
Solutions to twisted word equations and equations in virtually free groups. Zbl 1481.20118
Diekert, Volker; Elder, Murray
7
2020
Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits. Zbl 1352.68102
Diekert, Volker; Myasnikov, Alexei G.; Weiß, Armin
7
2014
Some remarks on presentations by finite Church-Rosser Thue systems. Zbl 0636.20023
Diekert, Volker
6
1987
Star-free languages are Church-Rosser congruential. Zbl 1279.68147
Diekert, Volker; Kufleitner, Manfred; Weil, Pascal
6
2012
Solving word equations modulo partial commutations. Zbl 0930.68074
Diekert, Volker; Matiyasevich, Yuri; Muscholl, Anca
6
1999
Quadratic word equations. Zbl 0944.68151
Diekert, Volker; Robson, John Michael
6
1999
Rational and recognizable complex trace languages. Zbl 0818.68073
Diekert, Volker; Gastin, Paul; Petit, Antoine
6
1995
On confluence of one-rule trace-rewriting systems. Zbl 0837.68055
Wrathall, C.; Diekert, V.
6
1995
Solvability of equations in free partially commutative groups is decidable. Zbl 0986.20036
Diekert, Volker; Muscholl, Anca
6
2001
On the concatenation of infinite traces. Zbl 0786.68074
Diekert, Volker
6
1993
Deterministic asynchronous automata for infinite traces. (Extended abstract). Zbl 0799.68140
Diekert, Volker; Muscholl, Anca
6
1993
Discrete algebraic methods. Arithmetic, cryptography, automata and groups. Zbl 1350.00001
Diekert, Volker; Kufleitner, Manfred; Rosenberger, Gerhard; Hertrampf, Ulrich
6
2016
Context-free groups and Bass-Serre theory. Zbl 1436.20062
Diekert, Volker; Weiß, Armin
6
2017
Complexity results and the growths of hairpin completions of regular languages (extended abstract). Zbl 1297.68122
Diekert, Volker; Kopecki, Steffen
5
2011
Regular frequency computations. Zbl 0969.68522
Austinat, Holger; Diekert, Volker; Hertrampf, Ulrich; Petersen, Holger
5
2000
A partial trace semantics for Petri nets. Zbl 0823.68058
Diekert, V.
5
1994
Commutative monoids have complete presentations by free (non-commutative) monoids. Zbl 0607.20032
Diekert, Volker
5
1986
Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids. Zbl 0707.68049
Diekert, Volker
5
1988
On codings of traces. Zbl 1379.68243
Diekert, Volker; Muscholl, Anca; Reinhardt, Klaus
5
1995
A structural property of regular frequency computations. Zbl 1064.68049
Austinat, Holger; Diekert, Volker; Hertrampf, Ulrich
5
2003
On the Knuth-Bendix completion for concurrent processes. Zbl 0633.68015
Diekert, Volker
4
1987
Über die absolute Galoisgruppe dyadischer Zahlkörper. Zbl 0524.12007
Diekert, Volker
4
1984
On computing geodesics in Baumslag-Solitar groups. Zbl 1235.20041
Diekert, Volker; Laun, Jürn
4
2011
LTL is expressively complete for Mazurkiewicz traces. Zbl 0973.68165
Diekert, Volker; Gastin, Paul
4
2000
Some remarks about stabilizers. Zbl 1173.68053
Diekert, Volker; Krieger, Dalia
4
2009
Safety and liveness properties for real traces and a direct translation from LTL to monoids. Zbl 1060.68077
Diekert, Volker; Gastin, Paul
4
2002
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Zbl 1196.68155
Diekert, Volker; Gastin, Paul
4
2004
Investigations on Hotz groups for arbitrary grammars. Zbl 0612.68067
Diekert, Volker
4
1986
Logspace computations in graph groups and Coxeter groups. Zbl 1283.20043
Diekert, Volker; Kausch, Jonathan; Lohrey, Markus
4
2012
Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits. Zbl 1357.68081
Diekert, Volker; Myasnikov, Alexei G.; Weiß, Armin
4
2016
Logspace computations in graph products. Zbl 1335.68103
Diekert, Volker; Kausch, Jonathan
4
2016
A survey on the local divisor technique. Zbl 1332.68147
Diekert, Volker; Kufleitner, Manfred
4
2016
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. Zbl 1346.20041
Diekert, Volker; Myasnikov, Alexei; Weiß, Armin
4
2015
Logspace computations in Coxeter groups and graph groups. Zbl 1283.20044
Diekert, Volker; Kausch, Jonathan; Lohrey, Markus
4
2012
Geodesic rewriting systems and pregroups. Zbl 1220.20022
Diekert, Volker; Duncan, Andrew J.; Myasnikov, Alexei G.
4
2010
Regular languages are Church-Rosser congruential. Zbl 1367.68166
Diekert, Volker; Kufleitner, Manfred; Reinhardt, Klaus; Walter, Tobias
4
2012
On the Knuth-Bendix completion for concurrent processes. Zbl 0686.68023
Diekert, Volker
3
1989
Local temporal logic is expressively complete for cograph dependence alphabets. Zbl 1275.68089
Diekert, Volker; Gastin, Paul
3
2001
Fragments of first-order logic over infinite words. Zbl 1236.68166
Diekert, Volker; Kufleitner, Manfred
3
2009
Weinbaum factorizations of primitive words. Zbl 1187.68361
Diekert, V.; Harju, T.; Nowotka, D.
3
2010
Word equations over graph products. Zbl 1188.20066
Diekert, Volker; Lohrey, Markus
3
2003
Regular frequency computations. Zbl 1078.68073
Austinat, Holger; Diekert, Volker; Hertrampf, Ulrich; Petersen, Holger
3
2005
Möbius functions and confluent semi-commutations. Zbl 0777.68052
Diekert, Volker
3
1993
On confluent semi-commutations – decidability and complexity results. Zbl 0769.68057
Diekert, Volker; Ochmanski, Edward; Reinhardt, Klaus
3
1991
A note on monitors and Büchi automata. Zbl 1471.68115
Diekert, Volker; Muscholl, Anca; Walukiewicz, Igor
3
2015
Solutions of twisted word equations, EDT0L languages, and context-free groups. Zbl 1442.68090
Diekert, Volker; Elder, Murray
3
2017
Properties of graphs specified by a regular language. Zbl 07498720
Diekert, Volker; Fernau, Henning; Wolf, Petra
3
2021
Solving trace equations using lexicographical normal forms. Zbl 1401.68161
Diekert, Volker; Matiyasevich, Yuri; Muscholl, Anca
3
1997
Hotz-isomorhism theorems in formal language theory. Zbl 0665.68059
Diekert, Volker; Möbus, Axel
2
1989
Partially commutative inverse monoids. Zbl 1132.20308
Diekert, Volker; Lohrey, Markus; Miller, Alexander
2
2006
Algorithmic problems on inverse monoids over virtually free groups. Zbl 1190.20045
Diekert, Volker; Ondrusch, Nicole; Lohrey, Markus
2
2008
Deciding regularity of hairpin completions of regular languages in polynomial time. Zbl 1279.68093
Diekert, Volker; Kopecki, Steffen; Mitrana, Victor
2
2012
Approximating traces. Zbl 0912.68128
Diekert, Volker; Gastin, Paul
2
1998
A note on Métivier’s construction of asynchronous automata for triangulated graphs. Zbl 0843.68072
Diekert, Volkert; Muscholl, Anca
2
1996
STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Zbl 1069.68004
2
2005
Code problems on traces. Zbl 0889.68092
Diekert, Volker; Muscholl, Anca
2
1996
An expressively complete temporal logic without past tense operators for Mazurkiewicz traces. Zbl 0942.03028
Diekert, Volker; Gastin, Paul
2
1999
Language theoretical properties of hairpin formations. Zbl 1260.68200
Diekert, Volker; Kopecki, Steffen
2
2012
From local to global temporal logics over Mazurkiewicz traces. Zbl 1160.68574
Diekert, Volker; Gastin, Paul
2
2006
Local temporal logic is expressively complete for cograph dependence alphabets. Zbl 1101.68648
Diekert, Volker; Gastin, Paul
2
2004
Word problems over traces which are solvable in linear time. Zbl 0701.68056
Diekert, Volker
2
1990
Combinatorial rewriting on traces. Zbl 0729.68034
Diekert, Volker
2
1990
QuickHeapsort: modifications and improved analysis. Zbl 1353.68063
Diekert, Volker; Weiß, Armin
2
2016
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. Zbl 1388.68165
Diekert, Volker; Walter, Tobias
2
2016
Some identities related to automata, determinants, and Möbius functions. Zbl 1047.68076
Diekert, Volker; Kobayashi, Yuji
2
1999
Omega-rational expressions with bounded synchronization delay. Zbl 1343.68135
Diekert, Volker; Kufleitner, Manfred
2
2015
A note on the existential theory of equations in plain groups. Zbl 1007.03008
Diekert, Volker; Lohrey, Markus
2
2002
Regular matching problems for infinite trees. Zbl 07471714
Camino, Carlos; Diekert, Volker; Dundua, Besik; Marin, Mircea; Sénizergues, Géraud
2
2022
Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Zbl 1264.20034
Diekert, Volker; Laun, Jürn; Ushakov, Alexander
2
2012
Cyclic rewriting and conjugacy problems. Zbl 1286.20035
Diekert, Volker; Duncan, Andrew; Myasnikov, Alexei G.
2
2012
A domain for concurrent termination a generalization of Mazurkiewicz traces (extended abstract). Zbl 1412.68150
Diekert, Volker; Gastin, Paul
2
1995
Local checking of trace synchronizability. Zbl 0652.68018
Diekert, Volker; Vogler, Walter
1
1988
Regular matching problems for infinite trees. Zbl 07471714
Camino, Carlos; Diekert, Volker; Dundua, Besik; Marin, Mircea; Sénizergues, Géraud
2
2022
Properties of graphs specified by a regular language. Zbl 07498720
Diekert, Volker; Fernau, Henning; Wolf, Petra
3
2021
Solutions to twisted word equations and equations in virtually free groups. Zbl 1481.20118
Diekert, Volker; Elder, Murray
7
2020
Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2, \mathbb{Q})\) and singular matrices. Zbl 07300062
Diekert, Volker; Potapov, Igor; Semukhin, Pavel
1
2020
Context-free groups and Bass-Serre theory. Zbl 1436.20062
Diekert, Volker; Weiß, Armin
6
2017
Solutions of twisted word equations, EDT0L languages, and context-free groups. Zbl 1442.68090
Diekert, Volker; Elder, Murray
3
2017
Equations over free inverse monoids with idempotent variables. Zbl 1404.20046
Diekert, Volker; Martin, Florent; Sénizergues, Géraud; Silva, Pedro V.
1
2017
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. Zbl 1373.68291
Diekert, Volker; Walter, Tobias
1
2017
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. Zbl 1371.20037
Diekert, Volker; Myasnikov, Alexei G.; Weiß, Armin
1
2017
Solution sets for equations over free groups are EDT0L languages. Zbl 1401.68156
Ciobanu, Laura; Diekert, Volker; Elder, Murray
14
2016
Finding all solutions of equations in free groups and monoids with involution. Zbl 1382.68347
Diekert, Volker; Jeż, Artur; Plandowski, Wojciech
12
2016
Solutions of word equations over partially commutative structures. Zbl 1388.68164
Diekert, Volker; Jez, Artur; Kufleitner, Manfred
12
2016
Discrete algebraic methods. Arithmetic, cryptography, automata and groups. Zbl 1350.00001
Diekert, Volker; Kufleitner, Manfred; Rosenberger, Gerhard; Hertrampf, Ulrich
6
2016
Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits. Zbl 1357.68081
Diekert, Volker; Myasnikov, Alexei G.; Weiß, Armin
4
2016
Logspace computations in graph products. Zbl 1335.68103
Diekert, Volker; Kausch, Jonathan
4
2016
A survey on the local divisor technique. Zbl 1332.68147
Diekert, Volker; Kufleitner, Manfred
4
2016
QuickHeapsort: modifications and improved analysis. Zbl 1353.68063
Diekert, Volker; Weiß, Armin
2
2016
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. Zbl 1388.68165
Diekert, Volker; Walter, Tobias
2
2016
Solution sets for equations over free groups are EDT0L languages. Zbl 1412.68124
Ciobanu, Laura; Diekert, Volker; Elder, Murray
11
2015
More than 1700 years of word equations. Zbl 1402.68146
Diekert, Volker
7
2015
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. Zbl 1346.20041
Diekert, Volker; Myasnikov, Alexei; Weiß, Armin
4
2015
A note on monitors and Büchi automata. Zbl 1471.68115
Diekert, Volker; Muscholl, Anca; Walukiewicz, Igor
3
2015
Omega-rational expressions with bounded synchronization delay. Zbl 1343.68135
Diekert, Volker; Kufleitner, Manfred
2
2015
Equations over free inverse monoids with idempotent variables. Zbl 1404.20045
Diekert, Volker; Martin, Florent; Sénizergues, Géraud; Silva, Pedro V.
1
2015
Finding all solutions of equations in free groups and monoids with involution. Zbl 1382.68348
Diekert, Volker; Jeż, Artur; Plandowski, Wojciech
7
2014
Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits. Zbl 1352.68102
Diekert, Volker; Myasnikov, Alexei G.; Weiß, Armin
7
2014
Logspace computations in graph products. Zbl 1325.68106
Diekert, Volker; Kausch, Jonathan
1
2014
Topology, monitorable properties and runtime verification. Zbl 1359.68164
Diekert, Volker; Leucker, Martin
1
2014
Context-free groups and their structure trees. Zbl 1270.20030
Diekert, Volker; Weiß, Armin
10
2013
Elements of discrete mathematics. Numbers and counting, graphs and lattices. (Elemente der diskreten Mathematik. Zahlen und Zählen, Graphen und Verbände.) Zbl 1276.05001
Diekert, Volker; Kufleitner, Manfred; Rosenberger, Gerhard
1
2013
Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Zbl 1245.68103
Diekert, Volker; Laun, Jürn; Ushakov, Alexander
8
2012
The Krohn-Rhodes theorem and local divisors. Zbl 1263.68116
Diekert, Volker; Kufleitner, Manfred; Steinberg, Benjamin
8
2012
Star-free languages are Church-Rosser congruential. Zbl 1279.68147
Diekert, Volker; Kufleitner, Manfred; Weil, Pascal
6
2012
Logspace computations in graph groups and Coxeter groups. Zbl 1283.20043
Diekert, Volker; Kausch, Jonathan; Lohrey, Markus
4
2012
Logspace computations in Coxeter groups and graph groups. Zbl 1283.20044
Diekert, Volker; Kausch, Jonathan; Lohrey, Markus
4
2012
Regular languages are Church-Rosser congruential. Zbl 1367.68166
Diekert, Volker; Kufleitner, Manfred; Reinhardt, Klaus; Walter, Tobias
4
2012
Deciding regularity of hairpin completions of regular languages in polynomial time. Zbl 1279.68093
Diekert, Volker; Kopecki, Steffen; Mitrana, Victor
2
2012
Language theoretical properties of hairpin formations. Zbl 1260.68200
Diekert, Volker; Kopecki, Steffen
2
2012
Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Zbl 1264.20034
Diekert, Volker; Laun, Jürn; Ushakov, Alexander
2
2012
Cyclic rewriting and conjugacy problems. Zbl 1286.20035
Diekert, Volker; Duncan, Andrew; Myasnikov, Alexei G.
2
2012
Fragments of first-order logic over infinite words. Zbl 1258.03045
Diekert, Volker; Kufleitner, Manfred
9
2011
Complexity results and the growths of hairpin completions of regular languages (extended abstract). Zbl 1297.68122
Diekert, Volker; Kopecki, Steffen
5
2011
On computing geodesics in Baumslag-Solitar groups. Zbl 1235.20041
Diekert, Volker; Laun, Jürn
4
2011
Solving word problems in group extensions over infinite words. Zbl 1221.68178
Diekert, Volker; Myasnikov, Alexei G.
1
2011
It is NL-complete to decide whether a hairpin completion of regular languages is regular. Zbl 1255.68070
Diekert, Volker; Kopecki, Steffen
1
2011
Geodesic rewriting systems and pregroups. Zbl 1220.20022
Diekert, Volker; Duncan, Andrew J.; Myasnikov, Alexei G.
4
2010
Weinbaum factorizations of primitive words. Zbl 1187.68361
Diekert, V.; Harju, T.; Nowotka, D.
3
2010
On the hairpin completion of regular languages. Zbl 1250.68153
Diekert, Volker; Kopecki, Steffen; Mitrana, Victor
8
2009
Some remarks about stabilizers. Zbl 1173.68053
Diekert, Volker; Krieger, Dalia
4
2009
Fragments of first-order logic over infinite words. Zbl 1236.68166
Diekert, Volker; Kufleitner, Manfred
3
2009
First-order definable languages. Zbl 1234.03024
Diekert, Volker; Gastin, Paul
35
2008
A survey on small fragments of first-order logic over finite words. Zbl 1157.03003
Diekert, Volker; Gastin, Paul; Kufleitner, Manfred
33
2008
Word equations over graph products. Zbl 1186.20041
Diekert, Volker; Lohrey, Markus
15
2008
Algorithmic problems on inverse monoids over virtually free groups. Zbl 1190.20045
Diekert, Volker; Ondrusch, Nicole; Lohrey, Markus
2
2008
Partially commutative inverse monoids. Zbl 1156.20049
Diekert, Volker; Lohrey, Markus; Miller, Alexander
1
2008
Computer science – theory and applications. Second international symposium on computer science in Russia, CSR 2007, Ekaterinburg, Russia, September 3–7, 2007. Proceedings. Zbl 1135.68001
1
2007
On first-order fragments for Mazurkiewicz traces. Zbl 1128.03018
Diekert, Volker; Horsch, Martin; Kufleitner, Manfred
1
2007
Solvability of equations in graph groups is decidable. Zbl 1112.03009
Diekert, Volker; Muscholl, Anca
16
2006
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Zbl 1113.03016
Diekert, Volker; Gastin, Paul
11
2006
Partially commutative inverse monoids. Zbl 1132.20308
Diekert, Volker; Lohrey, Markus; Miller, Alexander
2
2006
From local to global temporal logics over Mazurkiewicz traces. Zbl 1160.68574
Diekert, Volker; Gastin, Paul
2
2006
The existential theory of equations with rational constraints in free groups is PSPACE-complete. Zbl 1101.68649
Diekert, Volker; Gutierrez, Claudio; Hagenah, Christian
24
2005
Regular frequency computations. Zbl 1078.68073
Austinat, Holger; Diekert, Volker; Hertrampf, Ulrich; Petersen, Holger
3
2005
STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Zbl 1069.68004
2
2005
Existential and positive theories of equations in graph products. Zbl 1067.03017
Diekert, Volker; Lohrey, Markus
8
2004
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Zbl 1196.68155
Diekert, Volker; Gastin, Paul
4
2004
Local temporal logic is expressively complete for cograph dependence alphabets. Zbl 1101.68648
Diekert, Volker; Gastin, Paul
2
2004
STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Zbl 1046.68005
1
2004
A structural property of regular frequency computations. Zbl 1064.68049
Austinat, Holger; Diekert, Volker; Hertrampf, Ulrich
5
2003
Word equations over graph products. Zbl 1188.20066
Diekert, Volker; Lohrey, Markus
3
2003
A remark about quadratic trace equations. Zbl 1015.68125
Diekert, Volker; Kufleitner, Manfred
1
2003
LTL is expressively complete for Mazurkiewicz traces. Zbl 1013.68130
Diekert, Volker; Gastin, Paul
10
2002
Safety and liveness properties for real traces and a direct translation from LTL to monoids. Zbl 1060.68077
Diekert, Volker; Gastin, Paul
4
2002
A note on the existential theory of equations in plain groups. Zbl 1007.03008
Diekert, Volker; Lohrey, Markus
2
2002
The existential theory of equations with rational constraints in free groups is PSPACE-complete. Zbl 0976.68095
Diekert, Volker; Gutiérrez, Claudio; Hagenah, Christian
12
2001
Solvability of equations in free partially commutative groups is decidable. Zbl 0986.20036
Diekert, Volker; Muscholl, Anca
6
2001
Local temporal logic is expressively complete for cograph dependence alphabets. Zbl 1275.68089
Diekert, Volker; Gastin, Paul
3
2001
Regular frequency computations. Zbl 0969.68522
Austinat, Holger; Diekert, Volker; Hertrampf, Ulrich; Petersen, Holger
5
2000
LTL is expressively complete for Mazurkiewicz traces. Zbl 0973.68165
Diekert, Volker; Gastin, Paul
4
2000
On quadratic word equations. Zbl 0928.68088
Robson, John Michael; Diekert, Volker
10
1999
Solving word equations modulo partial commutations. Zbl 0930.68074
Diekert, Volker; Matiyasevich, Yuri; Muscholl, Anca
6
1999
Quadratic word equations. Zbl 0944.68151
Diekert, Volker; Robson, John Michael
6
1999
An expressively complete temporal logic without past tense operators for Mazurkiewicz traces. Zbl 0942.03028
Diekert, Volker; Gastin, Paul
2
1999
Some identities related to automata, determinants, and Möbius functions. Zbl 1047.68076
Diekert, Volker; Kobayashi, Yuji
2
1999
Characterization of the expressive power of silent transitions in timed automata. Zbl 0930.68077
Bérard, Béatrice; Petit, Antoine; Diekert, Volker; Gastin, Paul
39
1998
Approximating traces. Zbl 0912.68128
Diekert, Volker; Gastin, Paul
2
1998
Removing \(\epsilon \)-transitions in timed automata. Zbl 1498.68135
Diekert, Volker; Gastin, Paul; Petit, Antoine
8
1997
Solving trace equations using lexicographical normal forms. Zbl 1401.68161
Diekert, Volker; Matiyasevich, Yuri; Muscholl, Anca
3
1997
A note on Métivier’s construction of asynchronous automata for triangulated graphs. Zbl 0843.68072
Diekert, Volkert; Muscholl, Anca
2
1996
Code problems on traces. Zbl 0889.68092
Diekert, Volker; Muscholl, Anca
2
1996
Trace rewriting: computing normal forms in time \(\mathcal O(n\log n)\). Zbl 1379.68193
Bertol, Michael; Diekert, Volker
1
1996
Rational and recognizable complex trace languages. Zbl 0818.68073
Diekert, Volker; Gastin, Paul; Petit, Antoine
6
1995
On confluence of one-rule trace-rewriting systems. Zbl 0837.68055
Wrathall, C.; Diekert, V.
6
1995
On codings of traces. Zbl 1379.68243
Diekert, Volker; Muscholl, Anca; Reinhardt, Klaus
5
1995
A domain for concurrent termination a generalization of Mazurkiewicz traces (extended abstract). Zbl 1412.68150
Diekert, Volker; Gastin, Paul
2
1995
Deterministic asynchronous automata for infinite traces. Zbl 0818.68100
Diekert, Volker; Muscholl, Anca
7
1994
A partial trace semantics for Petri nets. Zbl 0823.68058
Diekert, V.
5
1994
Partial traces. Zbl 0875.68719
Diekert, Volker
1
1994
On confluent semi-commutations: Decidability and complexity results. Zbl 0804.68075
Diekert, Volker; Ochmański, Edward; Reinhardt, Klaus
1
1994
On the concatenation of infinite traces. Zbl 0786.68074
Diekert, Volker
6
1993
...and 24 more Documents
all top 5

Cited by 551 Authors

52 Diekert, Volker
27 Gastin, Paul
19 Myasnikov, Alexei G.
17 Lohrey, Markus
16 Kufleitner, Manfred
14 Droste, Manfred
12 Kuske, Dietrich
11 Elder, Murray J.
11 Muscholl, Anca
11 Weiß, Armin
9 Abbes, Samy
8 Manea, Florin
8 Otto, Friedrich
8 Silva, Pedro V.
7 Ciobanu, Laura
7 Kharlampovich, Olga G.
7 Petit, Antoine C.
6 Bérard, Béatrice
6 Hoffmann, Stefan
6 Nowotka, Dirk
6 Place, Thomas
6 Sénizergues, Géraud
6 Steinberg, Benjamin
6 Weil, Pascal
6 Zeitoun, Marc
5 Bollig, Benedikt
5 Kopecki, Steffen
5 Schnoebelen, Philippe
5 Walter, Tobias
4 Adsul, Bharat
4 Day, Joel D.
4 Gray, Robert D.
4 Hertrampf, Ulrich
4 Kazachkov, Ilya V.
4 Mairesse, Jean
4 Pandya, Paritosh K.
4 Peled, Doron A.
4 Piggott, Adam
4 Sarkar, Saptarshi
4 Thomas, Richard M.
4 Vassileva, Svetla
3 Angluin, Dana
3 Bouyer, Patricia
3 Bruyère, Véronique
3 Cain, Alan J.
3 Casals-Ruiz, Montserrat
3 Duncan, Andrew J.
3 Fisman, Dana
3 Freydenberger, Dominik D.
3 Gilman, Robert H.
3 Goldwurm, Massimiliano
3 Haddad, Serge
3 Holt, Derek F.
3 Jeż, Artur
3 Kahl, Thomas
3 Kobayashi, Yuji
3 Lange, Martin
3 Lanotte, Ruggero
3 Lauser, Alexander
3 Levine, Alex J.
3 Lysenok, Igor’ Geront’evich
3 Madlener, Klaus E.
3 Nyberg-Brodda, Carl-Fredrik
3 Plandowski, Wojciech
3 Rahonis, George
3 Schmid, Markus L.
3 Selivanov, Viktor L’vovich
3 Wolf, Petra
3 Zakharov, Alexander
3 Zetzsche, Georg
2 Agrawal, Pranay
2 Aichernig, Bernhard K.
2 Alecu, Bogdan
2 Almeida, Jorge
2 Austinat, Holger
2 Boker, Udi
2 Bracho, Felipe
2 Brihaye, Thomas
2 Carvalho, Andre
2 Chaturvedi, Namit
2 Chebotarev, Anatoli N.
2 Clemente, Lorenzo
2 Crespi Reghizzi, Stefano
2 Dahmani, François
2 Dufourd, Catherine
2 Durnev, Valeriĭ Georgievich
2 Ebinger, Werner
2 Evetts, Alex
2 Fahrenberg, Uli
2 Finkel, Alain
2 Fortin, Marie-Josée
2 Foryś, Wit
2 Freivalds, Rūsiņš Mārtiņš
2 Garreta, Albert
2 Gelderie, Marcus
2 Giscard, Pierre-Louis
2 Guaiana, Giovanna
2 Harju, Tero
2 Hélouët, Loïc
2 Henriksson, Viktor
...and 451 more Authors
all top 5

Cited in 88 Serials

77 Theoretical Computer Science
27 Information and Computation
23 International Journal of Algebra and Computation
20 Journal of Algebra
13 Journal of Computer and System Sciences
13 Theory of Computing Systems
13 Logical Methods in Computer Science
12 Acta Informatica
11 Formal Methods in System Design
10 Information Processing Letters
9 International Journal of Foundations of Computer Science
7 Discrete Mathematics
7 Semigroup Forum
6 Groups, Complexity, Cryptology
5 Mathematical Systems Theory
4 Transactions of the American Mathematical Society
4 Algorithmica
3 Israel Journal of Mathematics
3 Journal of Pure and Applied Algebra
3 Real-Time Systems
3 RAIRO. Informatique Théorique et Applications
3 Cybernetics and Systems Analysis
3 Journal of Group Theory
3 Fundamenta Informaticae
3 Journal of the Australian Mathematical Society
3 RAIRO. Theoretical Informatics and Applications
2 Applied Mathematics and Computation
2 Journal of Combinatorial Theory. Series A
2 Combinatorica
2 Journal of Symbolic Computation
2 Journal of Complexity
2 SIAM Journal on Discrete Mathematics
2 Formal Aspects of Computing
2 Journal of Logic, Language and Information
2 Journal of Mathematical Sciences (New York)
2 Discrete Mathematics and Theoretical Computer Science. DMTCS
2 Journal of Algebra and its Applications
2 Bulletin of Mathematical Sciences
2 Journal of Logical and Algebraic Methods in Programming
1 ACM Computing Surveys
1 Communications in Algebra
1 Discrete Applied Mathematics
1 Journal of Statistical Physics
1 Mathematics of Computation
1 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
1 Algebra and Logic
1 Bulletin of the London Mathematical Society
1 Publications Mathématiques
1 Journal of Graph Theory
1 The Journal of Symbolic Logic
1 Manuscripta Mathematica
1 Mathematische Annalen
1 Mathematische Nachrichten
1 Memoirs of the American Mathematical Society
1 Proceedings of the American Mathematical Society
1 Advances in Applied Mathematics
1 Ergodic Theory and Dynamical Systems
1 Annals of Pure and Applied Logic
1 Discrete & Computational Geometry
1 Journal of Theoretical Probability
1 Publicacions Matemàtiques
1 Forum Mathematicum
1 MSCS. Mathematical Structures in Computer Science
1 Discrete Event Dynamic Systems
1 Distributed Computing
1 Computational Complexity
1 Journal of Applied Non-Classical Logics
1 Journal of the Egyptian Mathematical Society
1 The Electronic Journal of Combinatorics
1 Selecta Mathematica. New Series
1 Izvestiya: Mathematics
1 Geometry & Topology
1 Journal of Graph Algorithms and Applications
1 Communications in Contemporary Mathematics
1 Algebraic & Geometric Topology
1 Comptes Rendus. Mathématique. Académie des Sciences, Paris
1 ACM Transactions on Computational Logic
1 Journal of Applied Logic
1 Parallel Processing Letters
1 Proceedings of the Steklov Institute of Mathematics
1 Groups, Geometry, and Dynamics
1 Journal of Topology and Analysis
1 Computer Science Review
1 Carpathian Mathematical Publications
1 ISRN Combinatorics
1 Annales de l’Institut Henri Poincaré D. Combinatorics, Physics and their Interactions
1 Categories and General Algebraic Structures with Applications
1 Prikladnaya Diskretnaya Matematika

Citations by Year