INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY (Q4786270): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114857089, #quickstatements; #temporary_batch_1706332928950 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:19, 8 February 2024
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
15 December 2002
0 references
automata theory
0 references
