Automata with Counters that Recognize Word Problems of Free Products (Q5250278)

From MaRDI portal
Revision as of 03:05, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6436989
Language Label Description Also known as
English
Automata with Counters that Recognize Word Problems of Free Products
scientific article; zbMATH DE number 6436989

    Statements

    Automata with Counters that Recognize Word Problems of Free Products (English)
    0 references
    0 references
    0 references
    19 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(G\)-automaton
    0 references
    \(M\)-automaton
    0 references
    word problem
    0 references
    special word problem
    0 references
    free product
    0 references
    context-free language
    0 references
    polycyclic monoid
    0 references
    monoid with right invertible basis
    0 references
    0 references