Descriptional complexity of regular languages (Q2074214)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Descriptional complexity of regular languages
scientific article

    Statements

    title
    Descriptional complexity of regular languages (English)
    0 references
    DOI
    10.4171/Automata-1/12
    0 references
    author
    Hermann Gruber
    0 references
    Markus Holzer
    0 references
    Martin Kutrib
    0 references
    publication date
    4 February 2022
    0 references
    zbMATH DE Number
    7469510
    0 references
    cites work
    Q4091421
    0 references
    Q5306170
    0 references
    Q4005202
    0 references
    Q5417708
    0 references
    Rankings of Graphs
    0 references
    Q2819381
    0 references
    Q4994941
    0 references
    Q5178449
    0 references
    Theory of átomata
    0 references
    Q4474150
    0 references
    Q4807824
    0 references
    Alternation
    0 references
    Q5437181
    0 references
    Q4590910
    0 references
    Q4531373
    0 references
    Q3862379
    0 references
    Q4337605
    0 references
    Follow automata.
    0 references
    Restarting automata
    0 references
    Q4779161
    0 references
    Q4503150
    0 references
    Q4609331
    0 references
    Q5016365
    0 references
    Q4737155
    0 references
    Q5554980
    0 references
    Q5628039
    0 references
    Q5536277
    0 references
    Q4941905
    0 references
    Q5541339
    0 references
    Q4390537
    0 references
    Q5541340
    0 references
    Q4040284
    0 references
    Q4131648
    0 references
    Q4848749
    0 references
    Q2731279
    0 references
    Q3152811
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2074214&oldid=36764141"
    Powered by MediaWiki