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).
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-authorship network of co-authors of P.R.J. Asveld
This figure shows the co-authorship network connecting the top 25 collaborators of P.R.J. Asveld.
A scholar is included among the top collaborators of P.R.J. Asveld 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 P.R.J. Asveld. P.R.J. Asveld 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.
Asveld, P.R.J.. (2009). Permuting Operations on Strings: Their Permutations and Their Primes. Data Archiving and Networked Services (DANS).1 indexed citations
2.
Asveld, P.R.J.. (2008). Review of "V. Geffert, C. Mereghetti & G. Pighizzini, Complementing two-way finite automata, Inform. and Comput. 205 (2007) 1173-1187". 4860–4860.2 indexed citations
3.
Asveld, P.R.J.. (2007). Generating All Permutations by Context-Free Grammars in Greibach Normal Form. University of Twente Research Information.1 indexed citations
4.
Asveld, P.R.J.. (2006). Review of "A. Meduna & M. Svec, Grammars with Context Conditions and Their Applications (2005), J. Wiley, Hoboken, NJ". 557–558.2 indexed citations
5.
Asveld, P.R.J.. (2006). Review of "K. Ellul, B. Krawetz, J. Shallit & M.-w. Wang, Regular expressions -- new results and open problems, J. Autom. Lang. Combin 9 (2004) 233-256". 3990–3990.3 indexed citations
6.
Asveld, P.R.J.. (2005). 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)". 6523–6523.8 indexed citations
7.
Asveld, P.R.J.. (2005). Review of "B. Ravikumar, Peg-solitaire, string rewriting systems and finite automata. Theoret. Comput. Sci. 321 (2004) 383-394". University of Twente Research Information. 4425–4425.1 indexed citations
8.
Asveld, P.R.J.. (2001). Review of "G. Paun, Marcus Contextual Grammars (1997), Kluwer, Dordrecht, etc. (Studies in Linguistics and Philosophy, Volume 67)". University of Twente Research Information. 8285–8286.2 indexed citations
9.
Asveld, P.R.J.. (2000). Fuzzy Context- Free Languages. Part 2: Recognition and Parsing Algorithms. University of Twente Research Information.
10.
Asveld, P.R.J.. (1999). Review of "A. Paun, Controlled H systems of small radius. Fund. Inform. 31 (1997) 185-193". University of Twente Research Information. 2769–2769.1 indexed citations
11.
Asveld, P.R.J.. (1999). Review of "G. Buntrock & F. Otto, Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput. 141 (1998) 1-36". 1272–1272.5 indexed citations
12.
Asveld, P.R.J.. (1996). Review of "M.A. Palis & S.M. Shende, Pumping lemmas for the control language hierarchy. Math. Systems Theory 28 (1995) 199-213". 1105–1105.2 indexed citations
13.
Asveld, P.R.J.. (1995). A Bibliography on Fuzzy Automata, Grammars and Lanuages. University of Twente Research Information. 58(58). 187–196.7 indexed citations
14.
Asveld, P.R.J.. (1995). Review of "Y. Shemesh & N. Francez, Finite-state unification automata and relational languages. Inform. and Comput. 114 (1994) 192-213". 6961–6961.1 indexed citations
15.
Asveld, P.R.J.. (1995). A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition. University of Twente Research Information. 14–25.12 indexed citations
16.
Asveld, P.R.J.. (1995). Review of "J. Engelfriet & L. Heyker, Hypergraph languages of bounded degree, J. Comput. System Sci. 48 (1994) 58-89". 4274–4274.1 indexed citations
17.
Asveld, P.R.J.. (1995). Review of "G. Paun & G. Rozenberg, Prescribed teams of grammars. Acta Inform. 31 (1994) 525-537". 6954–6954.1 indexed citations
18.
Asveld, P.R.J.. (1991). Review of J.G.Brookshear: Theory of computation - Formal languages, automata and complexity (1989), Benjamin/Cummings, Redwood city, CA. University of Twente Research Information. 34(34). 181–183.15 indexed citations
19.
Asveld, P.R.J.. (1988). On a Post's System of Tag. University of Twente Research Information. 19(36). 96–102.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.