BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Portugal
1 × Spain
Collaborated with:
J.Shallit D.Henshall L.Schaeffer H.Mousavi K.Saari N.Rampersad M.Rigo P.Salimov
Talks about:
word (5) automat (4) theorem (3) prove (3) combinator (2) number (2) synchron (1) subword (1) sequenc (1) complex (1)

Person: Daniel Goc

DBLP DBLP: Goc:Daniel

Contributed to:

DLT 20132013
DLT 20132014
LATA 20132013
CIAA 20122012
CIAA 20122013

Wrote 6 papers:

DLT-2013-GocSS #complexity
Subword Complexity and k-Synchronization (DG, LS, JS), pp. 252–263.
DLT-J-2013-GocRRS14 #automation #on the #word
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving) (DG, NR, MR, PS), pp. 1097–1110.
LATA-2013-GocMS #on the
On the Number of Unbordered Factors (DG, HM, JS), pp. 299–310.
LATA-2013-GocSS #automation #sequence #word
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (DG, KS, JS), pp. 311–322.
CIAA-2012-GocHS #automation #combinator #word
Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 180–191.
CIAA-J-2012-GocHS13 #automation #combinator #word
Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 781–798.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.