Martin Berglund

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 21

Top Topics

Semistructured Data

Regular Expressions

Pattern Matching

Deterministic Finite Automata

Top Venues

Theor. Comput. Sci.

Publications

Martin Berglund, Willeke Martens, Brink van der Merwe
Constructing a BPE Tokenization DFA. CoRR (2024)
Martin Berglund, Henrik Björklund, Johanna Björklund
Parsing Unranked Tree Languages, Folded Once. Algorithms 17 (6) (2024)
Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret
Transduction from trees to graphs through folding. Inf. Comput. 295 (Part B) (2023)
Martin Berglund, Henrik Björklund, Johanna Björklund
Parsing Unranked Tree Languages, Folded Once. FCT (2023)
Martin Berglund, Brink van der Merwe
Re-examining regular expressions with backreferences. Theor. Comput. Sci. 940 (Part) (2023)
Martin Berglund, Brink van der Merwe
Formalizing BPE Tokenization. NCMA (2023)
Brink van der Merwe, Martin Berglund
Ordered Context-Free Grammars. CIAA (2022)
Martin Berglund, Willem Bester, Brink van der Merwe
Formalising and implementing Boost POSIX regular expression matching. Theor. Comput. Sci. 857 (2021)
Martin Berglund, Brink van der Merwe, Steyn van Litsenborgh
Regular Expressions with Lookahead. J. Univers. Comput. Sci. 27 (1) (2021)
Brink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund
Memoized Regular Expressions. CIAA (2021)
Martin Berglund, Frank Drewes, Brink van der Merwe
On regular expressions with backreferences and transducers. NCMA (2018)
Martin Berglund, Frank Drewes, Brink van der Merwe
The Output Size Problem for String-to-Tree Transducers. J. Autom. Lang. Comb. 23 (1-3) (2018)
Martin Berglund, Ina Schaefer
An Automata-Based View on Configurability and Uncertainty. ICTAC (2018)
Martin Berglund, Willem Bester, Brink van der Merwe
Formalising Boost POSIX Regular Expression Matching. ICTAC (2018)
Martin Berglund, Brink van der Merwe
Regular Expressions with Backreferences Re-examined. Stringology (2017)
Brink van der Merwe, Nicolaas Weideman, Martin Berglund
Turning evil regexes harmless. SAICSIT (2017)
Martin Berglund, Brink van der Merwe, Bruce W. Watson, Nicolaas Weideman
On the Semantics of Atomic Subgroups in Practical Regular Expressions. CIAA (2017)
Martin Berglund, Brink van der Merwe
On the semantics of regular expression parsing in the wild. Theor. Comput. Sci. 679 (2017)
Martin Berglund, Henrik Björklund, Frank Drewes
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. TAG (2017)
Nicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce W. Watson
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA. CIAA (2016)
Henrik Björklund, Martin Berglund, Petter Ericson
Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey. Algorithms 9 (2) (2016)
Martin Berglund, Brink van der Merwe
On the Semantics of Regular Expression Parsing in the Wild. CIAA (2015)
Martin Berglund, Frank Drewes, Brink van der Merwe
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. AFL (2014)
Martin Berglund, Henrik Björklund, Frank Drewes
On the Parameterized Complexity of Linear Context-Free Rewriting Systems. MOL (2013)
Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson
Cuts in Regular Expressions. Developments in Language Theory (2013)
Martin Berglund, Henrik Björklund, Johanna Björklund
Shuffled languages - Representation and recognition. Theor. Comput. Sci. (2013)
Martin Berglund
Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable. Stringology (2011)
Martin Berglund, Henrik Björklund, Johanna Högberg
Recognizing Shuffled Languages. LATA (2011)
Martin Berglund, Frank Drewes
Best Strings Problem. Stringology (2010)