Corrigendum to our paper: How Expressions Can Code for Automata

DOI10.1051/ita/2010019zbMath1216.68148OpenAlexW2100411190MaRDI QIDQ3060202

Sylvain Lombardy, Jacques Sakarovitch

Publication date: 1 December 2010

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/44603

zbMATH Keywords

finite automataregular expressionderivation of expressionsquotient of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (1)

Kleene Theorems for Synchronous Products with Matching

Cites Work

• Partial derivatives of regular expressions and finite automaton constructions
• Derivatives of rational expressions with multiplicity
• THE ABSTRACT THEORY OF AUTOMATA
• How expressions can code for automata
• Glushkov Construction For Series: The Non Commutative Case
• Derivatives of Regular Expressions
• Unnamed Item

This page was built for publication: Corrigendum to our paper: How Expressions Can Code for Automata