On the complexity of a family of k-context-free sequences
Abstract
no abstract
Journal Articles
Theoretical Computer Science
Year : 2012
Nicolas Alarcon : Connect in order to contact the contributor
https://hal.univ-reunion.fr/hal-01186148
Submitted on : Monday, August 24, 2015-2:28:20 PM
Last modification on : Friday, January 21, 2022-3:27:01 AM
Cite
Marion Le Gonidec. On the complexity of a family of k-context-free sequences. Theoretical Computer Science, 2012, 414, pp.47-54. ⟨10.1016/j.tcs.2011.09.022⟩. ⟨hal-01186148⟩
Collections
69
View
0
Download