On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968)

From MaRDI portal
Revision as of 11:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On Pebble Automata for Data Languages with Decidable Emptiness Problem
scientific article

    Statements

    title
    On Pebble Automata for Data Languages with Decidable Emptiness Problem (English)
    0 references
    author
    Tony Tan
    0 references
    publication date
    16 October 2009
    0 references
    Mathematics Subject Classification ID
    68Q45
    0 references
    03B25
    0 references
    03D05
    0 references
    zbMATH DE Number
    5617309
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3182968&oldid=27555650"
    Powered by MediaWiki