| Tool Support for Correctness-by-Construction. | 0 | 0.34 | 2019 |
| Towards Confidentiality-by-Construction. | 0 | 0.34 | 2018 |
| Using CSP to Develop Quality Concurrent Software. | 0 | 0.34 | 2018 |
| X-by-Construction. | 0 | 0.34 | 2018 |
| From Tree Automata to String Automata Minimization. | 0 | 0.34 | 2018 |
| Three Strategies for the Dead-Zone String Matching Algorithm. | 0 | 0.34 | 2018 |
| Workshop on Advances in Knowledge Extraction and Re-engineering of Software (selected and extended papers from WAKERS 2017). | 0 | 0.34 | 2018 |
| Indeterminate String Factorizations and Degenerate Text Transformations. | 1 | 0.40 | 2017 |
| CSP for Parallelising Brzozowski's DFA Construction Algorithm. | 0 | 0.34 | 2017 |
| Many-MADFAct: Concurrently Constructing MADFAs. | 0 | 0.34 | 2017 |
| On the Semantics of Atomic Subgroups in Practical Regular Expressions. | 0 | 0.34 | 2017 |
| Towards a Unified Taxonomy of Biclustering Methods. | 1 | 0.34 | 2017 |
| Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. | 0 | 0.34 | 2017 |
| Correctness-by-Construction and Post-hoc Verification: A Marriage of Convenience? | 1 | 0.36 | 2016 |
| Correctness-by-Construction \wedge Taxonomies \Rightarrow Deep Comprehension of Algorithm Families. | 3 | 0.41 | 2016 |
| Tax-PLEASE--Towards Taxonomy-Based Software Product Line Engineering | 2 | 0.39 | 2016 |
| Quantum Leap Pattern Matching. | 2 | 0.36 | 2015 |
| Hardware Implementations of Finite Automata and Regular Expressions - Extended Abstract. | 0 | 0.34 | 2015 |
| SPLicing TABASCO: Custom-Tailored Software Product Line Variants from Taxonomy-Based Toolkits. | 4 | 0.47 | 2015 |
| An Aho-Corasick Based Assessment of Algorithms Generating Failure Deterministic Finite Automata. | 0 | 0.34 | 2015 |
| Experience with correctness-by-construction. | 0 | 0.34 | 2015 |
| Using Correctness-by-Construction to Derive Dead-zone Algorithms. | 0 | 0.34 | 2014 |
| A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm. | 0 | 0.34 | 2014 |
| Weak factor automata: the failure of failure factor oracles? | 0 | 0.34 | 2014 |
| Empirically Assessing Algorithm Performance | 0 | 0.34 | 2014 |
| Quality in software development: a pragmatic approach using metrics. | 0 | 0.34 | 2014 |
| Efficient representation of DNA data for pattern recognition using failure factor oracles | 1 | 0.37 | 2013 |
| A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching. | 3 | 0.56 | 2012 |
| Performance assessment of dead-zone single keyword pattern matching | 2 | 0.48 | 2012 |
| Multiple Keyword Pattern Matching using Position Encoded Pattern Lattices. | 0 | 0.34 | 2012 |
| On Compile Time Knuth-Morris-Pratt Precomputation | 0 | 0.34 | 2011 |
| Performance of C++ bit-vector implementations | 3 | 0.41 | 2010 |
| A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms | 7 | 0.67 | 2010 |
| Formal Characterizations Of Fa-Based String Processors | 0 | 0.34 | 2010 |
| Finite-State Methods and Natural Language Processing, 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers | 15 | 2.88 | 2010 |
| A framework for benchmarking FA-based string recognizers | 0 | 0.34 | 2010 |
| Improving Automata Efficiency By Stretching And Jamming | 0 | 0.34 | 2010 |
| Software engineering in South Africa | 0 | 0.34 | 2010 |
| Virtual machine framework for constructing domain-specific languages | 0 | 0.34 | 2009 |
| Finite-State Methods and Natural Language Processing, 7th International Workshop, FSMNLP 2007, Ispra, Italy, September 11-12, 2008. Post-proceedings | 22 | 2.39 | 2009 |
| FCA-Based Two Dimensional Pattern Matching | 1 | 0.43 | 2009 |
| An incremental algorithm to construct a lattice of set intersections | 23 | 0.78 | 2009 |
| On Minimizing Deterministic Tree Automata | 0 | 0.34 | 2009 |
| Virtual machine framework for constructing domain-specific languages | 4 | 0.51 | 2009 |
| On Regular Expression Hashing To Reduce Fa Size | 0 | 0.34 | 2008 |
| On Implementation And Performance Of Table-Driven Dfa-Based String Processors | 1 | 0.40 | 2008 |
| A Boyer-Moore-Horspool algorithm derivation. | 0 | 0.34 | 2008 |
| Efficient Automata Constructions And Approximate Automata | 3 | 0.48 | 2008 |
| A Concurrent Specification Of An Incremental Dfa Minimisation Algorithm | 1 | 0.37 | 2008 |
| A Concurrent Specification Of Brzozowski'S Dfa Construction Algorithm | 0 | 0.34 | 2008 |
