Inverse Monoids, Trees, and Context-Free Languages (Q4038472)

From MaRDI portal
Revision as of 21:53, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Inverse Monoids, Trees, and Context-Free Languages
scientific article

    Statements

    title
    Inverse Monoids, Trees, and Context-Free Languages (English)
    0 references
    publication date
    16 May 1993
    0 references
    zbMATH Keywords
    automata
    0 references
    formal languages
    0 references
    grammars
    0 references
    universe semigroups
    0 references
    monoids
    0 references
    word problem
    0 references
    infinite binary tree
    0 references
    rational subsets
    0 references
    free group
    0 references
    context-free languages
    0 references
    author
    Stuart W. Margolis
    0 references
    John C. Meakin
    0 references

    Identifiers

    DOI
    10.2307/2154268
    0 references
    Mathematics Subject Classification ID
    20M05
    0 references
    20M18
    0 references
    20M35
    0 references
    68Q45
    0 references
    68Q70
    0 references
    zbMATH DE Number
    169795
    0 references
    OpenAlex ID
    W4235290936
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4038472&oldid=32064777"
    Powered by MediaWiki