P. Asveld

发表

On Some Controlled ETOL-systems and Languages

P.R.J. Asveld, P. Asveld, 1975 .

Review of "I.I. Macarie, Multihead two-way probabilistic finite automata. Theory Comput. Syst. 30 (1997) 91-109"

P. Asveld, 1997 .

Complete Symmetry in D 2 L Systems and Cellular Automata *

P. Asveld, 2006 .

A note on non-generators of full afl's : (preprint)

J. Engelfriet, P. Asveld, 1981 .

Extensions of Language Families and Canonical Forms for Full AFL-Structures

P. Asveld, 1977 .

Review of J.G.Brookshear: Theory of computation - Formal languages, automata and complexity (1989), Benjamin/Cummings, Redwood city, CA

P.R.J. Asveld, P. Asveld, 1991 .

On grammatical errors and other imperfections

H. Vogler, M. Droste, P. Asveld, 2002 .

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"

Peter R. J. Asveld, P. Asveld, 2006 .

Review of "F.J. Brandenburg, Homomorphic representations of certain classes of languages. Advances in algorithms, languages and complexity, 93-110, Kluwer, Dordrecht, 1997"

P.R.J. Asveld, P. Asveld, 1998 .

A Bibliography on Fuzzy Automata, Grammars and Lanuages

Peter R. J. Asveld, P. Asveld, 1995 .

The Non-Self-Embedding Property for Generalized Fuzzy Context-Free Grammars

Peter R.J. Asveld, P. Asveld, 1996 .

Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars

Peter R. J. Asveld, P. Asveld, 2000, Theor. Comput. Sci..

Algebraic aspects of families of fuzzy languages

Peter R. J. Asveld, P. Asveld, 2001, Theor. Comput. Sci..

Controlled Fuzzy Parallel Rewriting

Peter R. J. Asveld, P. Asveld, 1997, New Trends in Formal Languages.

Extended linear macro grammars, iteration grammars, and register programs

Joost Engelfriet, Peter R. J. Asveld, J. Engelfriet, 1979, Acta Informatica.

Fuzzy context-free languages - Part 2: Recognition and parsing algorithms

Peter R. J. Asveld, P. Asveld, 2000, Theor. Comput. Sci..

A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition

Peter R.J. Asveld, P. Asveld, 1995, IWPT.

Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition

Peter R. J. Asveld, P. Asveld, 1995, Developments in Language Theory.

Generating all permutations by context-free grammars in Greibach normal form

Peter R. J. Asveld, P. Asveld, 2008, Theor. Comput. Sci..

Generating all permutations by context-free grammars in Chomsky normal form

Peter R. J. Asveld, P. Asveld, 2004, Theor. Comput. Sci..

Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form

Peter R. J. Asveld, P. Asveld, 2006, J. Autom. Lang. Comb..

Another Family of Fibonacci-like Sequences

P. Asveld, 1986 .

A Family of Fibonacci-like Sequences

P. Asveld, 1985 .

Iterated deterministic substitution

Joost Engelfriet, Peter R. J. Asveld, J. Engelfriet, 1977, Acta Informatica.

Space-Bounded Complexity Classes and Iterated Deterministic Substitution

Peter R. J. Asveld, P. Asveld, 1980, Inf. Control..

Controlled Iteration Grammars and Full Hyper-AFL's

Peter R.J. Asveld, P. Asveld, 1977, Inf. Control..

An Algebraic Approach to Incomparable Families of Formal Languages

Peter R. J. Asveld, P. Asveld, 1992 .

Permuting operations on strings and their relation to prime numbers

Peter R. J. Asveld, P. Asveld, 2010, Discret. Appl. Math..

The Inclusion Problem for Some Subclasses of Context-Free Languages

Anton Nijholt, Peter R. J. Asveld, A. Nijholt, 1999, Theor. Comput. Sci..

An Inefficient Representation of the Empty Word

P. Asveld, 1996 .

Generating All Circular Shifts by Context-Free Grammars in Greibach Normal Form

Peter R. J. Asveld, P. Asveld, 2007, Int. J. Found. Comput. Sci..

Complexity theory and the operational structure of algebraic programming systems

J. V. Tucker, Peter R. J. Asveld, P. Asveld, 1982, Acta Informatica.

Review of "G. Buntrock & F. Otto, Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput. 141 (1998) 1-36"

P.R.J. Asveld, P. Asveld, 1999 .