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

DOI10.1007/978-3-540-73208-2_16zbMath1202.68223OpenAlexW2124853117MaRDI QIDQ5428227

Djelloul Ziadi, Faissal Ouardi, Jean-Marc Champarnaud

Publication date: 28 November 2007

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Derived-Term Automata for Extended Weighted Rational Expressions ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Derived-Term Automata of Multitape Rational Expressions

Uses Software

• Vaucanson

This page was built for publication: An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression