On the average state and transition complexity of finite languages (Q2465048): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.tcs.2007.07.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068641378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474143 / 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: Q5313785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maxmin problem on finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Transition Complexity of NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete structures 2. Probability theory and statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Latest revision as of 14:29, 27 June 2024

scientific article
Language Label Description Also known as
English
On the average state and transition complexity of finite languages
scientific article

    Statements

    On the average state and transition complexity of finite languages (English)
    0 references
    0 references
    0 references
    19 December 2007
    0 references
    0 references
    finite automata
    0 references
    descriptional complexity
    0 references
    average case complexity
    0 references
    0 references