Till umu.se

Henrik Björklund

Publikationer

Författare

Titel

År sorteringsordning

Fulltext

Björklund, Henrik
Björklund, Johanna
Petter, Ericson

On the Regularity and Learnability of Ordered DAG Languages
Implementation and Application of Automata: 27-39

2017

-

Berglund, Martin
Björklund, Henrik
Drewes, Frank

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages
13th International Workshop on Tree-Adjoining Grammar and Related Formalisms (TAG+13)

2017

-

Björklund, Henrik
Berglund, Martin
Petter, Ericson

Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
Algorithms, 9(2)

2016

Hämta

Björklund, Henrik
Drewes, Frank
Ericson, Petter

Between a Rock and a Hard Place: Parsing for Hyperege Replacement DAG Grammars
Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016): 521-532

2016

-

Björklund, Henrik
Martens, Wim
Timm, Thomas

Efficient incremental evaluation of succinct regular expressions
Proceedings of the 24th ACM International on Conference on Information and Knowledge Management: 1541-1550

2015

-

Björklund, Henrik
Björklund, Johanna
Zechner, Niklas

Compression of finite-state automata through failure transitions
Theoretical Computer Science, 557: 87-100

2014

-

Berglund, Martin

Characterizing Non-Regularity

2014

-

Björklund, Henrik
Schuster, Martin
Schwentick, Thomas; et al.

On optimum left-to-right strategies for active context-free games
ICDT '13 Proceedings of the 16th International Conference on Database Theory: 105-116

2013

-

Berglund, Martin
Björklund, Henrik
Drewes, Frank

On the Parameterized Complexity of Linear Context-Free Rewriting Systems
Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13): 21-29

2013

-

Björklund, Henrik
Martens, Wim
Schwentick, Thomas

Validity of Tree Pattern Queries with Respect to Schema Information
Mathematical Foundations of Computer Science 2013: 171-182

2013

-


Sidansvarig: Åsa Nordström

Utskriftsversion