Volker Diekert

From MaRDI portal
Revision as of 23:13, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:213104

Available identifiers

zbMath Open diekert.volkerDBLPd/VolkerDiekertWikidataQ102165123 ScholiaQ102165123MaRDI QIDQ213104

List of research outcomes





PublicationDate of PublicationType
Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices2024-12-12Paper
Elements of Discrete Mathematics2023-11-07Paper
Reachability games and parity games2023-07-28Paper
Removing ε-transitions in timed automata2022-11-09Paper
Properties of graphs specified by a regular language2022-08-30Paper
Word problems over traces which are solvable in linear time2022-08-16Paper
Properties of graphs specified by a regular language2022-03-25Paper
https://portal.mardi4nfdi.de/entity/Q50284832022-02-09Paper
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices2021-01-22Paper
Solutions to twisted word equations and equations in virtually free groups2020-07-24Paper
Context-Free Groups and Bass–Serre Theory2020-07-13Paper
https://portal.mardi4nfdi.de/entity/Q51114282020-05-27Paper
A domain for concurrent termination a generalization of Mazurkiewicz traces2019-01-10Paper
Regular Languages Are Church-Rosser Congruential2018-08-02Paper
Solving trace equations using lexicographical normal forms2018-07-04Paper
https://portal.mardi4nfdi.de/entity/Q45982692017-12-19Paper
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay2017-12-19Paper
On codings of traces2017-12-04Paper
Trace rewriting: Computing normal forms in time O(n log n)2017-11-16Paper
Church-Rosser systems, codes with bounded synchronization delay and local Rees extensions2017-11-15Paper
Characterizing classes of regular languages using prefix codes of bounded synchronization delay2017-11-03Paper
Equations over free inverse monoids with idempotent variables2017-10-20Paper
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem2017-06-01Paper
QuickHeapsort: modifications and improved analysis2017-01-18Paper
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits2016-12-21Paper
Finding all solutions of equations in free groups and monoids with involution2016-11-18Paper
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem2016-09-29Paper
Solution sets for equations over free groups are EDT0L languages2016-09-23Paper
Asymptotic Approximation for the Quotient Complexities of Atoms2016-05-03Paper
Discrete algebraic methods. Arithmetic, cryptography, automata and groups2016-04-05Paper
A Note on Monitors and Büchi Automata2016-02-25Paper
Logspace computations in graph products2016-02-11Paper
A survey on the local divisor technique2015-12-10Paper
Logspace computations in graph products2015-11-11Paper
Solution Sets for Equations over Free Groups are EDT0L Languages2015-11-04Paper
Equations over free inverse monoids with idempotent variables2015-10-20Paper
More Than 1700 Years of Word Equations2015-09-22Paper
Omega-rational expressions with bounded synchronization delay2015-07-20Paper
SLP compression for solutions of equations with constraints in free and hyperbolic groups2015-04-21Paper
Solution sets for equations over free groups are EDT0L languages -- ICALP 2015 version2015-02-11Paper
Finding All Solutions of Equations in Free Groups and Monoids with Involution2014-06-24Paper
Topology, monitorable properties and runtime verification2014-06-10Paper
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits2014-03-31Paper
Cyclic rewriting and conjugacy problems2014-01-30Paper
Logspace Computations in Coxeter Groups and Graph Groups2014-01-03Paper
Elemente der diskreten Mathematik2013-07-23Paper
Diskrete algebraische Methoden2013-07-23Paper
QuickHeapsort: modifications and improved analysis2013-06-14Paper
CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES2013-06-05Paper
EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P2013-01-30Paper
GROUP EXTENSIONS OVER INFINITE WORDS2013-01-18Paper
Regular Languages Are Church-Rosser Congruential2012-11-01Paper
Deciding regularity of hairpin completions of regular languages in polynomial time2012-10-11Paper
Star-free languages are Church-Rosser congruential2012-10-11Paper
On Distributed Monitoring of Asynchronous Systems2012-09-21Paper
Bounded Synchronization Delay in Omega-Rational Expressions2012-09-10Paper
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P2012-08-23Paper
Logspace Computations in Graph Groups and Coxeter Groups2012-06-29Paper
The Krohn-Rhodes Theorem and Local Divisors2012-06-20Paper
Language theoretical properties of hairpin formations2012-05-30Paper
Fragments of First-Order Logic over Infinite Words.2012-04-24Paper
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR2012-03-13Paper
Solving Word Problems in Group Extensions over Infinite Words2011-07-29Paper
Fragments of first-order logic over infinite words2011-05-23Paper
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets2011-05-06Paper
ON COMPUTING GEODESICS IN BAUMSLAG–SOLITAR GROUPS2011-05-03Paper
https://portal.mardi4nfdi.de/entity/Q30869252011-03-30Paper
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)2011-02-11Paper
Geodesic rewriting systems and pregroups2010-09-14Paper
Weinbaum factorizations of primitive words2010-02-05Paper
On the Hairpin Completion of Regular Languages2009-08-20Paper
Some remarks about stabilizers2009-08-07Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
https://portal.mardi4nfdi.de/entity/Q51907762009-07-27Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Partially commutative inverse monoids.2008-12-02Paper
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS2008-11-24Paper
WORD EQUATIONS OVER GRAPH PRODUCTS2008-08-26Paper
https://portal.mardi4nfdi.de/entity/Q35043352008-06-11Paper
ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS2008-05-20Paper
https://portal.mardi4nfdi.de/entity/Q54319102008-01-02Paper
On First-Order Fragments for Words and Mazurkiewicz Traces2007-11-28Paper
Partially Commutative Inverse Monoids2007-09-05Paper
SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE2007-03-21Paper
Pure future local temporal logics are expressively complete for Mazurkiewicz traces2007-01-22Paper
https://portal.mardi4nfdi.de/entity/Q54859742006-09-06Paper
From local to global temporal logics over Mazurkiewicz traces.2006-05-18Paper
The existential theory of equations with rational constraints in free groups is PSPACE-complete2005-11-22Paper
Local temporal logic is expressively complete for cograph dependence alphabets2005-02-22Paper
Regular frequency computations2005-02-22Paper
Existential and positive theories of equations in graph products2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q47368662004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47382862004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44120992003-07-13Paper
A structural property of regular frequency computations.2003-01-22Paper
A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS2002-12-15Paper
LTL is expressively complete for Mazurkiewicz traces2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45350462002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q27625032002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27541452001-11-11Paper
Combinatorial rewriting on traces2001-11-08Paper
Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids2001-11-07Paper
https://portal.mardi4nfdi.de/entity/Q27426002001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q49452252000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q49411712000-02-29Paper
Solving word equations modulo partial commutations2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42641031999-09-16Paper
https://portal.mardi4nfdi.de/entity/Q42510531999-06-17Paper
Approximating traces1999-01-11Paper
https://portal.mardi4nfdi.de/entity/Q44215821999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43801571998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q43758011998-02-08Paper
https://portal.mardi4nfdi.de/entity/Q43710251998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q43480061997-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43479571997-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48746531996-08-13Paper
Rational and recognizable complex trace languages1995-04-10Paper
A partial trace semantics for Petri nets1995-01-09Paper
Deterministic asynchronous automata for infinite traces1994-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42842251994-08-31Paper
On confluent semi-commutations: Decidability and complexity results1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42815641994-03-10Paper
Möbius functions and confluent semi-commutations1993-12-20Paper
On the concatenation of infinite traces1993-10-17Paper
https://portal.mardi4nfdi.de/entity/Q40352341993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40356611993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40365661993-05-18Paper
Combinatorics on traces1993-01-23Paper
On ``inherently context-sensitive languages -- an application of complexity cores1992-06-28Paper
Word problems over traces which are solvable in linear time1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552391990-01-01Paper
On the synchronization of traces1989-01-01Paper
On the Knuth-Bendix completion for concurrent processes1989-01-01Paper
Hotz-isomorphism theorems in formal language theory1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34894621988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37875081988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37982131988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37715971987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37757151987-01-01Paper
Eine Bemerkung zu freien Moduln über regulären lokalen Ringen. (Remark on free modules over regular local rings)1986-01-01Paper
Commutative monoids have complete presentations by free (non-commutative) monoids1986-01-01Paper
Complete semi-Thue systems for abelian groups1986-01-01Paper
Investigations on Hotz groups for arbitrary grammars1986-01-01Paper
On some variants of the Ehrenfeucht conjecture1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37008521985-01-01Paper
Über die absolute Galoisgruppe dyadischer Zahlkörper.1984-01-01Paper
Demuškin-Erzeugende und Einbettungsprobleme für elementar-abelsche 2-Erweiterungen zwei-adischer Zahlkörper1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204891983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39446921982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38907971981-01-01Paper

Research outcomes over time

This page was built for person: Volker Diekert