On sum graphs over some magmas

Discrete Mathematics, Algorithms and Applications

2026 | journal-article

Average State Complexity of Partial Derivative Automata for Synchronised Shuffles

International Journal of Foundations of Computer Science

2026 | journal-article

On the Descriptional Complexity of Literal Shuffle

2026 | book-chapter

Language Quotients Revisited

International Journal of Foundations of Computer Science

2025 | journal-article

Automata for Synchronised Shuffle on Backbones

2025 | book-chapter

Two-Word Shuffle: Some Results

2025 | book-chapter

Compressed Structures for Partial Derivative Automata Constructions

International Journal of Foundations of Computer Science

2024 | journal-article

Block Languages and Their Bitmap Representations

2024 | book-chapter

Location automata for regular expressions with shuffle and intersection

Information and Computation

2023 | journal-article

25th International Conference on Developments in Language Theory (DLT 2021): Preface

2023 | other

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions

2023 | book-chapter

Location automata for synchronised shuffle expressions

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING

2023 | journal-article

On the average complexity of partial derivative transducers *,**,***

THEORETICAL COMPUTER SCIENCE

2023 | journal-article

Approximate NFA Universality Motivated by Information Theory

DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022

2022 | conference-paper

Approximate NFA Universality and Related Problems Motivated by Information Theory

CoRR

2022 | other

Manipulation of Regular Expressions Using Derivatives: An Overview

IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2022)

2022 | conference-paper

Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings

DLT

2021 | edited-book

Hot Current Topics of Descriptional Complexity

Advancing Research in Information and Communication Technology - IFIP's Exciting First 60+ Years, Views from the Technical Committees and Working Groups

2021 | book-chapter

Location Based Automata for Expressions with Shuffle

Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings

2021 | conference-paper

On the Uniform Distribution of Regular Expressions

CoRR

2021 | other

On the size of partial derivatives and the word membership problem

ACTA INFORMATICA

2021 | journal-article

Partial Derivative Automaton by Compressing Regular Expressions

DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021

2021 | conference-paper

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

Theor. Comput. Sci.

2021 | journal-article

Preface

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2021 | other

Report on Zhi-Wei Sun's 1-3-5 conjecture and some of its refinements

JOURNAL OF NUMBER THEORY

2021 | journal-article

The Prefix Automaton

J. Autom. Lang. Comb.

2021 | journal-article

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

SIGACT News

2020 | journal-article

On the Average State Complexity of Partial Derivative Transducers

SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE

2020 | conference-paper

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

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

2020 | journal-article

The computational power of parsing expression grammars

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

2020 | journal-article

Criptografia e Criptoanálise

Revista de Ciência Elementar

2019 | journal-article

A mesh of automata

INFORMATION AND COMPUTATION

2019 | journal-article

On Average Behaviour of Regular Expressions in Strong Star Normal Form

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

2019 | journal-article

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

Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings

2019 | conference-paper

Automata for regular expressions with shuffle

INFORMATION AND COMPUTATION

2018 | journal-article

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

DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018

2018 | conference-paper

Position Automata for Semi-extended Expressions

Journal of Automata, Languages and Combinatorics

2018 | journal-article

RANDOMIZED GENERATION OF ERROR CONTROL CODES WITH AUTOMATA AND TRANSDUCERS

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

2018 | journal-article

Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels

IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2018

2018 | conference-paper

Symbolic Manipulation of Code Properties

Journal of Automata, Languages and Combinatorics

2018 | journal-article

The Computational Power of Parsing Expression Grammars

Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings

2018 | conference-paper

A Survey on Operational State Complexity

Journal of Automata, Languages and Combinatorics

2017 | journal-article

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

Journal of Automata, Languages and Combinatorics

2017 | journal-article

On the Average Complexity of Strong Star Normal Form

DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017

2017 | conference-paper

On the Mother of All Automata: The Position Automaton

DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017

2017 | conference-paper

Optimal state reductions of automata with partially specified behaviors

THEORETICAL COMPUTER SCIENCE

2017 | journal-article

Osteoarthritis

2017 | book-chapter

Preface

2017 | other

The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski

2017 | edited-book

Automata Serialization for Manipulation and Drawing

5th Symposium on Languages, Applications and Technologies, SLATE 2016, June 20-21, 2016, Maribor, Slovenia

2016 | conference-paper

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

CoRR

2016 | other

Distinguishability Operations and Closures

FUNDAMENTA INFORMATICAE

2016 | journal-article

Generating error control codes with automata and transducers

Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings

2016 | conference-paper

Ideal regular languages and strongly connected synchronizing automata

THEORETICAL COMPUTER SCIENCE

2016 | journal-article

Implementation of Code Properties via Transducers

Implementation and Application of Automata

2016 | conference-paper

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

Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings

2016 | conference-paper

On the dissimilarity operation on finite languages

Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings

2016 | conference-paper

Position Automaton Construction for Regular Expressions with Intersection

DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016

2016 | conference-paper

Preface: Non-classical models of automata and applications VII

RAIRO - Theoretical Informatics and Applications

2016 | other

Average Size of Automata Constructions from Regular Expressions

Bulletin of the EATCS

2015 | journal-article

Incomplete operational transition complexity of regular languages

INFORMATION AND COMPUTATION

2015 | journal-article

On the Number of Linear Finite Transducers

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

2015 | journal-article

Optimal State Reductions of Automata with Partially Specified Behaviors

SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE

2015 | conference-paper

Partial Derivative Automaton for Regular Expressions with Shuffle

Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings

2015 | conference-paper

Partial Derivative Automaton for Regular Expressions with Shuffle

CoRR

2015 | other

Prefix and Right-Partial Derivative Automata

EVOLVING COMPUTABILITY

2015 | conference-paper

Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings

NCMA

2015 | edited-book

Symbolic Manipulation of Code Properties

CoRR

2015 | other

Universal Disjunctive Concatenation and Star

Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings

2015 | conference-paper

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

THEORETICAL COMPUTER SCIENCE

2014 | journal-article

Counting Equivalent Linear Finite Transducers Using a Canonical Form

IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014

2014 | conference-paper

INCREMENTAL DFA MINIMISATION

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

2014 | journal-article

ON THE INVERTIBILITY OF FINITE LINEAR TRANSDUCERS

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

2014 | journal-article

On the Equivalence of Automata for KAT-expressions

Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings

2014 | conference-paper

Partial Derivative and Position Bisimilarity Automata

IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014

2014 | conference-paper

Preface

Int. J. Found. Comput. Sci.

2014 | journal-article

Statistical study on the number of injective linear finite transducers

Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings

2014 | conference-paper

Symmetric Groups and Quotient Complexity of Boolean Operations

AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT II

2014 | conference-paper

The distinguishability operation on regular languages

Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings

2014 | conference-paper

The distinguishability operation on regular languages

Non-Classical Models of Automata and Applications (NCMA 2014)

2014 | conference-paper

On the average size of glushkov and equation automata for KAT expressions

19th International Symposium on Fundamentals of Computation Theory

2013 | conference-paper

Incomplete Transition Complexity of Basic Operations on Finite Languages

CIAA 2013

2013 | conference-paper

Incomplete transition complexity of basic operations on finite languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013 | journal-article

Incomplete transition complexity of some basic operations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013 | journal-article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013 | journal-article

On Strongly Connected Ideal Languages

WORDS 2013

2013 | conference-paper

On the average size of Glushkov and equation automata for KAT expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013 | journal-article

Preface

Int. J. Found. Comput. Sci.

2013 | journal-article

Regular Ideal Languages and Synchronizing Automata

Combinatorics on Words

2013 | book-chapter

Regular ideal languages and synchronizing automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013 | journal-article

Reset regular decomposition complexity of regular ideal languages

14th Italian Conference on Theoretical Computer Science

2013 | conference-paper

The language of initially connected deterministic finite automata

14th Italian Conference on Theoretical Computer Science

2013 | conference-paper

Editorial

Journal of Automata, Languages and Combinatorics

2012 | journal-article

Finite Automata Minimization

Handbook of Finite State Based Models and Applications.

2012 | book-chapter

Finite automata minimization algorithms

Handbook of Finite State Based Models and Applications

2012 | book-chapter

Formal Power Series and the Invertibility of Finite Linear Transducers

Fourth Workshop on Non-Classical Models for Automata and Applications - NCMA 2012, Fribourg, Switzerland, August 23-24, 2012. Proceedings

2012 | conference-paper

Implementation and Application of Automata

Springer Berlin Heidelberg

2012 | edited-book

Incomplete transition complexity of some basic operations.

SOFSEM 2013: Theory and Practice of Computer Science

2012 | conference-paper

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2012 | journal-article

On the average size of glushkov and partial derivative automata

International Journal of Foundations of Computer Science

2012 | journal-article

On the average size of glushkov and partial derivative automata

International Journal of Foundations of Computer Science

2012 | journal-article

Preface

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2012 | journal-article

A static type inference for Python

DYLA11 - 5th Workshop on Dynamic Languages and Applications

2011 | conference-paper

Incremental DFA minimisation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2011 | journal-article

On the average state complexity of partial derivative automata

International Journal of Foundations of Computer Science

2011 | journal-article

The Average Transition Complexity of Glushkov and Partial Derivative Automata

Developments in Language Theory

2011 | book-chapter

Ainda o totobola: o singular caso dos 5

Boletim da Sociedade Portuguesa de Matemática

2010 | magazine-article

GUItar and FAgoo: Graphical interface for automata visualization, editing, and interaction

Inforum, Simp ´osio de Inform ´atica

2010 | conference-paper

Incremental DFA minimization

International Conference on Implementation and Application of Automata

2010 | conference-paper

Inferência de tipos em Python

Inforum, Simp ´osio de Inform ´atica

2010 | conference-paper

On the Average Number of States of Partial Derivative Automata

Developments in Language Theory

2010 | book-chapter

Small NFAs from Regular Expressions: Some Experimental Results

CoRR

2010 | other

State elimination ordering strategies: Some experimental results

Workshop on Descriptional Complexity of Formal Systems

2010 | conference-paper

Testing the Equivalence of Regular Languages

Journal of Automata, Languages and Combinatorics

2010 | journal-article

Testing the equivalence of regular languages

Journal of Automata, Languages and Combinatorics

2010 | journal-article

Timing analysis - from predictions to certificates

Inforum, Simp ´osio de Inform ´atica

2010 | conference-paper

Towards a worst-case execution time calculation platform with certificate production

8th European Dependable Computing Conference

2010 | conference-paper

XML description for automata manipulations

XATA 2010, XML: aplicações e tecnologias associadas

2010 | conference-paper

O problema do totobola

Boletim da Sociedade Portuguesa de Matemática

2009 | magazine-article

Antimirov and Mosses' rewrite system revisited

International Journal of Foundations of Computer Science

2009 | journal-article

Antimirov and Mosses's rewrite system revisited

International Journal of Foundations of Computer Science

2009 | journal-article

FAdo and GUItar: Tools for automata manipulation and visualization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2009 | journal-article

Locating cars through a vision enabled VANET

IEEE Intelligent Vehicles Symposium, Proceedings

2009 | journal-article

Series-parallel automata and short regular expressions

Fundamenta Informaticae

2009 | journal-article

Testing equivalence of Regular Languages

Workshop on Descriptional Complexity of Formal Systems (DCFS09)

2009 | conference-paper

Testing the Equivalence of Regular Languages

Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009.

2009 | conference-paper

Um Manuscrito perdido do Dr. Watson: Sherlock Homes e o Sudoku (parte 1)

Boletim da Sociedade Portuguesa de Matemática

2008 | magazine-article

A Toolkit for an Oral History Digital Archive

XATA 2008

2008 | conference-paper

Antimirov and Mosses's rewrite system revisited

CIAA 2008: Thirteenth International Conference on Implementation and Application of Automata

2008 | conference-paper

Antimirov and Mosses’s Rewrite System Revisited

Implementation and Applications of Automata

2008 | book-chapter

CGM: A context-free grammar manipulator

Corta 08

2008 | conference-paper

Exact generation of acyclic deterministic finite automata

Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008

2008 | conference-paper

Exact generation of acyclic deterministic finite automata

Workshop on Descriptional Complexity of Formal Systems (DCFS08)

2008 | conference-paper

Exact generation of minimal acyclic deterministic finite automata

International Journal of Foundations of Computer Science

2008 | journal-article

Exact generation of minimal acyclic deterministic finite automata

International Journal of Foundations of Computer Science

2008 | journal-article

On the performance of automata minimization algorithms

Computing in Europe 2008}. editor

2008 | conference-paper

Automated ciphertext - Only cryptanalysis of the Bifid cipher

Cryptologia

2007 | journal-article

Enumeration and generation with a string automata representation

Theoretical Computer Science

2007 | journal-article

Exact generation of minimal acyclic deterministic finite automata

Workshop on Descriptional Complexity of Formal Systems (DCFS07)

2007 | conference-paper

AGISA: Ambiente de Gestão Integrado da Sala de Aulas

Revista de Ciências da Computação

2006 | journal-article

Acyclic automata with easy-to-find short regular expressions

IMPLEMENTATION AND APPLICATION OF AUTOMATA

2006 | journal-article

Aspects of enumeration and generation with a string automata representation

8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006 - Proceedings

2006 | conference-paper

Partitions into sum-fee sets

INTEGERS:Electronic Journal of Combinatorial Number Theory

2006 | journal-article

AGISA: An Integrateded System for Classroom Administration

Recent Research Developments in Learning Technologies. III International Conference on multimedia \& ICTs in Education

2005 | conference-paper

FAdo:Interactive Tools for Learning Formal Computational Models

Encontro Nacional de Visualização Científica

2005 | conference-paper

Interactive manipulation of regular objects with FAdo

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

2005 | journal-article

On the density of languages representing finite set partitions

Journal of Integer Sequences

2005 | journal-article

On the representation of finite automata

7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Proceedings

2005 | conference-paper

A Web-Based System For Multi-Agent Interactive Timetabling

ICKEDS 2004, First International Conference on Knowledge Engineering and Decision Support

2004 | conference-paper

Apoo: an Environment for a Firts Course in Assembly Language Programming

SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)

2001 | journal-article

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

SIGCSE Bulletin

2001 | journal-article

Natural Language and Natural Menus Interfaces

Modelling the Innovation: Communications, Automation and Information Systems, Proceedings of the IFIP TC7 Conference on Modelling the Innovation: Communications, Automation and Information Systems, Rome, Italy, 21-23 March, 1990

1990 | conference-paper

Finite automata minimization algorithms

| book-chapter

Formal Power Series and the Invertibility of Finite Linear Transducers

| conference-paper

Partitions into sum-free sets

INTEGERS: Electronic Journal of Combinatorial Number Theory

| journal-article

State Elimination Ordering Strategies: Some Experimental Results

| conference-paper