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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
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

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

    Identifiers