| Publication | Date of Publication | Type |
|---|
Block languages and their bitmap representations
| 2025-01-20 | Paper |
On the difference set of two transductions
Theoretical Computer Science | 2024-10-07 | Paper |
Average complexity of partial derivatives for synchronised shuffle expressions
Implementation and Application of Automata | 2024-02-28 | Paper |
Location automata for regular expressions with shuffle and intersection
Information and Computation | 2024-02-02 | Paper |
Approximate NFA universality and related problems motivated by information theory
Theoretical Computer Science | 2023-09-07 | Paper |
On the average complexity of partial derivative transducers
Theoretical Computer Science | 2023-04-26 | Paper |
Location automata for synchronised shuffle expressions
Journal of Logical and Algebraic Methods in Programming | 2023-03-20 | Paper |
Approximate NFA universality motivated by information theory
| 2023-01-18 | Paper |
On the uniform distribution of regular expressions
| 2022-11-09 | Paper |
Partial derivative automaton by compressing regular expressions
| 2022-11-09 | Paper |
Manipulation of regular expressions using derivatives: an overview
| 2022-08-16 | Paper |
The prefix automaton
| 2022-03-11 | Paper |
Location based automata for expressions with shuffle
| 2021-10-04 | Paper |
On the size of partial derivatives and the word membership problem
Acta Informatica | 2021-07-23 | Paper |
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
Theoretical Computer Science | 2021-06-03 | Paper |
Deciding KAT and Hoare logic with derivatives
| 2021-04-27 | Paper |
Regular expressions and transducers over alphabet-invariant and user-defined labels
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
State elimination ordering strategies: some experimental results
| 2021-02-24 | Paper |
Testing the equivalence of regular languages
| 2021-01-26 | Paper |
On the average state complexity of partial derivative transducers
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
Implementation and Application of Automata | 2020-05-06 | Paper |
The computational power of parsing expression grammars
Journal of Computer and System Sciences | 2020-03-26 | Paper |
On average behaviour of regular expressions in strong star normal form
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Some applications of the formalization of the pumping lemma for context-free languages
| 2019-11-13 | Paper |
Formalization of the pumping lemma for context-free languages
| 2019-09-18 | Paper |
A mesh of automata
Information and Computation | 2019-09-17 | Paper |
Randomized generation of error control codes with automata and transducers
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
scientific article; zbMATH DE number 7075888 (Why is no real title available?)
| 2019-07-03 | Paper |
The computational power of parsing expression grammars
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Regular expressions and transducers over alphabet-invariant and user-defined labels
| 2018-11-07 | Paper |
Symbolic manipulation of code properties
| 2018-09-17 | Paper |
Position automata for semi-extended expressions
| 2018-09-17 | Paper |
On the average complexity of partial derivative automata for semi-extended expressions
| 2018-03-29 | Paper |
Automata for regular expressions with shuffle
Information and Computation | 2018-03-21 | Paper |
A survey on operational state complexity
| 2017-11-20 | Paper |
Distinguishability operations and closures
Fundamenta Informaticae | 2017-11-09 | Paper |
On the mother of all automata: the position automaton
| 2017-10-13 | Paper |
On the average complexity of strong star normal form
| 2017-08-31 | Paper |
Optimal state reductions of automata with partially specified behaviors
Theoretical Computer Science | 2016-12-19 | Paper |
On the state complexity of partial derivative automata for regular expressions with intersection
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Implementation of code properties via transducers
Implementation and Application of Automata | 2016-11-09 | Paper |
Testing the equivalence of regular languages
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On the formalization of some results of context-free language theory
Logic, Language, Information, and Computation | 2016-09-09 | Paper |
Position automaton construction for regular expressions with intersection
Developments in Language Theory | 2016-08-30 | Paper |
Prefix and Right-Partial Derivative Automata
Evolving Computability | 2015-10-20 | Paper |
Incomplete operational transition complexity of regular languages
Information and Computation | 2015-09-28 | Paper |
Universal disjunctive concatenation and star
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Partial Derivative Automaton for Regular Expressions with Shuffle
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Deciding Kleene algebra terms equivalence in Coq
Journal of Logical and Algebraic Methods in Programming | 2015-06-10 | Paper |
On the equivalence of automata for KAT-expressions
Language, Life, Limits | 2015-02-25 | Paper |
Optimal state reductions of automata with partially specified behaviors
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Incomplete transition complexity of some basic operations
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Partial derivative and position bisimilarity automata
Implementation and Application of Automata | 2014-09-26 | Paper |
Symmetric groups and quotient complexity of Boolean operations
Automata, Languages, and Programming | 2014-07-01 | Paper |
Incremental DFA minimisation
RAIRO - Theoretical Informatics and Applications | 2014-06-27 | Paper |
scientific article; zbMATH DE number 6300100 (Why is no real title available?)
| 2014-06-03 | Paper |
A hitchhiker's guide to descriptional complexity through analytic combinatorics
Theoretical Computer Science | 2014-03-13 | Paper |
On the average size of Glushkov and equation automata for KAT expressions
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Incomplete transition complexity of basic operations on finite languages
Implementation and Application of Automata | 2013-08-07 | Paper |
On the average size of Glushkov and partial derivative automata
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
Deciding regular expressions (in-)equivalence in Coq
Relational and Algebraic Methods in Computer Science | 2012-09-21 | Paper |
On the average state complexity of partial derivative automata: an analytic combinatorics approach
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
The Average Transition Complexity of Glushkov and Partial Derivative Automata
Developments in Language Theory | 2011-07-29 | Paper |
Incremental DFA minimisation
Implementation and Application of Automata | 2011-02-11 | Paper |
Partial derivative automata formalized in Coq
Implementation and Application of Automata | 2011-02-11 | Paper |
On the Average Number of States of Partial Derivative Automata
Developments in Language Theory | 2010-08-31 | Paper |
ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae | 2009-06-23 | Paper |
Formal Modelling of Emotions in BDI Agents
Lecture Notes in Computer Science | 2009-02-12 | Paper |
Antimirov and Mosses’s Rewrite System Revisited
Implementation and Applications of Automata | 2009-02-12 | Paper |
EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Enumeration and generation with a string automata representation
Theoretical Computer Science | 2007-12-19 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
scientific article; zbMATH DE number 2186907 (Why is no real title available?)
| 2005-07-11 | Paper |
