Martin Berglund

32 papers B 1C 11Misc 3Journal 10Unranked 6
YearRankTypeTitle / Venue / Authors
2025 C conf
Constructing Compact BPE Token DFAs.
CIAA
Martin Berglund, Anna Jonsson, Willeke Martens, Brink van der Merwe
2024 C conf
Constructing a BPE Tokenization DFA.
CIAA
Martin Berglund, Willeke Martens, Brink van der Merwe
2024 J jnl
Constructing a BPE Tokenization DFA.
CoRR
Martin Berglund, Willeke Martens, Brink van der Merwe
2024 J jnl
Parsing Unranked Tree Languages, Folded Once.
Algorithms
Martin Berglund, Henrik Björklund, Johanna Björklund
2023 — conf
Formalizing BPE Tokenization.
NCMA
Martin Berglund, Brink van der Merwe
2023 B conf
Parsing Unranked Tree Languages, Folded Once.
FCT
Martin Berglund, Henrik Björklund, Johanna Björklund
2023 J jnl
Re-examining regular expressions with backreferences.
Theor. Comput. Sci.
Martin Berglund, Brink van der Merwe
2023 J jnl
Transduction from trees to graphs through folding.
Inf. Comput.
Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret
2022 C conf
Ordered Context-Free Grammars.
CIAA
Brink van der Merwe, Martin Berglund
2021 J jnl
Formalising and implementing Boost POSIX regular expression matching.
Theor. Comput. Sci.
Martin Berglund, Willem Bester, Brink van der Merwe
2021 C conf
Memoized Regular Expressions.
CIAA
Brink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund
2021 J jnl
Regular Expressions with Lookahead.
J. Univers. Comput. Sci.
Martin Berglund, Brink van der Merwe, Steyn van Litsenborgh
2018 C conf
An Automata-Based View on Configurability and Uncertainty.
ICTAC
Martin Berglund, Ina Schaefer
2018 C conf
Formalising Boost POSIX Regular Expression Matching.
ICTAC
Martin Berglund, Willem Bester, Brink van der Merwe
2018 — conf
On regular expressions with backreferences and transducers.
NCMA
Martin Berglund, Frank Drewes, Brink van der Merwe
2018 J jnl
The Output Size Problem for String-to-Tree Transducers.
J. Autom. Lang. Comb.
Martin Berglund, Frank Drewes, Brink van der Merwe
2017 C conf
On the Semantics of Atomic Subgroups in Practical Regular Expressions.
CIAA
Martin Berglund, Brink van der Merwe, Bruce W. Watson, Nicolaas Weideman
2017 J jnl
On the semantics of regular expression parsing in the wild.
Theor. Comput. Sci.
Martin Berglund, Brink van der Merwe
2017 Misc conf
Regular Expressions with Backreferences Re-examined.
PSC
Martin Berglund, Brink van der Merwe
2017 — conf
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages.
TAG
Martin Berglund, Henrik Björklund, Frank Drewes
2017 — conf
Turning evil regexes harmless.
SAICSIT
Brink van der Merwe, Nicolaas Weideman, Martin Berglund
2016 C conf
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.
CIAA
Nicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce W. Watson
2016 J jnl
Uniform
Algorithms
Henrik Björklund, Martin Berglund, Petter Ericson
2015 C conf
On the Semantics of Regular Expression Parsing in the Wild.
CIAA
Martin Berglund, Brink van der Merwe
2014 — conf
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching.
AFL
Martin Berglund, Frank Drewes, Brink van der Merwe
2014 — —
Complexities of Order-Related Formal Language Extensions.
Martin Berglund
2013 C conf
Cuts in Regular Expressions.
Developments in Language Theory
Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson
2013 — conf
On the Parameterized Complexity of Linear Context-Free Rewriting Systems.
MOL
Martin Berglund, Henrik Björklund, Frank Drewes
2013 J jnl
Shuffled languages - Representation and recognition.
Theor. Comput. Sci.
Martin Berglund, Henrik Björklund, Johanna Björklund
2011 Misc conf
Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable.
PSC
Martin Berglund
2011 C conf
Recognizing Shuffled Languages.
LATA
Martin Berglund, Henrik Björklund, Johanna Högberg
2010 Misc conf
On the Complexity of Variants of the
PSC
Martin Berglund, Frank Drewes