Magic numbers in the state hierarchy of finite automata (Q2461796): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2007.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074307142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on space complexity for contextfree recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the nondeterministic space complexity of context-free recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound for nonregular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space hierarchy theorem revised. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting two-way nondeterministic unary automata into simpler automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of NFAs which need 2\(^{n}-\alpha\) deterministic states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5554980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of reversals of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal order in $S_n$ and $S*_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778922 / rank
 
Normal rank

Latest revision as of 13:20, 27 June 2024

scientific article
Language Label Description Also known as
English
Magic numbers in the state hierarchy of finite automata
scientific article

    Statements

    Magic numbers in the state hierarchy of finite automata (English)
    0 references
    0 references
    21 November 2007
    0 references
    0 references
    descriptional complexity
    0 references
    finite-state automata
    0 references
    regular languages
    0 references
    0 references