Nicolae Santean, Ph.D. Assistant Professor CV 


Department of Mathematics
      and Computing Science
Saint Mary's University
Halifax NS  B3H 3C3 Canada


Nic Santean
Saint Mary's University  


University of Waterloo

Office: McNally North, MN123

tel (902) 496-8153
fax (902) 420-5035

email
 nic.santean@smu.ca

 University of Western Ontario    


 teaching assignments

Fall 2009 (SMU)
 
Spring 2009 (IU)
  • Analysis of Algorithms C455
  • Introductory C++ Programming  C101
Fall 2008 (IU)
  • Foundations of Digital Computing C251
  • Introduction to Data Structures  C243
  • Introductory C++ Programming  C101
Spring 2008 (IU)
  • Object-Oriented Programming in C++  C201
  • Introductory C++ Programming  C101
Fall 2007 (IU)
  • Foundations of Digital Computing  C251
  • Introductory C++ Programming  C101

 broad research interest:    theory of computation

computability and computational complexity, algorithms and data structures,
automata theory and transducers, formal and programming languages

 recent research topics

state complexity of combined operations on regular languages
deterministic simulation of nondeterministic automata using look-ahead techniques
palindromic regular languages; regular languages consisting of word powers
regex and pattern expression languages

 refereed journal publications

  1. T. Anderson, J. Loftus, N. Rampersad, N. Santean and J. Shallit: "Detecting Palindromes, Patterns and Borders in Regular Languages". Information and Computation, 207, Elsevier 2009, pp. 1096-1118.  [ PDF ]

  2. J. Brzozowski and N. Santean: "Predictable Semiautomata". Theoretical Computer Science, 410 (35), Elsevier 2009, pp. 3236-3249.  [ PDF ]

  3. N. Rampersad, B. Ravikumar, N. Santean and J. Shallit: "State Complexity of Unique Rational Operations". Theoretical Computer Science, 410 (24/25), Elsevier 2009, pp. 2431-2441.  [ PDF ]

  4. C. Campeanu and N. Santean: "On the Closure of Pattern Expression Languages under Intersection with Regular Languages". Acta Informatica, 46 (3), Springer-Verlag 2009, pp. 193-207.  [ PDF ]

  5. S. Konstantinidis and N. Santean, "On the Definition of Stochastic lambda-Transducers". International Journal of Computer Mathematics, 86 (8), Taylor & Francis (2009), pp. 1300-1310.  [ PDF ]

  6. C. Campeanu and N. Santean: "On the Intersection of Regex Languages with Regular Languages". Theoretical Computer Science, 410 (24/25), Elsevier 2009, pp. 2336-2344.  [ PDF ]

  7. S. Konstantinidis, N. Santean and S. Yu: "On Implementing Recognizable Transductions". To appear in International Journal of Computer Mathematics, Taylor and Francis (21 pages). Accepted on January 7, 2008.  [ PDF ]

  8. C. Campeanu, N. Santean and S. Yu: "A Family of NFAs Free of State Reductions". Journal of Automata, Languages and Combinatorics, 12 (1/2), Magdeburg 2007, pp. 69-78.  [ PDF ]

  9. B. Ravikumar and N. Santean: "On the Existence of Lookahead Delegators for NFA". International Journal of Foundations of Computer Science, 18 (5), World Scientific 2007, pp. 949-973.  [ PDF ]

  10. S. Konstantinidis, N. Santean and S. Yu: "Fuzzification of Rational and Recognizable Sets". Fundamenta Informaticae, 76 (4), IOS Press 2007, pp. 413-447.  [ PDF ]

  11. S. Konstantinidis, N. Santean and S. Yu: "Representation and Uniformization of Algebraic Transductions". Acta Informatica, 43 (6), Springer-Verlag 2006, pp. 395-417.  [ PDF ]

  12. N. Santean and S. Yu: "Nondeterministic Bimachines and Rational Relations with Finite Codomain". Fundamenta Informaticae, 73 (1-2), IOS Press 2006, pp. 237-264.  [ PDF ]

  13. C. Campeanu, N. Santean and S. Yu: "Mergible States in Large NFA". Theoretical Computer Science, 330 (1), Elsevier 2005, pp. 23-34.   [ PDF ]

  14. N. Santean: "Bimachines and Structurally-Reversed Automata". Journal of Automata, Languages and Combinatorics, 9 (1), Magdeburg 2004, pp. 121-146.   [ PDF ]

  15. G. Paun, N. Santean, G. Thierrin and S. Yu: "On the Robustness of Primitive Words". Discrete Applied Mathematics, 117 (1-3), Elsevier 2002, pp. 239-252.   [ PDF ]

  16. C. Campeanu, N. Santean and S. Yu: "Minimal Cover-Automata for Finite Languages". Theoretical Computer Science, 267 (1-2), Elsevier 2001, pp. 3-16.  [ PDF ]

 refereed conference publications

  1. J. Brzozowski and N. Santean: "Determinism without Determinization". Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008.

  2. T. Anderson, N. Rampersad, N. Santean and J. Shallit: "Finite Automata, Palindromes, Powers, and Patterns". Proceedings of the 2nd International Conference on Language and Automata Theory and Applications, LATA 2008. LNCS 5196, pp. 52-63 (2008).  [ PDF ]

  3. C. Campeanu and N. Santean: "On Pattern Expression Languages". Automata: from Mathematics to Applications, AutoMathA 2007.   [ PDF ]

  4. B. Ravikumar and N. Santean: "Deterministic Simulation of a NFA with k-symbol Lookahead". 33rd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007. LNCS 4362, pp. 488-497 (2007).  [ PDF ]

  5. N. Santean and S. Yu: "On Weakly Ambiguous Finite Transducers". 10th International Conference on Developments in Language Theory, DLT 2006. LNCS 4036, pp. 156-167 (2006).  [ PDF ]

  6. C. Campeanu, N. Santean and S. Yu: "Large NFA Without Mergible States". 7th Workshop on Descriptional Complexity of Formal Systems, DCFS 2005. Proceedings, pp. 75-84 (2005).  [ PDF ]

  7. A. Paun, N. Santean and S. Yu: "An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages". 5th International Conference on Implementation and Application of Automata, CIAA 2000. LNCS 2088, pp. 243-251 (2001).  [ PDF ]

  8. C. Campeanu, N. Santean and S. Yu: "Minimal Cover-Automata for Finite Languages". 3rd International Workshop on Implementing Automata, WIA 98. LNCS 1660, pp. 43-56 (1999).  [ PDF ]

 seminars

"Web Service Composition: Avoiding Nondeterminism with a Little Foresight". Department of Computer and Information Sciences, Indiana University South Bend, South Bend IN, USA, April 2, 2007.

"A Finite-State Model for Web Services Composition". Department of Mathematics and Computing Science, Saint Mary's University, Halifax NS, Canada, November 2006. (invited talk)

"On Deterministic NFA Simulation with k-Symbols Lookahead". School of Computer Science, University of Waterloo, Waterloo ON, Canada, October 18, 2006.

"On State Reduction for Finite Automata". Department of Computer and Information Sciences, Indiana University South Bend, South Bend IN, USA, March 7, 2006.

"Representation and Uniformization of Algebraic Transductions". Department of Computer Science, The University of Western Ontario, London ON, Canada, December 12, 2005.

"On a Question of Mergibility in Large NFA". Department of Computer Science, The University of Western Ontario, London ON, Canada, March 11, 2005.

 other contributions

C. Campeanu and N. Santean: "New Results on Regex and Pattern Expression Languages". The 6th Congress of Romanian Mathematicians, CRM 2007.

S. Konstantinidis, N. Santean and S. Yu: "Recognizable Transductions, Saturated Transducers and Edit Languages". Technical Report 2005-02, Department of Mathematics and Computing Science, Saint Mary's University, May 2005.   [ PDF ]

N. Santean: "A Model for TI Egress Class Thresholds". Technical Report, Network Traffic Engineering, Nortel Networks, 2002.  [ PDF ]

N. Santean: "On-switch Algorithm Adjustment for XA-CORE". Technical Report, Network Traffic Engineering, Nortel Networks, 2001.  [ PDF , PDF ]

N. Santean: "Traffic Analysis for a Multiplexer with PER-VC Queuing". Technical Report, Network Traffic Engineering, Nortel Networks, 2001.  [ PDF ]

 miscellaneous

my Erdös number is 2 : Nicolae Santean → Jeffrey Shallit → Paul Erdös

favorite quote: [...] In mundo pressuram habetis; sed confidite, Ego vici mundum. - John 16:33