Random generation of DFAs
type: Item
instance of: scholarly article
title: Random generation of DFAs
zbMATH Open document ID: 1078.68078
author: Jean-Marc Champarnaud
author: Thomas Paranthoën
published in: Theoretical Computer Science
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2136572
zbMATH Keywords: Complete deterministic automata
zbMATH Keywords: Random generation
zbMATH Keywords: Catalan families
zbMATH Keywords: \(m\)-ary trees
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.072
OpenAlex ID: W1969958990
cites work: Q5617548
cites work: Q4430300
cites work: Q5313786
cites work: Q5798359
cites work: A Census of Finite Automata
cites work: Catalan numbers, their generalization, and their uses
cites work: Q4057549
cites work: Q5602940
cites work: Q3659988
cites work: Q4941905
cites work: Q3690227
cites work: Lattice paths not touching a given boundary
cites work: Q4714446
DOI: 10.1016/J.TCS.2004.03.072
Recommended article: Q4994130
Recommended article: Random Generation of Deterministic Acyclic Automata Using the Recursive Method
Recommended article: Random Generation for Finitely Ambiguous Context-free Languages
Recommended article: Q3077339
Recommended article: Parametric random generation of deterministic tree automata
Recommended article: Q5313786
Recommended article: Random Generation of Deterministic Acyclic Automata Using Markov Chains
Recommended article: Random Generation of Deterministic Tree (Walking) Automata
Recommended article: Q3696515
Recommended article: Random Deterministic Automata
description: scientific article; zbMATH DE number 2136572