REGAL

swMATH791MaRDI QIDQ13539FDOQ13539

Author name not available (Why is that?)

Described by source

• REGAL: A Library to Randomly and Exhaustively Generate Automata

Cited In (18)

• Enumeration and random generation of possibly incomplete deterministic automata
• Average case analysis of Moore's state minimization algorithm
• Generating, sampling and counting subclasses of regular tree languages
• Distribution of the number of accessible states in a random deterministic automaton
• On the average complexity of Moore's state minimization algorithm
• Loops and overloops for tree-walking automata
• How the number of alleles influences gene expression
• Editorial: Recent developments in life and social science applications of capture-recapture methods
• Estimators in capture-recapture studies with two sources
• Random Generation of Deterministic Tree (Walking) Automata
• Condensates in the cosmos: Quantum stabilization of the collapse of relativistic degenerate stars to black holes
• Average complexity of Moore's and Hopcroft's algorithms
• Title not available (Why is that?)
• Parametric random generation of deterministic tree automata
• Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
• Diagnosability verification using LTL model checking
• Integrating multiple learning strategies in first order logics
• Mixture models for capture-recapture count data

This page was built for software: REGAL