Henrik Björklund

Int. J. Found. Comput. Sci., 2024

2023

Transduction from trees to graphs through folding.

[BibT_eX]

[DOI]

Inf. Comput., December, 2023

Parsing Unranked Tree Languages, Folded Once.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Theories of "Gender" in NLP Bias Research.

[BibT_eX]

[DOI]

Hannah Devinney

Jenny Björklund

Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

2021

Uniform parsing for hyperedge replacement grammars.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Learning algorithms.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2018

Conjunctive query containment over trees using schema information.

[BibT_eX]

[DOI]

Acta Informatica, 2018

2017

On the Regularity and Learnability of Ordered DAG Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2017

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages.

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017

Predicting User Competence from Linguistic Data.

[BibT_eX]

[DOI]

Yonas Demeke Woldemariam

Suna Bensch

Proceedings of the 14th International Conference on Natural Language Processing, 2017

2016

Uniform <i>vs.</i> Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey.

[BibT_eX]

[DOI]

Algorithms, 2016

Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Efficient Incremental Evaluation of Succinct Regular Expressions.

[BibT_eX]

[DOI]

Thomas Timm

Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014

Compression of finite-state automata through failure transitions.

[BibT_eX]

[DOI]

Niklas Zechner

Theor. Comput. Sci., 2014

2013

Shuffled languages - Representation and recognition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A note on the complexity of deterministic tree-walking transducers.

[BibT_eX]

Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

On the Parameterized Complexity of Linear Context-Free Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 13th Meeting on the Mathematics of Language, 2013

Validity of Tree Pattern Queries with Respect to Schema Information.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On optimum left-to-right strategies for active context-free games.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Cuts in Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

The tractability frontier for NFA minimization.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

2011

Conjunctive query containment over trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Recognizing Shuffled Languages.

[BibT_eX]

[DOI]

Johanna Högberg

Proceedings of the Language and Automata Theory and Applications, 2011

2010

Incremental XPath evaluation.

[BibT_eX]

[DOI]

Wouter Gelade

ACM Trans. Database Syst., 2010

On notions of regularity for data languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Logik und Automaten: ein echtes Dreamteam.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Algorithmic Properties of Millstream Systems.

[BibT_eX]

[DOI]

Suna Bensch

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Volker Weber.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2009

Incremental XPath evaluation.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2009

2008

Optimizing Conjunctive Queries over Trees Using Schema Information.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Shuffle Expressions and Words with Nested Data.

[BibT_eX]

[DOI]

Mikolaj Bojanczyk

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Bounded Depth Data Trees.

[BibT_eX]

[DOI]

Mikolaj Bojanczyk

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2005

Combinatorial Optimization for Infinite Games on Graphs.

[BibT_eX]

[DOI]

PhD thesis, 2005

Combinatorial structure and randomized subexponential algorithms for infinite games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

Memoryless determinacy of parity and mean payoff games: a simple proof.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

State Verification.

[BibT_eX]

[DOI]

Proceedings of the Model-Based Testing of Reactive Systems, 2004

2003

A Discrete Subexponential Algorithm for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework.

[BibT_eX]

[DOI]