How expressions can code for automata

DOI10.1051/ita:2005013zbMath1102.68070OpenAlexW2011974006MaRDI QIDQ4680737

Jacques Sakarovitch, Sylvain Lombardy

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

zbMATH Keywords

derived term of an expression

Mathematics Subject Classification ID

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

Related Items (4)

Constrained multi-tildes ⋮ Corrigendum to our paper: How Expressions Can Code for Automata ⋮ Automata and rational expressions ⋮ Kleene Theorems for Synchronous Products with Matching

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• Local languages and the Berry-Sethi algorithm
• A construction on finite automata that has remained hidden
• Regular expressions into finite automata
• Characterization of Glushkov automata
• Canonical derivatives, partial derivatives and finite automaton constructions.
• THE ABSTRACT THEORY OF AUTOMATA
• Programming Techniques: Regular expression search algorithm
• Derivatives of Regular Expressions

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