formerly: Nicole Sântean
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
15 | EE | Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63 |
2007 | ||
14 | EE | Bala Ravikumar, Nicolae Santean: Deterministic Simulation of a NFA with k -Symbol Lookahead. SOFSEM (1) 2007: 488-497 |
13 | EE | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: Representation and uniformization of algebraic transductions. Acta Inf. 43(6): 395-417 (2007) |
12 | EE | Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit: Finite automata, palindromes, patterns, and borders CoRR abs/0711.3183: (2007) |
11 | EE | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: Fuzzification of Rational and Recognizable Sets. Fundam. Inform. 76(4): 413-447 (2007) |
10 | EE | Bala Ravikumar, Nicolae Santean: On the Existence of Lookahead Delegators for NFA. Int. J. Found. Comput. Sci. 18(5): 949-973 (2007) |
9 | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: A Family of NFAs Free of State Reductions. Journal of Automata, Languages and Combinatorics 12(1-2): 69-78 (2007) | |
2006 | ||
8 | EE | Nicolae Santean, Sheng Yu: On Weakly Ambiguous Finite Transducers. Developments in Language Theory 2006: 156-167 |
7 | EE | Nicolae Santean, Sheng Yu: Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Inform. 73(1-2): 237-264 (2006) |
2005 | ||
6 | EE | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005) |
2004 | ||
5 | Nicolae Santean: Bimachines and Structurally-Reversed Automata. Journal of Automata, Languages and Combinatorics 9(1): 121-146 (2004) | |
2002 | ||
4 | Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu: On the robustness of primitive words. Discrete Applied Mathematics 117(1-3): 239-252 (2002) | |
2001 | ||
3 | EE | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001) |
2000 | ||
2 | EE | Andrei Paun, Nicolae Santean, Sheng Yu: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251 |
1998 | ||
1 | EE | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56 |
1 | Terry Anderson | [12] [15] |
2 | Cezar Câmpeanu | [1] [3] [6] [9] |
3 | Stavros Konstantinidis | [11] [13] |
4 | Andrei Paun | [2] |
5 | Gheorghe Paun | [4] |
6 | Narad Rampersad | [12] [15] |
7 | Bala Ravikumar | [10] [14] |
8 | Jeffrey Shallit | [12] [15] |
9 | Gabriel Thierrin | [4] |
10 | Sheng Yu | [1] [2] [3] [4] [6] [7] [8] [9] [11] [13] |