An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression

Champarnaud, Jean-Marc; Ouardi, Faissal; Ziadi, Djelloul

doi:10.1007/978-3-540-73208-2_16

Cited by 5 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some derivations are based on the linearization of the (simple) input expression: let us cite the continuations of Berry and Sethi [4], the c-continuations of Champarnaud and Ziadi [14] and the derivatives of Ilie and Yu [18]. Let us mention that Antimirov derivation has been extended to the case of weighted rational expressions [21,13].…”

Section: Introductionmentioning

confidence: 99%

Multi-Tilde-Bar Derivatives

Caron

Champarnaud

Mignot

2012

Implementation and Application of Automata

Self Cite

View full text Add to dashboard Cite

Abstract. Multi-tilde-bar operators allow us to extend regular expressions. The associated extended expressions are compatible with the structure of Glushkov automata and they provide a more succinct representation than standard expressions. The aim of this paper is to examine the derivation of multi-tilde-bar expressions. Two types of computation are investigated: Brzozowski derivation and Antimirov derivation, as well as the construction of the associated automata.

show abstract

Section: Introductionmentioning

confidence: 99%

Multi-Tilde-Bar Derivatives

Caron

Champarnaud

Mignot

2012

Implementation and Application of Automata

Self Cite

View full text Add to dashboard Cite

show abstract

Manipulation of Regular Expressions Using Derivatives: An Overview

Moreira

Reis

2022

Implementation and Application of Automata

View full text Add to dashboard Cite

Derived-Term Automata of Multitape Rational Expressions

Demaille

2016

Implementation and Application of Automata

View full text Add to dashboard Cite

We consider (weighted) rational expressions to denote series over Cartesian products of monoids. We define an operator | to build multitape expressions such as (a + | x + b + | y) * . We introduce expansions, which generalize the concept of derivative of a rational expression, but relieved from the need of a free monoid. We propose an algorithm based on expansions to build multitape automata from multitape expressions. Changes:2016-07-25 Appendix A.4 was added, showing how to compute the constant term and the derivatives for the tuple operator. Sect. 5 was adapted accordingly.

show abstract

An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression

Cited by 5 publications

References 19 publications

Multi-Tilde-Bar Derivatives

Multi-Tilde-Bar Derivatives

Manipulation of Regular Expressions Using Derivatives: An Overview

Derived-Term Automata of Multitape Rational Expressions

Contact Info

Product

Resources

About