Peter R. J. Asveld

According to our database1, Peter R. J. Asveld authored at least 25 papers between 1977 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Permuting operations on strings and the distribution of their prime numbers.
Discret. Appl. Math., 2013

2011
Permuting operations on strings and their relation to prime numbers.
Discret. Appl. Math., 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.
J. Autom. Lang. Comb., 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
A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition.
Proceedings of the Fourth International Workshop on Parsing Technologies, 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.
Bull. 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.
Bull. EATCS, 1988

1984
Remarks on defining the complement of a language.
Bull. EATCS, 1984

1982
Complexity Theory and the Operational Structure of Algebraic Programming Systems.
Acta Informatica, 1982

1980
Space-Bounded Complexity Classes and Iterated Deterministic Substitution
Inf. Control., March, 1980

1979
Extended Linear Macro Grammars, Iteration Grammars, and Register Programs.
Acta Informatica, 1979

1977
Controlled Iteration Grammars and Full Hyper-AFL's
Inf. Control., July, 1977

Iterated Deterministic Substitution.
Acta Informatica, 1977


  Loading...