Oblivious two-way finite automata: decidability and complexity (Q2252534)

From MaRDI portal
Revision as of 19:12, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Oblivious two-way finite automata: decidability and complexity
scientific article

    Statements

    title
    Oblivious two-way finite automata: decidability and complexity (English)
    0 references
    author
    Martin Kutrib
    0 references
    Andreas Malcher
    0 references
    Giovanni Pighizzini
    0 references
    publication date
    18 July 2014
    0 references
    zbMATH Keywords
    two-way finite automata
    0 references
    oblivious computations
    0 references
    descriptional complexity
    0 references
    decidability
    0 references
    cites work
    Q4139689
    0 references
    Q3938525
    0 references
    Q3102144
    0 references
    Q4449194
    0 references
    Q5192988
    0 references
    Q4133162
    0 references
    Q5192992
    0 references
    Q5554980
    0 references
    Q4055196
    0 references
    Q4218105
    0 references
    Q5541339
    0 references

    Identifiers

    zbMATH DE Number
    6318237
    0 references
    Wikidata QID
    Q61677492
    0 references
    OpenAlex ID
    W1992529316
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2252534&oldid=35399652"
    Powered by MediaWiki