On the complexity of a family of k-context-free sequences - Université de La Réunion Access content directly
Journal Articles Theoretical Computer Science Year : 2012

On the complexity of a family of k-context-free sequences

Abstract

no abstract

Dates and versions

hal-01186148 , version 1 (24-08-2015)

Identifiers

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⟩
71 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More