Concise representations of regular languages by degree and probabilistic finite automata (Q3142004)

From MaRDI portal
Revision as of 09:53, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Concise representations of regular languages by degree and probabilistic finite automata
scientific article

    Statements

    Concise representations of regular languages by degree and probabilistic finite automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 1993
    0 references
    0 references
    degree automata
    0 references
    finite automata
    0 references
    regular languages
    0 references
    probabilistic automata
    0 references