The following pages link to Markus L. Schmid (Q315523):
Displayed 50 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Contextual array grammars and array P systems (Q499706) (← links)
- On matching generalised repetitive patterns (Q1622969) (← links)
- Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Matching patterns with variables (Q2333028) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Characterising REGEX languages by regular languages equipped with factor-referencing (Q2629848) (← links)
- Computing equality-free and repetitive string factorisations (Q2634669) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- Scanning Pictures the Boustrophedon Way (Q2794637) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- Finding shuffle words that represent optimal scheduling of shared memory access (Q2855755) (← links)
- Patterns with Bounded Treewidth (Q2890220) (← links)
- Automata with Modulo Counters and Nondeterministic Counter Bounds (Q2914726) (← links)
- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing (Q2921979) (← links)
- Closure Properties of Pattern Languages (Q2921992) (← links)
- Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- (Q2955004) (← links)
- (Q2963897) (← links)
- Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access (Q3004605) (← links)
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
- Inside the Class of REGEX Languages (Q3167485) (← links)
- Regular and Context-Free Pattern Languages over Small Alphabets (Q3167490) (← links)
- Computing Equality-Free String Factorisations (Q3195710) (← links)
- Mirages, anti-mirages, and further surprises in quantum corrals with non-magnetic impurities (Q4452488) (← links)
- On the Complexity of Grammar-Based Compression over Fixed Alphabets (Q4598264) (← links)
- (Q4636631) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- Pattern Matching with Variables: A Multivariate Complexity Analysis (Q4928563) (← links)
- Finding Consensus Strings with Small Length Difference between Input and Solution Strings (Q4973890) (← links)
- (Q5005095) (← links)
- Pattern Matching with Variables (Q5053058) (← links)
- (Q5091271) (← links)
- (Q5111244) (← links)
- Array Insertion and Deletion P Systems (Q5300911) (← links)
- (Q5416362) (← links)
- INSIDE THE CLASS OF REGEX LANGUAGES (Q5495423) (← links)
- Mirage phenomena in superconducting quantum corrals (Q5695850) (← links)
- Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)