The following pages link to Henrik Björklund (Q300255):
Displayed 32 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Conjunctive query containment over trees (Q532363) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- (Q1047802) (redirect page) (← links)
- Volker Weber (Q1047803) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
- Learning algorithms (Q2074213) (← links)
- On the regularity and learnability of ordered DAG languages (Q2399247) (← links)
- Uniform parsing for hyperedge replacement grammars (Q2656168) (← links)
- Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars (Q2798746) (← links)
- Validity of Tree Pattern Queries with Respect to Schema Information (Q2849907) (← links)
- Recognizing Shuffled Languages (Q3004574) (← links)
- The Tractability Frontier for NFA Minimization (Q3520301) (← links)
- Shuffle Expressions and Words with Nested Data (Q3525617) (← links)
- Algorithmic Properties of Millstream Systems (Q3584881) (← links)
- Optimizing Conjunctive Queries over Trees Using Schema Information (Q3599121) (← links)
- (Q4418690) (← links)
- (Q4599177) (← links)
- (Q5094884) (← links)
- Cuts in Regular Expressions (Q5300830) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311140) (← links)
- Bounded Depth Data Trees (Q5428865) (← links)
- On Notions of Regularity for Data Languages (Q5444950) (← links)
- Perspectives of System Informatics (Q5902424) (← links)
- Transduction from trees to graphs through folding (Q6145530) (← links)
- Tree-Based Generation of Restricted Graph Languages (Q6195089) (← links)