Follow
Martin Berglund
Martin Berglund
Verified email at cs.umu.se
Title
Cited by
Cited by
Year
Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
N Weideman, B Van Der Merwe, M Berglund, B Watson
Implementation and Application of Automata: 21st International Conference …, 2016
582016
Analyzing catastrophic backtracking behavior in practical regular expression matching
M Berglund, F Drewes, B Van Der Merwe
arXiv preprint arXiv:1405.5599, 2014
542014
Recognizing shuffled languages
M Berglund, H Björklund, J Högberg
Language and Automata Theory and Applications: 5th International Conference …, 2011
302011
Turning evil regexes harmless
B Van Der Merwe, N Weideman, M Berglund
Proceedings of the South African Institute of Computer Scientists and …, 2017
272017
On the semantics of regular expression parsing in the wild
M Berglund, B van der Merwe
Theoretical Computer Science 679, 69-82, 2017
242017
Regular expressions with lookahead
M Berglund, B van Der Merwe, S Van Litsenborgh
Journal of universal computer science (Online) 27 (4), 324-340, 2021
202021
Regular Expressions with Backreferences Re-examined
M Berglund, B van der Merwe
Prague Stringology Conference, 30-41, 2017
192017
Formalising and implementing Boost POSIX regular expression matching
M Berglund, W Bester, B van der Merwe
Theoretical Computer Science 857, 147-165, 2021
13*2021
Cuts in regular expressions
M Berglund, H Björklund, F Drewes, B Van Der Merwe, B Watson
Developments in Language Theory: 17th International Conference, DLT 2013 …, 2013
132013
Shuffled languages—Representation and recognition
M Berglund, H Björklund, J Björklund
Theoretical Computer Science 489, 1-20, 2013
122013
On the Semantics of Atomic Subgroups in Practical Regular Expressions
M Berglund, B van der Merwe, B Watson, N Weideman
Implementation and Application of Automata, 14-26, 2017
112017
Re-examining regular expressions with backreferences
M Berglund, B van der Merwe
Theoretical Computer Science 940, 66-80, 2023
102023
Memoized regular expressions
B van der Merwe, J Mouton, S van Litsenborgh, M Berglund
International Conference on Implementation and Application of Automata, 39-52, 2021
92021
Formalizing BPE Tokenization
M Berglund, B van der Merwe
Electronic Proceedings in Theoretical Computer Science 388, 16-27, 2023
72023
Single-rooted DAGs in regular DAG languages: Parikh image and path languages
M Berglund, H Björklund, F Drewes
Proceedings of the 13th International Workshop on Tree Adjoining Grammars …, 2017
62017
Analyzing edit distance on trees: Tree swap distance is intractable
M Berglund
16th Prague Stringology Conference (PSC), August 29-31 2011, Prague, 59-73, 2011
52011
Analyzing and Pumping Hyperedge Replacement Formalisms in a Common Framework
M Berglund
The Tenth International Workshop on Graph Computation Models, 17-32, 2019
42019
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
H Björklund, M Berglund, P Ericson
Algorithms 9 (2), 32, 2016
32016
On the parameterized complexity of linear context-free rewriting systems
M Berglund, H Björklund, F Drewes
Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13), 21-29, 2013
22013
Constructing a BPE tokenization DFA
M Berglund, W Martens, B van der Merwe
International Conference on Implementation and Application of Automata, 66-78, 2024
12024
The system can't perform the operation now. Try again later.
Articles 1–20