N. Sântean

Available identifiers

Publication	Date of Publication	Type
Computing maximal Kleene closures that are embeddable in a given subword-closed language	2016-03-10	Paper
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language	2011-09-16	Paper
ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA	2011-01-06	Paper
On implementing recognizable transductions	2010-01-26	Paper
Predictable semiautomata	2009-08-07	Paper
On the definition of stochastic λ-transducers	2009-07-23	Paper
On the intersection of regex languages with regular languages	2009-06-04	Paper
State complexity of unique rational operations	2009-06-04	Paper
On the closure of pattern expressions languages under intersection with regular languages	2009-05-08	Paper
On Weakly Ambiguous Finite Transducers	2009-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q3517095	2008-08-12	Paper
Deterministic Simulation of a NFA with k–Symbol Lookahead	2008-03-07	Paper
Representation and uniformization of algebraic transductions	2007-01-05	Paper
Nondeterministic bimachines and rational relations with finite codomain	2006-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q4654646	2005-03-08	Paper
Mergible states in large NFA	2005-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4540971	2002-07-28	Paper
On the robustness of primitive words	2002-05-15	Paper
Minimal cover-automata for finite languages	2002-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q4955252	2000-05-25	Paper

This page was built for person: N. Sântean