The following pages link to Nicolae Sântean (Q1763698):
Displayed 22 items.
- Item:Q1763698 (redirect page) (← links)
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- Item:Q1763698 (redirect page) (← links)
- Representation and uniformization of algebraic transductions (Q855271) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- On the intersection of regex languages with regular languages (Q1019712) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On the robustness of primitive words (Q1348393) (← links)
- Mergible states in large NFA (Q1763699) (← links)
- Predictable semiautomata (Q2271459) (← links)
- ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA (Q3065610) (← links)
- Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337) (← links)
- (Q3409996) (← links)
- (Q3517095) (← links)
- On Weakly Ambiguous Finite Transducers (Q3617054) (← links)
- (Q4540971) (← links)
- (Q4654646) (← links)
- (Q4955252) (← links)
- On the definition of stochastic λ-transducers (Q5323205) (← links)
- Deterministic Simulation of a NFA with k–Symbol Lookahead (Q5448798) (← links)
- On implementing recognizable transductions (Q5852138) (← links)
- Minimal cover-automata for finite languages (Q5958721) (← links)