Peter R. J. Asveld - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2013

Permuting operations on strings and the distribution of their prime numbersPeter R. J. Asveld. DAM, 161(13-14):1868-1881, 2013. [doi]

2011

Permuting operations on strings and their relation to prime numbersPeter R. J. Asveld. DAM, 159(17):1915-1932, 2011. [doi]

2008

Generating all permutations by context-free grammars in Greibach normal formPeter R. J. Asveld. TCS, 409(3):565-577, 2008. [doi]

2007

Generating All Circular Shifts by Context-Free Grammars in Greibach Normal FormPeter R. J. Asveld. ijfcs, 18(6):1139-1149, 2007. [doi]

2006

Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal FormPeter R. J. Asveld. jalc, 11(2):147-159, 2006.

Generating all permutations by context-free grammars in Chomsky normal formPeter R. J. Asveld. TCS, 354(1):118-130, 2006. [doi]

2005

Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammarsPeter R. J. Asveld. TCS, 347(1-2):167-190, 2005. [doi]

Fuzzy context-free languages - Part 2: Recognition and parsing algorithmsPeter R. J. Asveld. TCS, 347(1-2):191-213, 2005. [doi]

2003

Algebraic aspects of families of fuzzy languagesPeter R. J. Asveld. TCS, 293(2):417-445, 2003.

2001

Some Operators on Families of Fuzzy Languages and Their MonoidsPeter R. J. Asveld. BIRTHDAY 2001: 1-14

An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchyPeter R. J. Asveld. BIRTHDAY 2001: 175-186

2000

The Inclusion Problem for Some Subclasses of Context-Free LanguagesPeter R. J. Asveld, Anton Nijholt. TCS, 230(1-2):247-256, 2000. [doi]

1997

Controlled Fuzzy Parallel RewritingPeter R. J. Asveld. BIRTHDAY 1997: 49-70

1995

Towards Robustness in Parsing - Fuzzifying Context-Free Language RecognitionPeter R. J. Asveld. dlt 1995: 443-453

A Fuzzy Approach to Erroneous Inputs in Context-Free Language RecognitionPeter R. J. Asveld. iwpt 1995: 14-25 [doi]

1994

An Alternative Formulation of Cocke-Younger-Kasami s AlgorithmPeter R. J. Asveld. eatcs, 53:213-216, 1994.

1991

Abstract Grammars Based on TransductionsPeter R. J. Asveld. TCS, 81(2):269-288, 1991.

On the generating power of regularly controlled bidirectional grammarsPeter R. J. Asveld, Jan Anne Hogendorp. ijcm, 40(1-2):75-91, 1991. [doi]

1988

On a Post s System of TagPeter R. J. Asveld. eatcs, 36:96-102, 1988.

1984

Remarks on defining the complement of a languagePeter R. J. Asveld. eatcs, 22:5-7, 1984.

1982

Complexity Theory and the Operational Structure of Algebraic Programming SystemsPeter R. J. Asveld, J. V. Tucker. ACTA, 17:451-476, 1982.

1980

Space-Bounded Complexity Classes and Iterated Deterministic SubstitutionPeter R. J. Asveld. iandc, 44(3):282-299, March 1980.

1979

Extended Linear Macro Grammars, Iteration Grammars, and Register ProgramsPeter R. J. Asveld, Joost Engelfriet. ACTA, 11:259-285, 1979.

1977

Controlled Iteration Grammars and Full Hyper-AFL sPeter R. J. Asveld. iandc, 34(3):248-269, July 1977.

Iterated Deterministic SubstitutionPeter R. J. Asveld, Joost Engelfriet. ACTA, 8:285-302, 1977.

Sign in or sign up to see more results.

runs on WebDSL