Nicolae Santean

Publication Activity (10 Years)

Years Active: 1998-2013
Publications (10 Years): 0

Top Topics

Object Oriented Programming

Top Venues

Publications

Stavros Konstantinidis, Nicolae Santean
Computing maximal Kleene closures that are embeddable in a given subword-closed language. Nat. Comput. 12 (2) (2013)
Stavros Konstantinidis, Nicolae Santean
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language. DNA (2011)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
On implementing recognizable transductions. Int. J. Comput. Math. 87 (2) (2010)
Janusz A. Brzozowski, Nicolae Santean
Predictable semiautomata. Theor. Comput. Sci. 410 (35) (2009)
Cezar Câmpeanu, Nicolae Santean
On the intersection of regex languages with regular languages. Theor. Comput. Sci. 410 (24-25) (2009)
Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207 (11) (2009)
Cezar Câmpeanu, Nicolae Santean
On the closure of pattern expressions languages under intersection with regular languages. Acta Informatica 46 (3) (2009)
Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar
State complexity of unique rational operations. Theor. Comput. Sci. 410 (24-25) (2009)
Stavros Konstantinidis, Nicolae Santean
On the definition of stochastic lambda-transducers. Int. J. Comput. Math. 86 (8) (2009)
Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
Finite Automata, Palindromes, Powers, and Patterns. LATA (2008)
Janusz A. Brzozowski, Nicolae Santean
Determinism without Determinization. DCFS (2008)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12 (1-2) (2007)
Bala Ravikumar, Nicolae Santean
On the Existence of Lookahead Delegators for NFA. Int. J. Found. Comput. Sci. 18 (5) (2007)
Bala Ravikumar, Nicolae Santean
-Symbol Lookahead. SOFSEM (1) (2007)
Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
Finite automata, palindromes, patterns, and borders CoRR (2007)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
Fuzzification of Rational and Recognizable Sets. Fundam. Informaticae 76 (4) (2007)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
Representation and uniformization of algebraic transductions. Acta Informatica 43 (6) (2007)
Nicolae Santean, Sheng Yu
Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Informaticae 73 (1-2) (2006)
Nicolae Santean, Sheng Yu
On Weakly Ambiguous Finite Transducers. Developments in Language Theory (2006)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Mergible states in large NFA. Theor. Comput. Sci. 330 (1) (2005)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Large NFA Without Mergeable States. DCFS (2005)
Nicolae Santean
Bimachines and Structurally-Reversed Automata. J. Autom. Lang. Comb. 9 (1) (2004)
Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu
On the robustness of primitive words. Discret. Appl. Math. 117 (1-3) (2002)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Minimal cover-automata for finite languages. Theor. Comput. Sci. 267 (1-2) (2001)
Andrei Paun, Nicolae Santean, Sheng Yu
) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA (2000)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata (1998)