Implementation and Application of Automata

DOI10.1007/11605157zbMath1172.68526OpenAlexW2544597226MaRDI QIDQ5897662

Jacques Sakarovitch

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11605157

zbMATH Keywords

survey paper

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Rational and Recognisable Power Series ⋮ Finite Automata, Digraph Connectivity, and Regular Expression Size ⋮ Construction of Tree Automata from Regular Expressions ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ On the Average Size of Glushkov’s Automata ⋮ Optimal Lower Bounds on Regular Expression Size Using Communication Complexity ⋮ From Tree Automata to Rational Tree Expressions ⋮ Short Regular Expressions from Finite Automata: Empirical Results ⋮ Construction of tree automata from regular expressions ⋮ Automata and rational expressions

Uses Software

• Vaucanson
• automata

This page was built for publication: Implementation and Application of Automata