INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY (Q4786270)

From MaRDI portal
Revision as of 06:41, 27 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114857089, #quickstatements; #temporary_batch_1706332928950)
scientific article; zbMATH DE number 1845117
Language Label Description Also known as
English
INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
scientific article; zbMATH DE number 1845117

    Statements

    INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY (English)
    0 references
    0 references
    15 December 2002
    0 references
    automata theory
    0 references

    Identifiers