On the state complexity of closures and interiors of regular languages with subwords and superwords - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2016

On the state complexity of closures and interiors of regular languages with subwords and superwords

Prateek Karandikar
  • Fonction : Auteur
Matthias Niewerth
  • Fonction : Auteur

Dates et versions

hal-03441921 , version 1 (22-11-2021)

Identifiants

Citer

Philippe Schnoebelen, Prateek Karandikar, Matthias Niewerth. On the state complexity of closures and interiors of regular languages with subwords and superwords. Theoretical Computer Science, 2016, 610, pp.91-107. ⟨10.1016/j.tcs.2015.09.028⟩. ⟨hal-03441921⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

More