The Average State Complexity of the Star of a Finite Set of Words Is Linear

From MaRDI portal
Publication:3533005

DOI10.1007/978-3-540-85780-8_10zbMATH Open1161.68510OpenAlexW1483856029MaRDI QIDQ3533005FDOQ3533005

Frédérique Bassino, Laura Giambruno, Cyril Nicaud

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_10




Recommendations



Cites Work


Cited In (1)





This page was built for publication: The Average State Complexity of the Star of a Finite Set of Words Is Linear

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533005)