Consensual languages and matching finite-state computations (Q3006160)

From MaRDI portal
Revision as of 10:26, 26 August 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
Consensual languages and matching finite-state computations
scientific article

    Statements

    Consensual languages and matching finite-state computations (English)
    0 references
    0 references
    10 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    formal languages
    0 references
    finite automata
    0 references
    consensual languages
    0 references
    counter machines
    0 references
    polynomial time parsing
    0 references
    non-semilinear languages
    0 references
    Parikh mapping
    0 references
    descriptive complexity of regular languages
    0 references
    degree of grammaticality
    0 references