Random Generation of Deterministic Acyclic Automata Using Markov Chains (Q5200053): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LANGAGE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W73729413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and random generation of accessible automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Extended Expressions for Acyclic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic automata and small expressions using multi-tilde-bar operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Glushkov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric random generation of deterministic tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact enumeration of acyclic deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Generation of Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating connected acyclic digraphs uniformly at random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank

Latest revision as of 09:10, 4 July 2024

scientific article; zbMATH DE number 5934380
Language Label Description Also known as
English
Random Generation of Deterministic Acyclic Automata Using Markov Chains
scientific article; zbMATH DE number 5934380

    Statements

    Random Generation of Deterministic Acyclic Automata Using Markov Chains (English)
    0 references
    0 references
    0 references
    29 July 2011
    0 references
    0 references
    0 references