Title of article :
On minimal Sturmian partial words Original Research Article
Author/Authors :
F. Blanchet-Sadri، نويسنده , , John Lensmire، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Pages :
13
From page :
733
To page :
745
Keywords :
Automata and formal languages , Subword complexity , Feasible functions , Partial words , Sturmian words , Combinatorics on words , Graph theory
Journal title :
Discrete Applied Mathematics
Serial Year :
2011
Journal title :
Discrete Applied Mathematics
Record number :
887617
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=887617
بازگشت