Nicolae Santean

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