Nelma Moreira

862 total citations
54 papers, 221 citations indexed

About

Nelma Moreira is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Nelma Moreira has authored 54 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 37 papers in Artificial Intelligence and 19 papers in Molecular Biology. Recurrent topics in Nelma Moreira's work include semigroups and automata theory (35 papers), Algorithms and Data Compression (17 papers) and DNA and Biological Computing (15 papers). Nelma Moreira is often cited by papers focused on semigroups and automata theory (35 papers), Algorithms and Data Compression (17 papers) and DNA and Biological Computing (15 papers). Nelma Moreira collaborates with scholars based in Portugal, Canada and Germany. Nelma Moreira's co-authors include Rogério Reis, Eugénio Oliveira, Rubén Romero, Edgar Manuel Carreño Franco, Stavros Konstantinidis, Yuan Gao, Jeffrey Shallit, Sheng Yü, Cezar Câmpeanu and Luı́s Damas and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Nelma Moreira

47 papers receiving 203 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Nelma Moreira Portugal 9 141 140 69 20 18 54 221
Martti Penttonen Finland 10 162 1.1× 216 1.5× 85 1.2× 11 0.6× 103 5.7× 29 337
Moshe Looks United States 9 50 0.4× 132 0.9× 14 0.2× 5 0.3× 29 1.6× 21 178
Gregory V. Bard United States 5 43 0.3× 142 1.0× 18 0.3× 8 0.4× 28 1.6× 9 210
Antti Hyttinen Finland 9 37 0.3× 163 1.2× 37 0.5× 8 0.4× 19 1.1× 29 237
Torbjörn Lager Sweden 7 26 0.2× 201 1.4× 16 0.2× 28 1.4× 46 2.6× 18 274
Ljubomir Perković United States 8 84 0.6× 32 0.2× 23 0.3× 16 0.8× 41 2.3× 23 255
Steffen Hölldobler Germany 12 137 1.0× 412 2.9× 15 0.2× 15 0.8× 46 2.6× 63 465
Dick Grune Netherlands 7 59 0.4× 156 1.1× 21 0.3× 66 3.3× 44 2.4× 22 255
Timothy Mann United States 8 24 0.2× 166 1.2× 8 0.1× 4 0.2× 14 0.8× 33 202
Laurent Miclet France 8 42 0.3× 154 1.1× 18 0.3× 2 0.1× 9 0.5× 34 215

Countries citing papers authored by Nelma Moreira

Since Specialization
Citations

This map shows the geographic impact of Nelma Moreira's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nelma Moreira with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nelma Moreira more than expected).

Fields of papers citing papers by Nelma Moreira

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nelma Moreira. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nelma Moreira. The network helps show where Nelma Moreira may publish in the future.

Co-authorship network of co-authors of Nelma Moreira

This figure shows the co-authorship network connecting the top 25 collaborators of Nelma Moreira. A scholar is included among the top collaborators of Nelma Moreira based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nelma Moreira. Nelma Moreira is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Moreira, Nelma, et al.. (2024). Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution. International Journal of Foundations of Computer Science. 1–18. 1 indexed citations
2.
Moreira, Nelma, et al.. (2023). Location automata for synchronised shuffle expressions. Journal of Logical and Algebraic Methods in Programming. 132. 100847–100847. 1 indexed citations
3.
Konstantinidis, Stavros, et al.. (2021). On the size of partial derivatives and the word membership problem. Acta Informatica. 58(4). 357–375.
4.
Konstantinidis, Stavros, et al.. (2020). Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. International Journal of Foundations of Computer Science. 31(8). 983–1019. 2 indexed citations
5.
Holzer, Markus, et al.. (2019). A mesh of automata. Information and Computation. 265. 94–111. 5 indexed citations
6.
Konstantinidis, Stavros, Nelma Moreira, & Rogério Reis. (2018). Randomized generation of error control codes with automata and transducers. RAIRO - Theoretical Informatics and Applications. 52(2-3-4). 169–184. 1 indexed citations
7.
Câmpeanu, Cezar, Nelma Moreira, & Rogério Reis. (2016). On the dissimilarity operation on finite languages. Open Repository of the University of Porto (University of Porto). 105–120. 2 indexed citations
8.
Moreira, Nelma, Giovanni Pighizzini, & Rogério Reis. (2016). Optimal state reductions of automata with partially specified behaviors. Theoretical Computer Science. 658. 235–245. 2 indexed citations
9.
Câmpeanu, Cezar, Nelma Moreira, & Rogério Reis. (2016). Distinguishability Operations and Closures. Fundamenta Informaticae. 148(3-4). 243–266. 2 indexed citations
10.
Maia, Eva, Nelma Moreira, & Rogério Reis. (2015). Incomplete operational transition complexity of regular languages. Information and Computation. 244. 1–22. 3 indexed citations
11.
Câmpeanu, Cezar, Nelma Moreira, & Rogério Reis. (2014). The Distinguishability Operation On Regular Languages. arXiv (Cornell University). 85–100. 2 indexed citations
12.
Moreira, Nelma, et al.. (2014). A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theoretical Computer Science. 528. 85–100. 5 indexed citations
13.
Moreira, Nelma, et al.. (2014). Deciding Kleene algebra terms equivalence in Coq. Journal of Logical and Algebraic Methods in Programming. 84(3). 377–401. 1 indexed citations
14.
Moreira, Nelma, et al.. (2011). ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH. International Journal of Foundations of Computer Science. 22(7). 1593–1606. 10 indexed citations
15.
Moreira, Nelma, et al.. (2009). Aspects of enumeration and generation with a string automata representation. 58–69.
16.
Moreira, Nelma, et al.. (2008). KAT and PHL in Coq. Computer Science and Information Systems. 5(2). 137–160. 2 indexed citations
17.
Moreira, Nelma, et al.. (2007). Enumeration and generation with a string automata representation. Theoretical Computer Science. 387(2). 93–102. 18 indexed citations
18.
Moreira, Nelma & Rogério Reis. (2005). On the density of languages representing finite set partitions.. Journal of integer sequences. 8(2). 28. 4 indexed citations
19.
Reis, Rogério & Nelma Moreira. (2001). Apoo. ACM SIGCSE Bulletin. 33(4). 43–47. 2 indexed citations
20.
Afsarmanesh, Hamideh, et al.. (1994). Distributed database support for a concurrent engineering environment. UvA-DARE (University of Amsterdam). 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026