Peter R. J. Asveld

25 papers C 1Journal 20Unranked 4
YearRankTypeTitle / Venue / Authors
2013 J jnl
Permuting operations on strings and the distribution of their prime numbers.
Discret. Appl. Math.
Peter R. J. Asveld
2011 J jnl
Permuting operations on strings and their relation to prime numbers.
Discret. Appl. Math.
Peter R. J. Asveld
2008 J jnl
Generating all permutations by context-free grammars in Greibach normal form.
Theor. Comput. Sci.
Peter R. J. Asveld
2007 J jnl
Generating All Circular Shifts by Context-Free Grammars in Greibach Normal Form.
Int. J. Found. Comput. Sci.
Peter R. J. Asveld
2006 J jnl
Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form.
J. Autom. Lang. Comb.
Peter R. J. Asveld
2006 J jnl
Generating all permutations by context-free grammars in Chomsky normal form.
Theor. Comput. Sci.
Peter R. J. Asveld
2005 J jnl
Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars.
Theor. Comput. Sci.
Peter R. J. Asveld
2005 J jnl
Fuzzy context-free languages - Part 2: Recognition and parsing algorithms.
Theor. Comput. Sci.
Peter R. J. Asveld
2003 J jnl
Algebraic aspects of families of fuzzy languages.
Theor. Comput. Sci.
Peter R. J. Asveld
2001 — conf
An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchy.
Where Mathematics, Computer Science, Linguistics and Biology Meet
Peter R. J. Asveld
2001 — conf
Some Operators on Families of Fuzzy Languages and Their Monoids.
Words, Semigroups, and Transductions
Peter R. J. Asveld
2000 J jnl
The Inclusion Problem for Some Subclasses of Context-Free Languages.
Theor. Comput. Sci.
Peter R. J. Asveld, Anton Nijholt
1997 — conf
Controlled Fuzzy Parallel Rewriting.
New Trends in Formal Languages
Peter R. J. Asveld
1995 — conf
A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition.
IWPT
Peter R. J. Asveld
1995 C conf
Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition.
Developments in Language Theory
Peter R. J. Asveld
1994 J jnl
An Alternative Formulation of Cocke-Younger-Kasami's Algorithm.
Bull. EATCS
Peter R. J. Asveld
1991 J jnl
Abstract Grammars Based on Transductions.
Theor. Comput. Sci.
Peter R. J. Asveld
1991 J jnl
On the generating power of regularly controlled bidirectional grammars.
Int. J. Comput. Math.
Peter R. J. Asveld, Jan Anne Hogendorp
1988 J jnl
On a Post's System of Tag.
Bull. EATCS
Peter R. J. Asveld
1984 J jnl
Remarks on defining the complement of a language.
Bull. EATCS
Peter R. J. Asveld
1982 J jnl
Complexity Theory and the Operational Structure of Algebraic Programming Systems.
Acta Informatica
Peter R. J. Asveld, John V. Tucker
1980 J jnl
Space-Bounded Complexity Classes and Iterated Deterministic Substitution
Inf. Control.
Peter R. J. Asveld
1979 J jnl
Extended Linear Macro Grammars, Iteration Grammars, and Register Programs.
Acta Informatica
Peter R. J. Asveld, Joost Engelfriet
1977 J jnl
Controlled Iteration Grammars and Full Hyper-AFL's
Inf. Control.
Peter R. J. Asveld
1977 J jnl
Iterated Deterministic Substitution.
Acta Informatica
Peter R. J. Asveld, Joost Engelfriet