Rogério Reis's Annual Report

Rogério Reis's Annual Report

Year:

2013

Brief description of the research activities:

With S. Broda, A. Machiavelo, and N. Moreira: study of average case complexity of Glushkov and Equation Automata for KAT Expressions

With J. Bell, J.Brzozowski, and N. Moreira:study the qutient complexity of boolean operations over languages which syntatc semigroups are symmetric groups.

With E. Maia and N. Moreira: study of the worst-case operational transition and state complexity on incomplete deterministic finite automata for finite languages

Projects description:

Preprints:

The Operational Incomplete Transition Complexity on Finite Languages

Desco: a knowledge based system for descriptional complexity of formal languages

Glushkov and Equation Automata for KAT Expressions

Manipulation of extended regular expressions with derivatives

Books:

Finite automata minimization algorithms

Descriptional Complexity of Formal Systems, 15th International Workshop (DCFS 2013)

Articles in international peer reviewed journals :

Preface. Special Issue - Implementation and Application of Automata (CIAA 2012)

Proceedings of international conferences (peer reviewed):

Reset Regular Decomposition Complexity of Regular Ideal Languages (extended Abstract)

The Language of Initially Connected Deterministic Finite Automata (Extended Abstract)

Proceedings classified as book chapters (peer reviewed):

Regular Ideal Languages and Synchronizing Automata

Incomplete Transition Complexity of some Basic Operations

Incomplete Transition Complexity of Basic Operations on Finite Languages

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

Talks / Seminars / Courses :

Computational applications:

FAdo: Tools for manipulation of formal languages (http://fado.dcc.fc.up.pt <http://fado.dcc.fc.up.pt/>)

DesCo:Web based system for descriptional complexity results on formal languages (http://desco.up.pt <http://desco.up.pt/>)

Student Mentoring:

SFRH/BD/78392/2011

SFRH/BD/84901/2012