State complexity of binary coded regular languages (Q6120344): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2024.114399 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal codes with bounded deciphering delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleene Star on Unary Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alphabetic complexity in homomorphic definitions of word, tree and picture languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic numbers in the state hierarchy of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of binary coded regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAGIC NUMBERS AND TERNARY ALPHABET / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a structural property in the state complexity of projected regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal state reductions of automata with partially specified behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Reduction in Incompletely Specified Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4991691 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129754596 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2024.114399 / rank
 
Normal rank

Latest revision as of 18:39, 30 December 2024

scientific article; zbMATH DE number 7807469
Language Label Description Also known as
English
State complexity of binary coded regular languages
scientific article; zbMATH DE number 7807469

    Statements

    State complexity of binary coded regular languages (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2024
    0 references
    state complexity
    0 references
    finite automata
    0 references
    don't care automata
    0 references
    prefix codes
    0 references
    promise problems
    0 references

    Identifiers