Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Santean, Nicolae"'
Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider
Externí odkaz:
http://arxiv.org/abs/0711.3183
Publikováno v:
In Information and Computation 2009 207(11):1096-1118
Autor:
Brzozowski, Janusz, Santean, Nicolae
Publikováno v:
In Theoretical Computer Science 2009 410(35):3236-3249
Publikováno v:
In Theoretical Computer Science 2009 410(24):2431-2441
Autor:
Câmpeanu, Cezar, Santean, Nicolae
Publikováno v:
In Theoretical Computer Science 2009 410(24):2336-2344
Publikováno v:
In Theoretical Computer Science 2005 330(1):23-34
Publikováno v:
In Discrete Applied Mathematics 2002 117(1):239-252
Autor:
Konstantinidis, Stavros1 (AUTHOR) s.konstantinidis@smu.ca, Santean, Nicolae2 (AUTHOR)
Publikováno v:
International Journal of Computer Mathematics. Aug2009, Vol. 86 Issue 8, p1300-1310. 11p. 3 Diagrams.
Autor:
Câmpeanu, Cezar1 ccampeanu@upei.ca, Santean, Nicolae2 nsantean@iusb.edu
Publikováno v:
Acta Informatica. May2009, Vol. 46 Issue 3, p193-207. 15p.