How expressions can code for automata

DOI10.1051/ITA:2005013MaRDI QIDQ4680737zbMATH OpenOpenAlexFDO

Authors Sylvain Lombardy, Jacques Sakarovitch

Publication date 7 June 2005

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

Full work available at URL http://www.numdam.org/item?id=ITA_2005__39_1_217_0, https://eudml.org/doc/44603, https://semanticscholar.org/paper/4c4d082c020726c4d8da388d0e0e0d5dc8627079

zbMATH Keywords

derived term of an expression

Mathematics Subject Classification ID

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

Recommendations

• LATIN 2004: Theoretical Informatics
• Corrigendum to our paper: How Expressions Can Code for Automata
• Derivatives of rational expressions with multiplicity
• Derived-term automata of multitape rational expressions
• Derived-term automata of multitape expressions with composition

Cites work

• A construction on finite automata that has remained hidden
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Characterization of Glushkov automata
• Derivatives of Regular Expressions
• From regular expressions to deterministic automata
• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• scientific article; zbMATH DE number 557977 (Why is no real title available?)
• scientific article; zbMATH DE number 1773077 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 1929961 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Local languages and the Berry-Sethi algorithm
• Partial derivatives of regular expressions and finite automaton constructions
• Programming Techniques: Regular expression search algorithm
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(9)

• Automata and rational expressions
• Corrigendum to our paper: How Expressions Can Code for Automata
• Non-deterministic finite cover automata
• From tree automata to rational tree expressions
• Kleene Theorems for Synchronous Products with Matching
• Implementation and Application of Automata
• LATIN 2004: Theoretical Informatics
• Constrained multi-tildes
• Constrained multi-tildes: derived term and position automata

Describes a project that uses

Uses Software

• LANGAGE

This page was built for publication: How expressions can code for automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680737)