The following pages link to Volker Diekert (Q213104):
Displaying 50 items.
- Discrete algebraic methods. Arithmetic, cryptography, automata and groups (Q263829) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Language theoretical properties of hairpin formations (Q418760) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- On the concatenation of infinite traces (Q685439) (← links)
- Möbius functions and confluent semi-commutations (Q685454) (← links)
- Existential and positive theories of equations in graph products (Q705067) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Star-free languages are Church-Rosser congruential (Q714818) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Demuškin-Erzeugende und Einbettungsprobleme für elementar-abelsche 2-Erweiterungen zwei-adischer Zahlkörper (Q788049) (← links)
- Weinbaum factorizations of primitive words (Q845079) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- A survey on the local divisor technique (Q896673) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Eine Bemerkung zu freien Moduln über regulären lokalen Ringen. (Remark on free modules over regular local rings) (Q1084455) (← links)
- Commutative monoids have complete presentations by free (non-commutative) monoids (Q1085284) (← links)
- Complete semi-Thue systems for abelian groups (Q1087012) (← links)
- Investigations on Hotz groups for arbitrary grammars (Q1088413) (← links)
- On ``inherently context-sensitive'' languages -- an application of complexity cores (Q1183427) (← links)
- Combinatorics on traces (Q1188891) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- Approximating traces (Q1270563) (← links)
- On confluent semi-commutations: Decidability and complexity results (Q1322470) (← links)
- Deterministic asynchronous automata for infinite traces (Q1338892) (← links)
- A partial trace semantics for Petri nets (Q1341743) (← links)
- Rational and recognizable complex trace languages (Q1346721) (← links)
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- Church-Rosser systems, codes with bounded synchronization delay and local Rees extensions (Q1678332) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Regular frequency computations (Q1763697) (← links)
- On some variants of the Ehrenfeucht conjecture (Q1822520) (← links)
- A structural property of regular frequency computations. (Q1853730) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- Some remarks about stabilizers (Q2271432) (← links)
- Omega-rational expressions with bounded synchronization delay (Q2354594) (← links)
- Equations over free inverse monoids with idempotent variables (Q2411041) (← links)
- Topology, monitorable properties and runtime verification (Q2453532) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315) (← links)
- (Q2742600) (← links)
- (Q2754145) (← links)
- (Q2762503) (← links)
- A Note on Monitors and Büchi Automata (Q2787415) (← links)
- Asymptotic Approximation for the Quotient Complexities of Atoms (Q2803051) (← links)
- Solution sets for equations over free groups are EDT0L languages (Q2821818) (← links)
- Elemente der diskreten Mathematik (Q2840672) (← links)
