State complexity of binary coded regular languages (Q6120344)

From MaRDI portal
Revision as of 20:44, 13 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129754596, #quickstatements; #temporary_batch_1726256605485)
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

    title
    State complexity of binary coded regular languages (English)
    0 references
    author
    Viliam Geffert
    0 references
    Dominika Pališínová
    0 references
    Alexander Szabari
    0 references
    publication date
    20 February 2024
    0 references
    zbMATH Keywords
    state complexity
    0 references
    finite automata
    0 references
    don't care automata
    0 references
    prefix codes
    0 references
    promise problems
    0 references

    Identifiers

    zbMATH DE Number
    7807469
    0 references
    OpenAlex ID
    W4390941915
    0 references
    Wikidata QID
    Q129754596
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6120344&oldid=37832617"
    Powered by MediaWiki