scientific article

DOI10.4230/LIPIcs.STACS.2012.194zbMath1245.68122MaRDI QIDQ2904761

Cyril Nicaud, Arnaud Carayol

Publication date: 23 August 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite automatarandom samplingaverage complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (6)

Random Deterministic Automata ⋮ On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism ⋮ Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata ⋮ A quadratic algorithm for road coloring ⋮ On the Probability of Being Synchronizable ⋮ Diameter and stationary distribution of random \(r\)-out digraphs

Uses Software

• REGAL

This page was built for publication: