On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715)

From MaRDI portal
Revision as of 23:42, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On the descriptional complexity of finite automata with modified acceptance conditions
scientific article

    Statements

    On the descriptional complexity of finite automata with modified acceptance conditions (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    Finite automata
    0 references
    Acceptance conditions
    0 references
    Computational power
    0 references
    Descriptional complexity
    0 references

    Identifiers