The Net Automaton of a Rational Expression - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

The Net Automaton of a Rational Expression

Résumé

In this paper, we present a new construction of a finite automaton associated with a rational (or regular) expression. It is very similar to the one of the so-called Thompson automaton, but it overcomes the failure of the extension of that construction to the case of weighted rational expressions. At the same time, it preserves all (or almost all) of the properties of the Thompson automaton. This construction has two supplementary outcomes. The first one is the reinterpretation in terms of automata of a data structure introduced by Champarnaud, Laugerotte, Ouardi, and Ziadi for the efficient computation of the position (or Glushkov) automaton of a rational expression, and which consists in a duplicated syntactic tree of the expression decorated with some additional links. The second one supposes that this construction devised for the case of weighted expressions is brought back to the domain of Boolean expressions. It allows then to describe, in terms of automata, the construction of the Star Normal Form of an expression that was defined by Brüggemann-Klein, and also with the purpose of an efficient computation of the position automaton.
Fichier non déposé

Dates et versions

hal-03986317 , version 1 (13-02-2023)

Identifiants

Citer

Sylvain Lombardy, Jacques Sakarovitch. The Net Automaton of a Rational Expression. LATIN 2022: LATIN 2022: Theoretical Informatics, Armando Castañeda, Francisco Rodríguez-Henríquez, Nov 2022, Guanajuato, Mexico. pp.376-392, ⟨10.1007/978-3-031-20624-5_23⟩. ⟨hal-03986317⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More