80
Views
3
CrossRef citations to date
0
Altmetric
Section A

Undecidability of state complexity

, &
Pages 1310-1320 | Received 31 Aug 2011, Accepted 18 Jun 2012, Published online: 25 Jul 2012

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Shunsuke Inenaga & Carlos Martín-Vide. (2013) Foreword. International Journal of Computer Mathematics 90:6, pages 1129-1131.
Read now

Articles from other publishers (2)

Lila Kari & Timothy Ng. 2019. Language and Automata Theory and Applications. Language and Automata Theory and Applications 203 214 .
Da-Jung Cho, Daniel Goč, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis & Kai Salomaa. (2017) State complexity of permutation on finite languages over a binary alphabet. Theoretical Computer Science 682, pages 67-78.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.