Sciweavers

3 search results - page 1 / 1

» Generating all permutations by context-free grammars in Grei...

22

TCS
2008

107views Theoretical Computer Science» more TCS 2008»

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

13 years 10 months ago

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

Download eprints.eemcs.utwente.nl

Peter R. J. Asveld

claim paper

Read More »

25

JALC
2006

90views more JALC 2006»

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

13 years 10 months ago

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

Download eprints.eemcs.utwente.nl

-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2

Peter R. J. Asveld

claim paper

Read More »

29

COLING
1992

100views Computational Linguistics» more COLING 1992»

A Generalized Greibach Normal Form for Definite Clause Grammars

14 years 11 hour ago

A Generalized Greibach Normal Form for Definite Clause Grammars

Download acl.ldc.upenn.edu

An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for...

Marc Dymetman

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »