Zobrazeno 1 - 10
of 764
pro vyhledávání: '"Salomaa, Arto"'
Publikováno v:
Fundamenta Informaticae, Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday (November 10, 2024) fi:10876
The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most studied state
Externí odkaz:
http://arxiv.org/abs/2301.03708
Autor:
Salomaa, Arto1 (AUTHOR) asalomaa@utu.fi, Salomaa, Kai2 (AUTHOR) asalomaa@utu.fi, Smith, Taylor J.3 (AUTHOR) tjsmith@stfx.ca
Publikováno v:
Fundamenta Informaticae. 2024, Vol. 191 Issue 3/4, p231-237. 7p.
Autor:
Păun, Gheorghe, Salomaa, Arto
Publikováno v:
The American Mathematical Monthly, 1996 Feb 01. 103(2), 166-168.
Externí odkaz:
https://www.jstor.org/stable/2975113