PAPeter R. J. Asveld
Peter R. J. Asveld
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Latest Publications
- 21 March 2006
- Published by Elsevier in Theoretical Computer Science
- Vol. 354 (1) , 118-130
Generating all permutations by context-free grammars in Chomsky normal form
- 21 March 2006
- Published by Elsevier in Theoretical Computer Science
- Vol. 354 (1) , 118-130
Generating all permutations by context-free grammars in Chomsky normal form
- 1 November 2005
- Published by Elsevier in Theoretical Computer Science
- Vol. 347 (1-2) , 191-213
Fuzzy context-free languages—Part 2: Recognition and parsing algorithms
- 1 November 2005
- Published by Elsevier in Theoretical Computer Science
- Vol. 347 (1-2) , 191-213
Fuzzy context-free languages—Part 2: Recognition and parsing algorithms
- 20 July 2005
- Published by Elsevier in Theoretical Computer Science
- Vol. 347 (1-2) , 167-190
Fuzzy context-free languages—Part 1: Generalized fuzzy context-free grammars
- 20 July 2005
- Published by Elsevier in Theoretical Computer Science
- Vol. 347 (1-2) , 167-190
Fuzzy context-free languages—Part 1: Generalized fuzzy context-free grammars
- 1 January 2001
- Published by Springer Nature
- p. 175-186
An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy
- 1 January 2001
- Published by Springer Nature
- p. 175-186
An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy
- 1 January 1992
- Published by Springer Nature
- p. 455-475
An Algebraic Approach to Incomparable Families of Formal Languages
- 1 January 1992
- Published by Springer Nature
- p. 455-475
An Algebraic Approach to Incomparable Families of Formal Languages