Rogério Reis

Juraj Sebej

Theor. Comput. Sci., 2024

Operational State Complexity of Block Languages.

[BibT_eX]

[DOI]

CoRR, 2024

On the Representation of Block Languages.

[BibT_eX]

[DOI]

CoRR, 2024

Block Languages and Their Bitmap Representations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2024

2023

Location automata for regular expressions with shuffle and intersection.

[BibT_eX]

[DOI]

Inf. Comput., December, 2023

Approximate NFA universality and related problems motivated by information theory.

[BibT_eX]

[DOI]

Mitja Mastnak

Theor. Comput. Sci., September, 2023

On the average complexity of partial derivative transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., May, 2023

Location automata for synchronised shuffle expressions.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., April, 2023

Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2023

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2023

2022

Manipulation of Regular Expressions Using Derivatives: An Overview.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2022

Approximate NFA Universality Motivated by Information Theory.

[BibT_eX]

[DOI]

Mitja Mastnak

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Hot Current Topics of Descriptional Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advancing Research in Information and Communication Technology, 2021

Partial derivatives of regular expressions over alphabet-invariant and user-defined labels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The Prefix Automaton.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2021

On the size of partial derivatives and the word membership problem.

[BibT_eX]

[DOI]

Acta Informatica, 2021

Location Based Automata for Expressions with Shuffle.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2021

Partial Derivative Automaton by Compressing Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2021

On the Uniform Distribution of Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2021

2020

Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average.

[BibT_eX]

[DOI]

SIGACT News, 2020

The computational power of parsing expression grammars.

[BibT_eX]

[DOI]

Bruno Loff

J. Comput. Syst. Sci., 2020

Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels.

[BibT_eX]

[DOI]

Joshua Young

Int. J. Found. Comput. Sci., 2020

On the Average State Complexity of Partial Derivative Transducers.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

On Average Behaviour of Regular Expressions in Strong Star Normal Form.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

A mesh of automata.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels.

[BibT_eX]

[DOI]

João Pires

Proceedings of the Implementation and Application of Automata, 2019

2018

Symbolic Manipulation of Code Properties.

[BibT_eX]

[DOI]

Casey Meijer

J. Autom. Lang. Comb., 2018

Position Automata for Semi-extended Expressions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

Randomized generation of error control codes with automata and transducers.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2018

Automata for regular expressions with shuffle.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs.

[BibT_eX]

[DOI]

Miguel Ferreira

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

Optimal state reductions of automata with partially specified behaviors.

[BibT_eX]

[DOI]

Giovanni Pighizzini

Theor. Comput. Sci., 2017

A Survey on Operational State Complexity.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

On the Mother of All Automata: The Position Automaton.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

On the Average Complexity of Strong Star Normal Form.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

Ideal regular languages and strongly connected synchronizing automata.

[BibT_eX]

[DOI]

Emanuele Rodaro

Theor. Comput. Sci., 2016

Distinguishability Operations and Closures.

[BibT_eX]

[DOI]

Cezar Câmpeanu

Fundam. Informaticae, 2016

Channels with Synchronization/Substitution Errors and Computation of Error Control Codes.

[BibT_eX]

[DOI]

CoRR, 2016

Implementation of Code Properties via Transducers.

[BibT_eX]

[DOI]

Casey Meijer

Proceedings of the Implementation and Application of Automata, 2016

Automata Serialization for Manipulation and Drawing.

[BibT_eX]

[DOI]

Miguel Ferreira

Proceedings of the 5th Symposium on Languages, Applications and Technologies, 2016

Generating error control codes with automata and transducers.

[BibT_eX]

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

On the dissimilarity operation on finite languages.

[BibT_eX]

Cezar Câmpeanu

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Position Automaton Construction for Regular Expressions with Intersection.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

On the Number of Linear Finite Transducers.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Incomplete operational transition complexity of regular languages.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Average Size of Automata Constructions from Regular Expressions.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Universal Disjunctive Concatenation and Star.

[BibT_eX]

[DOI]

Giovanni Pighizzini

Proceedings of the Descriptional Complexity of Formal Systems, 2015

Partial Derivative Automaton for Regular Expressions with Shuffle.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2015

Prefix and Right-Partial Derivative Automata.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the invertibility of finite linear transducers.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Incremental DFA minimisation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Preface.

[BibT_eX]

[DOI]

Helmut Jürgensen

Int. J. Found. Comput. Sci., 2014

Partial Derivative and Position Bisimilarity Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2014

Counting Equivalent Linear Finite Transducers Using a Canonical Form.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2014

The distinguishability operation on regular languages.

[BibT_eX]

Cezar Câmpeanu

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Statistical study on the number of injective linear finite transducers.

[BibT_eX]

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Symmetric Groups and Quotient Complexity of Boolean Operations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Equivalence of Automata for KAT-expressions.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Incomplete Transition Complexity of Basic Operations on Finite Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2013

Incomplete Transition Complexity of Some Basic Operations.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

On the Average Size of Glushkov and Equation Automata for KAT Expressions.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Regular Ideal Languages and Synchronizing Automata.

[BibT_eX]

[DOI]

Emanuele Rodaro

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Finite Automata Minimization.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

On the Average Size of Glushkov and Partial derivative Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Formal Power Series and the Invertibility of Finite Linear Transducers.

[BibT_eX]

Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

2011

On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

The Average Transition Complexity of Glushkov and Partial Derivative Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Small NFAs from Regular Expressions: Some Experimental Results

[BibT_eX]

[DOI]

Hugo Gouveia

CoRR, 2010

State Elimination Ordering Strategies: Some Experimental Results

[BibT_eX]

[DOI]

Davide Nabais

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

On the Average Number of States of Partial Derivative Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Antimirov and Mosses's Rewrite System Revisited.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Series-Parallel Automata and Short Regular Expressions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Testing the Equivalence of Regular Languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

FAdo and GUItar.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2009

2008

Exact Generation of Minimal Acyclic Deterministic Finite Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Exact Generation of Acyclic Deterministic Finite Automata.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Enumeration and generation with a string automata representation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Automated Ciphertext - Only Cryptanalysis of the Bifid Cipher.

[BibT_eX]

[DOI]

Cryptologia, 2007

2006

Aspects of Enumeration and Generation with a String Automata Representation.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Acyclic Automata with Easy-to-Find Short Regular Expressions.

[BibT_eX]

[DOI]

José João Morais

Proceedings of the Implementation and Application of Automata, 2005

Interactive manipulation of regular objects with FAdo.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

On the Representation of Finite Automata.

[BibT_eX]

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2001

Apoo: an environment for a first course in assembly language programming.

[BibT_eX]

[DOI]