Graph Lemma
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00355431" target="_blank" >RIV/68407700:21240/21:00355431 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/21:10438504
Result on the web
<a href="https://www.isa-afp.org/entries/Combinatorics_Words_Graph_Lemma.html" target="_blank" >https://www.isa-afp.org/entries/Combinatorics_Words_Graph_Lemma.html</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graph Lemma
Original language description
Graph lemma quantifies the defect effect of a system of word equations. That is, it provides an upper bound on the rank of the system. We formalize the proof based on the decomposition of a solution into its free basis. A direct application is an alternative proof of the fact that two noncommuting words form a code.
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA20-20621S" target="_blank" >GA20-20621S: Combinatorics on words formalization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Archive of Formal Proofs
ISSN
2150-914X
e-ISSN
2150-914X
Volume of the periodical
—
Issue of the periodical within the volume
May
Country of publishing house
DE - GERMANY
Number of pages
14
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—