A mesh of automata

• Type: Article in International Scientific Journal
• Date: 2019

Authors

Broda, S (Author) FCUP; Holzer, M (Author) Other; Eva Maia (Author) FCUP; Nelma Moreira (Author) FCUP; Rogério Reis (Author) FCUP

Journal

Title: Information and Computation

Vol. 265

Pages: 94-111

ISSN: 0890-5401

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 5 Citations

Scopus - 8 Citations

Other information

Authenticus ID: P-00Q-431

DOI: 10.1016/j.ic.2019.01.003

Abstract (EN): We contribute new relations to the taxonomy of different conversions from regular expressions to equivalent finite automata. In particular, we are interested in transformations that construct automata such as, the follow automaton, the partial derivative automaton, the prefix automaton, the automata based on pointed expressions recently introduced and studied, and last but not least the position, or Glushkov automaton (A(POS)), and their double reversed construction counterparts. We deepen the understanding of these constructions and show that with the artefacts used to construct the Glushkov automaton one is able to capture most of them. As a byproduct we define a dual version A((POS) over left arrow) of the position automaton which plays a similar role as A(POS) but now for the reverse expression. Moreover, it turns out that the prefix automaton A(Pre) is central to reverse expressions, because the determinisation of the double reversal of A(Pre) (first reverse the expression, construct the automaton A(Pre), and then reverse the automaton) can be represented as a quotient of any of the considered deterministic automata that we consider in this investigation. This shows that although the conversion of regular expressions and reversal of regular expressions to finite automata seems quite similar, there are significant differences.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 18