Graph Reachability and Pebble Automata over Infinite Alphabets (Q2946705)

From MaRDI portal
Revision as of 10:20, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph Reachability and Pebble Automata over Infinite Alphabets
scientific article

    Statements

    title
    Graph Reachability and Pebble Automata over Infinite Alphabets (English)
    0 references
    author
    Tony Tan
    0 references
    publication date
    17 September 2015
    0 references
    zbMATH Keywords
    graph reachability
    0 references
    infinite alphabets
    0 references
    pebble automata
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    03D05
    0 references
    05C90
    0 references
    zbMATH DE Number
    6483207
    0 references
    OpenAlex ID
    W2164433662
    0 references
    arXiv ID
    1110.2776
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2946705&oldid=33577543"
    Powered by MediaWiki