Enumeration and generation with a string automata representation (Q2465040): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enumeration and random generation of accessible 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: Q4465333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact enumeration of acyclic deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank

Latest revision as of 14:29, 27 June 2024

scientific article
Language Label Description Also known as
English
Enumeration and generation with a string automata representation
scientific article

    Statements

    Enumeration and generation with a string automata representation (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2007
    0 references
    0 references
    finite automata
    0 references
    initially-connected deterministic finite automata
    0 references
    exact enumeration
    0 references
    random generation
    0 references
    minimal automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references