Iterated Deterministic Substitution. - Peter R. J. Asveld; Joost Engelfriet (Acta Informatica, 1977)

Controlled Iteration Grammars and Full Hyper-AFL's - Peter R. J. Asveld (Inf. Control., 1977)

Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. - Peter R. J. Asveld; Joost Engelfriet (Acta Informatica, 1979)

Space-Bounded Complexity Classes and Iterated Deterministic Substitution - Peter R. J. Asveld (Inf. Control., 1980)

Complexity Theory and the Operational Structure of Algebraic Programming Systems. - Peter R. J. Asveld; John V. Tucker (Acta Informatica, 1982)

Remarks on defining the complement of a language. - Peter R. J. Asveld (Bull. EATCS, 1984)

On a Post's System of Tag. - Peter R. J. Asveld (Bull. EATCS, 1988)

On the generating power of regularly controlled bidirectional grammars. - Peter R. J. Asveld; Jan Anne Hogendorp (Int. J. Comput. Math., 1991)

Abstract Grammars Based on Transductions. - Peter R. J. Asveld (Theor. Comput. Sci., 1991)

An Alternative Formulation of Cocke-Younger-Kasami's Algorithm. - Peter R. J. Asveld (Bull. EATCS, 1994)

Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition. - Peter R. J. Asveld (Developments in Language Theory, 1995)

A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition. - Peter R. J. Asveld (IWPT, 1995)

Controlled Fuzzy Parallel Rewriting. - Peter R. J. Asveld (New Trends in Formal Languages, 1997)

The Inclusion Problem for Some Subclasses of Context-Free Languages. - Peter R. J. Asveld; Anton Nijholt (Theor. Comput. Sci., 2000)

Some Operators on Families of Fuzzy Languages and Their Monoids. - Peter R. J. Asveld (Words, Semigroups, and Transductions, 2001)

An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchy. - Peter R. J. Asveld (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Algebraic aspects of families of fuzzy languages. - Peter R. J. Asveld (Theor. Comput. Sci., 2003)

Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars. - Peter R. J. Asveld (Theor. Comput. Sci., 2005)

Fuzzy context-free languages - Part 2: Recognition and parsing algorithms. - Peter R. J. Asveld (Theor. Comput. Sci., 2005)

Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form. - Peter R. J. Asveld (J. Autom. Lang. Comb., 2006)

Generating all permutations by context-free grammars in Chomsky normal form. - Peter R. J. Asveld (Theor. Comput. Sci., 2006)

Generating All Circular Shifts by Context-Free Grammars in Greibach Normal Form. - Peter R. J. Asveld (Int. J. Found. Comput. Sci., 2007)

Generating all permutations by context-free grammars in Greibach normal form. - Peter R. J. Asveld (Theor. Comput. Sci., 2008)

Permuting operations on strings and their relation to prime numbers. - Peter R. J. Asveld (Discret. Appl. Math., 2011)

Permuting operations on strings and the distribution of their prime numbers. - Peter R. J. Asveld (Discret. Appl. Math., 2013)