Rogério Reis

Rogério Reis

Auto-generated profile, based on publicly available information

Rogério Reis

Faculdade de Ciências da Universidade do Porto

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2007 in Theoretical Computer Science
Verified
Journal Article
Closed access
MAMarco Almeida
Marco Almeida
NMNelma Moreira
Nelma Moreira
RRRogério Reis
Rogério Reis

1 August 2012 in International Journal of Foundations of Computer Science
Verified
Journal Article
Closed access
SBSabine Broda
Sabine Broda
AMAntónio Machiavelo
António Machiavelo
NMNelma Moreira
Nelma Moreira
RRRogério Reis
Rogério Reis

1 April 2018 in Information and Computation
Verified
Journal Article
Closed access
SBSabine Broda
Sabine Broda
AMAntónio Machiavelo
António Machiavelo
NMNelma Moreira
Nelma Moreira
RRRogério Reis
Rogério Reis

1 November 2011 in International Journal of Foundations of Computer Science
Verified
Journal Article
Closed access
PDF file
SBSabine Broda
Sabine Broda
AMAntónio Machiavelo
António Machiavelo
NMNelma Moreira
Nelma Moreira
RRRogério Reis
Rogério Reis

30 July 2009 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
MAMarco Almeida
Marco Almeida
NMNelma Moreira
Nelma Moreira
RRRogério Reis
Rogério Reis
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic finite automata that avoids minimisation. In this paper we improve the best-case running time, present an extension of this algorithm to non-deterministic finite automata, and establish a relationship between this algorithm and the one proposed in Almeida et al. We also present some experimental comparative results. All these algorithms are closely related with the recent coalgebraic approach to automata proposed by Rutten

1 January 2014
Verified
Book Chapter
Closed access
PDF file
JBJason Bell
Jason Bell
JBJanusz Brzozowski
Janusz Brzozowski
NMNelma Moreira
Nelma Moreira
RRRogério Reis
Rogério Reis