Search the dblp DataBase
Nicolae Santean :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nicolae Santean , Sheng Yu On Weakly Ambiguous Finite Transducers. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2006, pp:156-167 [Conf ] Cezar Câmpeanu , Nicolae Santean , Sheng Yu Minimal Cover-Automata for Finite Languages. [Citation Graph (0, 0)][DBLP ] Workshop on Implementing Automata, 1998, pp:43-56 [Conf ] Andrei Paun , Nicolae Santean , Sheng Yu An O(n2 ) Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:243-251 [Conf ] Stavros Konstantinidis , Nicolae Santean , Sheng Yu Representation and uniformization of algebraic transductions. [Citation Graph (0, 0)][DBLP ] Acta Inf., 2007, v:43, n:6, pp:395-417 [Journal ] Gheorghe Paun , Nicolae Santean , Gabriel Thierrin , Sheng Yu On the robustness of primitive words. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:239-252 [Journal ] Nicolae Santean , Sheng Yu Nondeterministic Bimachines and Rational Relations with Finite Codomain. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2006, v:73, n:1-2, pp:237-264 [Journal ] Stavros Konstantinidis , Nicolae Santean , Sheng Yu Fuzzification of Rational and Recognizable Sets. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2007, v:76, n:4, pp:413-447 [Journal ] Nicolae Santean Bimachines and Structurally-Reversed Automata. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:121-146 [Journal ] Cezar Câmpeanu , Nicolae Santean , Sheng Yu Minimal cover-automata for finite languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:267, n:1-2, pp:3-16 [Journal ] Cezar Câmpeanu , Nicolae Santean , Sheng Yu Mergible states in large NFA. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:330, n:1, pp:23-34 [Journal ] Bala Ravikumar , Nicolae Santean Deterministic Simulation of a NFA with k -Symbol Lookahead. [Citation Graph (0, 0)][DBLP ] SOFSEM (1), 2007, pp:488-497 [Conf ] Finite Automata, Palindromes, Powers, and Patterns. [Citation Graph (, )][DBLP ] On the closure of pattern expressions languages under intersection with regular languages. [Citation Graph (, )][DBLP ] Finite automata, palindromes, patterns, and borders [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs