scientific article; zbMATH DE number 6027210
From MaRDI portal
Publication:5389971
DOI10.4230/LIPIcs.STACS.2009.1822zbMath1236.68162MaRDI QIDQ5389971
Julien David, Frédérique Bassino, Cyril Nicaud
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e23f.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Random Deterministic Automata ⋮ Non-redundant random generation algorithms for weighted context-free grammars ⋮ A graph theoretic approach to automata minimality ⋮ Average case analysis of Moore's state minimization algorithm ⋮ Parametric random generation of deterministic tree automata ⋮ Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm ⋮ Aggregation-based minimization of finite state automata ⋮ A Challenging Family of Automata for Classical Minimization Algorithms ⋮ Random Generation of Deterministic Tree (Walking) Automata ⋮ Average complexity of Moore's and Hopcroft's algorithms ⋮ Minimisation of automata
Uses Software
This page was built for publication: