Nicolae Santean

Nat. Comput., 2013

2011

Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

2010

On implementing recognizable transductions.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

2009

State complexity of unique rational operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the intersection of regex languages with regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Predictable semiautomata.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Theor. Comput. Sci., 2009

On the definition of stochastic lambda-transducers.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

Detecting palindromes, patterns and borders in regular languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

On the closure of pattern expressions languages under intersection with regular languages.

[BibT_eX]

[DOI]

Acta Informatica, 2009

2008

Finite Automata, Palindromes, Powers, and Patterns.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

Determinism without Determinization.

[BibT_eX]

Janusz A. Brzozowski

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

A Family of NFAs Free of State Reductions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

On the Existence of Lookahead Delegators for NFA.

[BibT_eX]

[DOI]

Bala Ravikumar

Int. J. Found. Comput. Sci., 2007

Fuzzification of Rational and Recognizable Sets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Finite automata, palindromes, patterns, and borders

[BibT_eX]

[DOI]

CoRR, 2007

Representation and uniformization of algebraic transductions.

[BibT_eX]

[DOI]

Acta Informatica, 2007

Deterministic Simulation of a NFA with <i>k</i> -Symbol Lookahead.

[BibT_eX]

[DOI]

Bala Ravikumar

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Nondeterministic Bimachines and Rational Relations with Finite Codomain.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

On Weakly Ambiguous Finite Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Mergible states in large NFA.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Large NFA Without Mergeable States.

[BibT_eX]

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.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

2002

On the robustness of primitive words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Minimal cover-automata for finite languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

An O(n<sup>2</sup>) Algorithm for Constructing Minimal Cover Automata for Finite Languages.

[BibT_eX]

[DOI]

Andrei Paun