Martin Berglund

According to our database, Martin Berglund authored at least 28 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Constructing a BPE Tokenization DFA.

Martin Berglund, Willeke Martens, Brink van der Merwe

CoRR, 2024

2023

Transduction from trees to graphs through folding.

Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret

Inf. Comput., December, 2023

Re-examining regular expressions with backreferences.

Martin Berglund, Brink van der Merwe

Theor. Comput. Sci., 2023

Formalizing BPE Tokenization.

Martin Berglund, Brink van der Merwe

Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

Parsing Unranked Tree Languages, Folded Once.

Martin Berglund, Henrik Björklund, Johanna Björklund

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

2022

Ordered Context-Free Grammars.

Brink van der Merwe, Martin Berglund

Proceedings of the Implementation and Application of Automata, 2022

2021

Formalising and implementing Boost POSIX regular expression matching.

Martin Berglund, Willem Bester, Brink van der Merwe

Theor. Comput. Sci., 2021

Regular Expressions with Lookahead.

Martin Berglund, Brink van der Merwe, Steyn van Litsenborgh

J. Univers. Comput. Sci., 2021

Memoized Regular Expressions.

Brink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund

Proceedings of the Implementation and Application of Automata, 2021

2018

The Output Size Problem for String-to-Tree Transducers.

Martin Berglund, Frank Drewes, Brink van der Merwe

J. Autom. Lang. Comb., 2018

On regular expressions with backreferences and transducers.

Martin Berglund, Frank Drewes, Brink van der Merwe

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

An Automata-Based View on Configurability and Uncertainty.

Martin Berglund, Ina Schaefer

Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

Formalising Boost POSIX Regular Expression Matching.

Martin Berglund, Willem Bester, Brink van der Merwe

Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017

On the semantics of regular expression parsing in the wild.

Martin Berglund, Brink van der Merwe

Theor. Comput. Sci., 2017

On the Semantics of Atomic Subgroups in Practical Regular Expressions.

Martin Berglund, Brink van der Merwe, Bruce W. Watson, Nicolaas Weideman

Proceedings of the Implementation and Application of Automata, 2017

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

Martin Berglund, Henrik Björklund, Frank Drewes

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

Regular Expressions with Backreferences Re-examined.

Martin Berglund, Brink van der Merwe

Proceedings of the Prague Stringology Conference 2017, 2017

Turning evil regexes harmless.

Brink van der Merwe, Nicolaas Weideman, Martin Berglund

Proceedings of the South African Institute of Computer Scientists and Information Technologists, 2017

2016

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

Henrik Björklund, Martin Berglund, Petter Ericson

Algorithms, 2016

Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.

Nicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce W. Watson

Proceedings of the Implementation and Application of Automata, 2016

2014

Complexities of Order-Related Formal Language Extensions.

Martin Berglund

PhD thesis, 2014

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching.

Martin Berglund, Frank Drewes, Brink van der Merwe

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

2013

Shuffled languages - Representation and recognition.

Martin Berglund, Henrik Björklund, Johanna Björklund

Theor. Comput. Sci., 2013

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

Martin Berglund, Henrik Björklund, Frank Drewes

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

Cuts in Regular Expressions.

Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson

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

2011

Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable.

Martin Berglund

Proceedings of the Prague Stringology Conference 2011, 2011

Recognizing Shuffled Languages.

Martin Berglund, Henrik Björklund, Johanna Högberg

Proceedings of the Language and Automata Theory and Applications, 2011

2010

On the Complexity of Variants of the <i>k</i> Best Strings Problem.

Martin Berglund, Frank Drewes

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010