scientific article; zbMATH DE number 2081039
From MaRDI portal
Publication:4474143
zbMath1050.68087MaRDI QIDQ4474143
Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2214/22140001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages ⋮ On the average state and transition complexity of finite languages ⋮ NFA reduction algorithms by means of regular inequalities ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
This page was built for publication:
