scientific article; zbMATH DE number 777287

MaRDI QIDQ4840163zbMATH OpenFDO

Authors Gregor Fritz

Publication date 20 July 1995

zbMATH Keywords

reachabilityfinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The graph structure of a deterministic automaton chosen at random
• Distribution of the number of accessible states in a random deterministic automaton
• Asymptotic enumeration of minimal automata
• Random deterministic automata
• On the probability of being synchronizable

Cited in

(4)

• First-Order Model-Checking in Random Graphs and Complex Networks
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• The graph structure of a deterministic automaton chosen at random
• scientific article; zbMATH DE number 5790349 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840163)