Concise representations of regular languages by degree and probabilistic finite automata (Q3142004): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Chandra M. R. Kintala / rank
Normal rank
 
Property / author
 
Property / author: Chandra M. R. Kintala / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity properties of probabilistic automata with isolated cut point / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of bounded concurrency I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Goedel speed-up and succinctness of language representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amounts of nondeterminism in finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-languages: A new concept of acceptance / rank
 
Normal rank

Latest revision as of 11:32, 22 May 2024

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