default search action
Nicolae Santean
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j17]Stavros Konstantinidis
, Nicolae Santean:
Computing maximal Kleene closures that are embeddable in a given subword-closed language. Nat. Comput. 12(2): 211-222 (2013) - 2011
- [c8]Stavros Konstantinidis
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language. DNA 2011: 115-129 - 2010
- [j16]Stavros Konstantinidis
On implementing recognizable transductions. Int. J. Comput. Math. 87(2): 260-277 (2010)
2000 – 2009
- 2009
- [j15]Cezar Câmpeanu
On the closure of pattern expressions languages under intersection with regular languages. Acta Informatica 46(3): 193-207 (2009) - [j14]Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207(11): 1096-1118 (2009) - [j13]Stavros Konstantinidis
On the definition of stochastic lambda-transducers. Int. J. Comput. Math. 86(8): 1300-1310 (2009) - [j12]Cezar Câmpeanu
On the intersection of regex languages with regular languages. Theor. Comput. Sci. 410(24-25): 2336-2344 (2009) - [j11]Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar:
State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009) - [j10]Janusz A. Brzozowski, Nicolae Santean:
Predictable semiautomata. Theor. Comput. Sci. 410(35): 3236-3249 (2009) - 2008
- [c7]Janusz A. Brzozowski, Nicolae Santean:
Determinism without Determinization. DCFS 2008: 109-120 - [c6]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63 - 2007
- [j9]Stavros Konstantinidis
Representation and uniformization of algebraic transductions. Acta Informatica 43(6): 395-417 (2007) - [j8]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
Fuzzification of Rational and Recognizable Sets. Fundam. Informaticae 76(4): 413-447 (2007) - [j7]Bala Ravikumar, Nicolae Santean:
On the Existence of Lookahead Delegators for NFA. Int. J. Found. Comput. Sci. 18(5): 949-973 (2007) - [j6]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12(1-2): 69-78 (2007) - [c5]Bala Ravikumar, Nicolae Santean:
Deterministic Simulation of a NFA with k -Symbol Lookahead. SOFSEM (1) 2007: 488-497 - [i1]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite automata, palindromes, patterns, and borders. CoRR abs/0711.3183 (2007) - 2006
- [j5]Nicolae Santean, Sheng Yu:
Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Informaticae 73(1-2): 237-264 (2006) - [c4]Nicolae Santean, Sheng Yu:
On Weakly Ambiguous Finite Transducers. Developments in Language Theory 2006: 156-167 - 2005
- [j4]Cezar Câmpeanu
Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005) - [c3]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Large NFA Without Mergeable States. DCFS 2005: 75-84 - 2004
- [j3]Nicolae Santean:
Bimachines and Structurally-Reversed Automata. J. Autom. Lang. Comb. 9(1): 121-146 (2004) - 2002
- [j2]Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu:
On the robustness of primitive words. Discret. Appl. Math. 117(1-3): 239-252 (2002) - 2001
- [j1]Cezar Câmpeanu
Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001) - 2000
- [c2]Andrei Paun, Nicolae Santean, Sheng Yu:
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251
1990 – 1999
- 1998
- [c1]Cezar Câmpeanu
Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: