The following pages link to Markus Lohrey (Q269346):
Displaying 50 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Submonoids and rational subsets of groups with infinitely many ends. (Q606649) (← links)
- Tilings and submonoids of metabelian groups. (Q633769) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Existential and positive theories of equations in graph products (Q705067) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Sliding window algorithms for regular languages (Q1647673) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- The isomorphism problem for \(\omega \)-automatic trees (Q1759366) (← links)
- Decidable first-order theories of one-step rewriting in trace monoids (Q1764424) (← links)
- The smallest grammar problem revisited (Q1796825) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- Bounded MSC communication (Q1881218) (← links)
- Realizability of high-level message sequence charts: closing the gaps (Q1884911) (← links)
- Isomorphism of regular trees and words (Q1951601) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Closure properties of knapsack semilinear groups (Q2236107) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints (Q2411048) (← links)
- Size-optimal top dag compression (Q2414042) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Axiomatising divergence (Q2581532) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- (Q2723899) (← links)
- (Q2778879) (← links)
- Satisfiability of CTL* with Constraints (Q2842126) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Branching-Time Model Checking of One-Counter Processes and Timed Automata (Q2848205) (← links)
- Logspace Computations in Coxeter Groups and Graph Groups (Q2869260) (← links)
- Algorithmics on SLP-compressed strings: A survey (Q2874365) (← links)
- Logspace Computations in Graph Groups and Coxeter Groups (Q2894469) (← links)
- The First-Order Theory of Ground Tree Rewrite Graphs (Q2911631) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- (Q2958378) (← links)
- (Q2965507) (← links)
