Brink van der Merwe

Orcid: 0000-0001-5010-9934

Affiliations:
  • University of Stellenbosch


According to our database1, Brink van der Merwe authored at least 52 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Automatic assignment of diagnosis codes to free-form text medical note.
J. Univers. Comput. Sci., April, 2023

Re-examining regular expressions with backreferences.
Theor. Comput. Sci., 2023

Ordered Context-Free Grammars Revisited.
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

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

Learning Type Inference for Enhanced Dataflow Analysis.
Proceedings of the Computer Security - ESORICS 2023, 2023

Making Superhuman AI More Human in Chess.
Proceedings of the Advances in Computer Games - 18th International Conference, 2023

2022
Ordered Context-Free Grammars.
Proceedings of the Implementation and Application of Automata, 2022

2021
Formalising and implementing Boost POSIX regular expression matching.
Theor. Comput. Sci., 2021

Regular Expressions with Lookahead.
J. Univers. Comput. Sci., 2021

Memoized Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2021

2020
Suitability of Graph Database Technology for the Analysis of Spatio-Temporal Data.
Future Internet, 2020

Testing Ethereum Smart Contracts: A Comparison of Symbolic Analysis and Fuzz Testing Tools.
Proceedings of the SAICSIT '20: Conference of the South African Institute of Computer Scientists and Information Technologists 2020, 2020

2018
A Computationally Inexpensive Energy Model for Horizontal Electric Water Heaters With Scheduling.
IEEE Trans. Smart Grid, 2018

Learning Concept Embeddings from Temporal Data.
J. Univers. Comput. Sci., 2018

The Output Size Problem for String-to-Tree Transducers.
J. Autom. Lang. Comb., 2018

On regular expressions with backreferences and transducers.
Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

Formalising Boost POSIX Regular Expression Matching.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017
On the semantics of regular expression parsing in the wild.
Theor. Comput. Sci., 2017

Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Fundam. Informaticae, 2017

On the Semantics of Atomic Subgroups in Practical Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2017

Regular Expressions with Backreferences Re-examined.
Proceedings of the Prague Stringology Conference 2017, 2017

Addressing challenges in obtaining high coverage when model checking Android applications.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

Turning evil regexes harmless.
Proceedings of the South African Institute of Computer Scientists and Information Technologists, 2017

Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited.
Proceedings of the Language and Automata Theory and Applications, 2017

Saving on household electric water heating: What works best and by how much?
Proceedings of the 2017 IEEE Innovative Smart Grid Technologies - Asia, 2017

Smart electric water heaters: a system architecture proposal for scalable IoT.
Proceedings of the Second International Conference on Internet of things and Cloud Computing, 2017

2016
StateComparator: Detecting Unbounded Variables Using JPF.
ACM SIGSOFT Softw. Eng. Notes, 2016

Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.
Proceedings of the Implementation and Application of Automata, 2016

2015
Environment Modeling Using Runtime Values for JPF-Android.
ACM SIGSOFT Softw. Eng. Notes, 2015

Generation of Library Models for Verification of Android Applications.
ACM SIGSOFT Softw. Eng. Notes, 2015

Electric Water Heater Energy Consumption Determination Using Outlet Temperature and Volumetric Estimation.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015

N-Gram Representations For Comment Filtering.
Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists, 2015

Using thermal transients at the outlet of electrical water heaters to recognise consumption patterns for heating schedule optimisation.
Proceedings of the 7th International Conference on New Technologies, Mobility and Security, 2015

2014
Ambiguity and structural ambiguity of symmetric difference NFAs.
Theor. Comput. Sci., 2014

Graph transformation for incremental natural language analysis.
Theor. Comput. Sci., 2014

Execution and property specifications for JPF-android.
ACM SIGSOFT Softw. Eng. Notes, 2014

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

2013
Counting Minimal Symmetric Difference NFAs.
Proceedings of the Language and Automata Theory and Applications, 2013

Cuts in Regular Expressions.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

A Tree Transducer Model for Grammatical Error Correction.
Proceedings of the Seventeenth Conference on Computational Natural Language Learning: Shared Task, 2013

2012
Verifying android applications using Java PathFinder.
ACM SIGSOFT Softw. Eng. Notes, 2012

Minimal DFA for Symmetric Difference NFA.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011
Music Generation with Markov Models.
IEEE Multim., 2011

Ambiguity of Unary Symmetric Difference NFAs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Incremental Construction of Millstream Configurations Using Graph Transformation.
Proceedings of the Finite-State Methods and Natural Language Processing, 2011

2010
The Near-Ring of Lipschitz Functions on a Metric Space.
Int. J. Math. Math. Sci., 2010

2009
Comparing leaf and root insertion.
South Afr. Comput. J., 2009

Reducing Nondeterministic Finite Automata with SAT Solvers.
Proceedings of the Finite-State Methods and Natural Language Processing, 2009

2008
Bag Context Tree Grammars.
Fundam. Informaticae, 2008

Path Languages of Random Permitting Context Tree Grammars are Regular.
Fundam. Informaticae, 2008

2007
Ducci-sequences and cyclotomic polynomials.
Finite Fields Their Appl., 2007

2005
Random context tree grammars and tree transducers.
South Afr. Comput. J., 2005


  Loading...