Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 777287

From MaRDI portal
Publication:4840163
Jump to:navigation, search

zbMATH Open0826.68079MaRDI QIDQ4840163FDOQ4840163


Authors: Gregor Fritz Edit this on Wikidata


Publication date: 20 July 1995



Title of this publication is not available (Why is that?)



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


zbMATH Keywords

reachabilityfinite automata


Mathematics Subject Classification ID

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



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
  • Title not available (Why is that?)





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4840163&oldid=19176840"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 02:48. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki