Nicolae Santean

According to our database1, Nicolae Santean
  • authored at least 26 papers between 1998 and 2013.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2013
Computing maximal Kleene closures that are embeddable in a given subword-closed language.
Natural Computing, 2013

2011
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language.
Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

2010
On implementing recognizable transductions.
Int. J. Comput. Math., 2010

2009
State complexity of unique rational operations.
Theor. Comput. Sci., 2009

On the intersection of regex languages with regular languages.
Theor. Comput. Sci., 2009

Predictable semiautomata.
Theor. Comput. Sci., 2009

On the definition of stochastic lambda-transducers.
Int. J. Comput. Math., 2009

Detecting palindromes, patterns and borders in regular languages.
Inf. Comput., 2009

On the closure of pattern expressions languages under intersection with regular languages.
Acta Inf., 2009

2008
Finite Automata, Palindromes, Powers, and Patterns.
Proceedings of the Language and Automata Theory and Applications, 2008

Determinism without Determinization.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
A Family of NFAs Free of State Reductions.
Journal of Automata, Languages and Combinatorics, 2007

On the Existence of Lookahead Delegators for NFA.
Int. J. Found. Comput. Sci., 2007

Fuzzification of Rational and Recognizable Sets.
Fundam. Inform., 2007

Finite automata, palindromes, patterns, and borders
CoRR, 2007

Representation and uniformization of algebraic transductions.
Acta Inf., 2007

Deterministic Simulation of a NFA with k -Symbol Lookahead.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006
Nondeterministic Bimachines and Rational Relations with Finite Codomain.
Fundam. Inform., 2006

On Weakly Ambiguous Finite Transducers.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Mergible states in large NFA.
Theor. Comput. Sci., 2005

Large NFA Without Mergeable States.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
Bimachines and Structurally-Reversed Automata.
Journal of Automata, Languages and Combinatorics, 2004

2002
On the robustness of primitive words.
Discrete Applied Mathematics, 2002

2001
Minimal cover-automata for finite languages.
Theor. Comput. Sci., 2001

2000
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Proceedings of the Implementation and Application of Automata, 2000

1998
Minimal Cover-Automata for Finite Languages.
Proceedings of the Automata Implementation, 1998


  Loading...