P.R.J. Asveld
Impact in
-
- semigroups and automata theory
- Advanced Algebra and Logic
- Formal Methods in Verification
- Cellular Automata and Applications
- Artificial Intelligence top 10%
- Algorithms and Data Compression
- Logic, programming, and type systems
- Natural Language Processing Techniques
Papers in
-
- semigroups and automata theory 34
- Advanced Algebra and Logic 12
- Formal Methods in Verification 6
- Computability, Logic, AI Algorithms 5
-
- Algorithms and Data Compression 15
- Logic, programming, and type systems 9
- Natural Language Processing Techniques 8
- Co-authors
- Anton Nijholt (3 shared papers)Joost Engelfriet (1 shared paper)John V. Tucker (1 shared paper)
- Journals
- Theoretical Computer Science (7 papers)Acta Informatica (2 papers)Virology (1 paper)Publications mathématiques de l IHÉS (1 paper)International Journal of Foundations of Computer Science (1 paper)
- Partner nations
- NetherlandsUnited States
In The Last Decade
P.R.J. Asveld
52 papers receiving 271 citations
Peers
Comparison fields: 5 of 46
- Computational Theory and Mathematics 221
- Artificial Intelligence 187
- Discrete Mathematics and Combinatorics 9
- Software 7
- Management Science and Operations Research 19
Countries citing papers authored by P.R.J. Asveld
This map shows the geographic impact of P.R.J. Asveld'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 P.R.J. Asveld with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites P.R.J. Asveld more than expected).
Fields of papers citing papers by P.R.J. Asveld
This network shows the impact of papers produced by P.R.J. Asveld. 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 P.R.J. Asveld. The network helps show where P.R.J. Asveld may publish in the future.
Co-authors
The 3 scholars most cited alongside P.R.J. Asveld, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 58 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1977 | 21 | |
| 2 | 2003 | 21 | |
| 3 | 2005 | 19 | |
| 4 | Review of "V. Kreinovich, A. Lakeyev, J. Rohn & R. Kahl, Computational Complexity and Feasibility of Data Processing and Interval Computations (1998), Kluwer, Dordrecht, etc. (Applied Optimization, Volume 10)" | 1999 | 18 |
| 5 | 2005 | 18 | |
| 6 | Review of J.G.Brookshear: Theory of computation - Formal languages, automata and complexity (1989), Benjamin/Cummings, Redwood city, CA | 1991 | 15 |
| 7 | 1987 | 14 | |
| 8 | A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition | 1995 | 12 |
| 9 | 1975 | 10 | |
| 10 | Essays on concepts, formalisms, and tools | 1987 | 10 |
| 11 | 1981 | 10 | |
| 12 | Review of "C. Martin-Vide, V. Mitrana & G. Paun (eds.), Formal Languages and Applications (2004), Springer, Berlin, etc. (Studies in Fuzziness and Soft Computing, Volume 148)" | 2005 | 8 |
| 13 | 1979 | 8 | |
| 14 | 2005 | 7 | |
| 15 | A Bibliography on Fuzzy Automata, Grammars and Lanuages | 1995 | 7 |
| 16 | Review of "R.J.H. van Glabbeek, Comparative Concurrency Semantics and Refinement Actions (1996), CWI, Amsterdam" | 1997 | 5 |
| 17 | Review of "R.E. Stearns & H.B. Hunt III: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata, SIAM J. Comput. 14 (1985) 598-611" | 1987 | 5 |
| 18 | The Non-Self-Embedding Property for Generalized Fuzzy Context-Free Grammars | 1996 | 5 |
| 19 | Towards Robustness in Parsing -- Fuzzifying Context-Free Language Recognition | 1995 | 5 |
| 20 | Review of "G. Buntrock & F. Otto, Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput. 141 (1998) 1-36" | 1999 | 5 |
About P.R.J. Asveld
P.R.J. Asveld is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Molecular Biology, Algebra and Number Theory and Computer Networks and Communications, having authored 58 papers that have together received 289 indexed citations. Recurring topics across this work include semigroups and automata theory (34 papers), DNA and Biological Computing (18 papers), Algorithms and Data Compression (15 papers), Advanced Algebra and Logic (12 papers), Logic, programming, and type systems (9 papers), Natural Language Processing Techniques (8 papers), Formal Methods in Verification (6 papers) and Computability, Logic, AI Algorithms (5 papers). The work is most often cited by research in Computational Theory and Mathematics (221 citations), Artificial Intelligence (187 citations), Discrete Mathematics and Combinatorics (9 citations), Software (7 citations) and Management Science and Operations Research (19 citations). P.R.J. Asveld has collaborated with scholars based in Netherlands and United States. Frequent co-authors include Anton Nijholt, Joost Engelfriet and John V. Tucker. Their work appears in journals such as Theoretical Computer Science, Acta Informatica, Virology, Publications mathématiques de l IHÉS and International Journal of Foundations of Computer Science.
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.