Computing abelian complexity of binary uniform morphic words.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tcs/Blanchet-SadriS16
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tcs/Blanchet-SadriS16
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Daniel_Seita
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_Wise
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Francine_Blanchet-Sadri
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.tcs.2016.05.046
>
foaf:
homepage
<
https://doi.org/10.1016/j.tcs.2016.05.046
>
dc:
identifier
DBLP journals/tcs/Blanchet-SadriS16
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.tcs.2016.05.046
(xsd:string)
dcterms:
issued
2016
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tcs
>
rdfs:
label
Computing abelian complexity of binary uniform morphic words.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Daniel_Seita
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_Wise
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Francine_Blanchet-Sadri
>
swrc:
pages
41-51
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tcs/Blanchet-SadriS16/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tcs/Blanchet-SadriS16
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tcs/tcs640.html#Blanchet-SadriS16
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.tcs.2016.05.046
>
dc:
title
Computing abelian complexity of binary uniform morphic words.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
640
(xsd:string)