Martin Berglund
Martin Berglund
Universität der Bundeswehr München
Verified email at cs.umu.se
TitleCited byYear
Recognizing shuffled languages
M Berglund, H Björklund, J Högberg
International Conference on Language and Automata Theory and Applications …, 2011
252011
Analyzing catastrophic backtracking behavior in practical regular expression matching
M Berglund, F Drewes, B Van Der Merwe
arXiv preprint arXiv:1405.5599, 2014
202014
Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
N Weideman, B van der Merwe, M Berglund, B Watson
International Conference on Implementation and Application of Automata, 322-334, 2016
172016
On the semantics of regular expression parsing in the wild
M Berglund, B van der Merwe
Theoretical Computer Science 679, 69-82, 2017
112017
On the Semantics of Regular Expression Parsing in the Wild
M Berglund, B van der Merwe
International Conference on Implementation and Application of Automata 9223 …, 2015
112015
Cuts in regular expressions
M Berglund, H Björklund, F Drewes, B van der Merwe, B Watson
International Conference on Developments in Language Theory, 70-81, 2013
92013
Shuffled languages—Representation and recognition
M Berglund, H Björklund, J Björklund
Theoretical Computer Science 489, 1-20, 2013
62013
Turning evil regexes harmless
B Van Der Merwe, N Weideman, M Berglund
Proceedings of the South African Institute of Computer Scientists and …, 2017
52017
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
52017
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
32017
Uniform vs. nonuniform membership for mildly context-sensitive languages: a brief survey
H Björklund, M Berglund, P Ericson
Algorithms 9 (2), 32, 2016
22016
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
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
22011
Complexities of Parsing in the Presence of Reordering
M Berglund
Department of Computing Science, Umeå University, 2012
12012
An Automata-Based View on Configurability and Uncertainty
M Berglund, I Schaefer
International Colloquium on Theoretical Aspects of Computing, 80-98, 2018
2018
Formalising boost POSIX regular expression matching
M Berglund, W Bester, B van der Merwe
International Colloquium on Theoretical Aspects of Computing, 99-115, 2018
2018
The Output Size Problem for String-to-Tree Transducers
BVM Martin Berglund, Frank Drewes
Journal of Automata, Languages and Combinatorics 23 (1-3), 19-38, 2018
2018
On regular expressions with backreferences and transducers
M Berglund, F Drewes, B Van der Merwe
2018
Regular Expressions with Backreferences Re-examined
M Berglund, B van der Merwe
Prague Stringology Conference, 30-41, 2017
2017
Complexities of Order-Related Formal Language Extensions
M Berglund
Umeå Universitet, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–20