Peter R. J. Asveld

	2011
22		Peter R. J. Asveld: Permuting operations on strings and their relation to prime numbers. Discrete Applied Mathematics 159(17): 1915-1932 (2011)
	2008
21		Peter R. J. Asveld: Generating all permutations by context-free grammars in Greibach normal form. Theor. Comput. Sci. 409(3): 565-577 (2008)
	2007
20		Peter R. J. Asveld: Generating All Circular Shifts by Context-Free Grammars in Greibach Normal Form. Int. J. Found. Comput. Sci. 18(6): 1139-1149 (2007)
	2006
19		Peter R. J. Asveld: Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form. Journal of Automata, Languages and Combinatorics 11(2): 147-159 (2006)
18		Peter R. J. Asveld: Generating all permutations by context-free grammars in Chomsky normal form. Theor. Comput. Sci. 354(1): 118-130 (2006)
	2005
17		Peter R. J. Asveld: Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars. Theor. Comput. Sci. 347(1-2): 167-190 (2005)
16		Peter R. J. Asveld: Fuzzy context-free languages - Part 2: Recognition and parsing algorithms. Theor. Comput. Sci. 347(1-2): 191-213 (2005)
	2003
15		Peter R. J. Asveld: Algebraic aspects of families of fuzzy languages. Theor. Comput. Sci. 293(2): 417-445 (2003)
	2001
14		Peter R. J. Asveld: An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchy. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 175-186
13		Peter R. J. Asveld: Some Operators on Families of Fuzzy Languages and Their Monoids. Words, Semigroups, and Transductions 2001: 1-14
	2000
12		Peter R. J. Asveld, Anton Nijholt: The Inclusion Problem for Some Subclasses of Context-Free Languages. Theor. Comput. Sci. 230(1-2): 247-256 (2000)
	1997
11		Peter R. J. Asveld: Controlled Fuzzy Parallel Rewriting. New Trends in Formal Languages 1997: 49-70
	1995
10		Peter R. J. Asveld: Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition. Developments in Language Theory 1995: 443-453
	1994
9		Peter R. J. Asveld: An Alternative Formulation of Cocke-Younger-Kasami's Algorithm. Bulletin of the EATCS 53: 213-216 (1994)
	1991
8		Peter R. J. Asveld: Abstract Grammars Based on Transductions. Theor. Comput. Sci. 81(2): 269-288 (1991)
	1988
7		Peter R. J. Asveld: On a Post's System of Tag. Bulletin of the EATCS 36: 96-102 (1988)
	1984
6		Peter R. J. Asveld: Remarks on defining the complement of a language. Bulletin of the EATCS 22: 5-7 (1984)
	1982
5		Peter R. J. Asveld, J. V. Tucker: Complexity Theory and the Operational Structure of Algebraic Programming Systems. Acta Inf. 17: 451-476 (1982)
	1980
4		Peter R. J. Asveld: Space-Bounded Complexity Classes and Iterated Deterministic Substitution Information and Control 44(3): 282-299 (1980)
	1979
3		Peter R. J. Asveld, Joost Engelfriet: Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. Acta Inf. 11: 259-285 (1979)
	1977
2		Peter R. J. Asveld, Joost Engelfriet: Iterated Deterministic Substitution. Acta Inf. 8: 285-302 (1977)
1		Peter R. J. Asveld: Controlled Iteration Grammars and Full Hyper-AFL's Information and Control 34(3): 248-269 (1977)

Coauthor Index

1	Joost Engelfriet	[2] [3]
2	Anton Nijholt	[12]
3	J. V. Tucker (John V. Tucker)	[5]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page