Publication:5389971
From MaRDI portal
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
Related Items
Non-redundant random generation algorithms for weighted context-free grammars, A graph theoretic approach to automata minimality, Average complexity of Moore's and Hopcroft's algorithms, Parametric random generation of deterministic tree automata, Aggregation-based minimization of finite state automata, Minimisation of automata, Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm, Average case analysis of Moore's state minimization algorithm, Random Deterministic Automata, A Challenging Family of Automata for Classical Minimization Algorithms, Random Generation of Deterministic Tree (Walking) Automata
Uses Software