# Peter R. J. Asveld

According to our database

Collaborative distances:

^{1}, Peter R. J. Asveld authored at least 24 papers between 1977 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

Permuting operations on strings and the distribution of their prime numbers.

Discrete Applied Mathematics, 2013

2011

Permuting operations on strings and their relation to prime numbers.

Discrete Applied Mathematics, 2011

2008

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

Theor. Comput. Sci., 2008

2007

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

Int. J. Found. Comput. Sci., 2007

2006

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

Theor. Comput. Sci., 2006

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

Journal of Automata, Languages and Combinatorics, 2006

2005

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

Theor. Comput. Sci., 2005

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

Theor. Comput. Sci., 2005

2003

Algebraic aspects of families of fuzzy languages.

Theor. Comput. Sci., 2003

2001

An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchy.

Proceedings of the Where Mathematics, 2001

Some Operators on Families of Fuzzy Languages and Their Monoids.

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

The Inclusion Problem for Some Subclasses of Context-Free Languages.

Theor. Comput. Sci., 2000

1997

Controlled Fuzzy Parallel Rewriting.

Proceedings of the New Trends in Formal Languages, 1997

1995

Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition.

Proceedings of the Developments in Language Theory II, 1995

1994

An Alternative Formulation of Cocke-Younger-Kasami's Algorithm.

Bulletin of the EATCS, 1994

1991

Abstract Grammars Based on Transductions.

Theor. Comput. Sci., 1991

On the generating power of regularly controlled bidirectional grammars.

Int. J. Comput. Math., 1991

1988

On a Post's System of Tag.

Bulletin of the EATCS, 1988

1984

Remarks on defining the complement of a language.

Bulletin of the EATCS, 1984

1982

Complexity Theory and the Operational Structure of Algebraic Programming Systems.

Acta Inf., 1982

1980

Space-Bounded Complexity Classes and Iterated Deterministic Substitution

Information and Control, March, 1980

1979

Extended Linear Macro Grammars, Iteration Grammars, and Register Programs.

Acta Inf., 1979

1977

Controlled Iteration Grammars and Full Hyper-AFL's

Information and Control, July, 1977

Iterated Deterministic Substitution.

Acta Inf., 1977