Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
109
click to vote
JALC
2006
90
views
more
JALC 2006
»
Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form
15 years 3 months ago
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
Real-time Traffic
Chomsky Normal Form
|
Circular Shifts
|
Grammars
|
JALC 2006
|
claim paper
Related Content
»
Generalized Multitext Grammars
more »
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2006
Where
JALC
Authors
Peter R. J. Asveld
Comments
(0)
Researcher Info
JALC 2008 Study Group
Computer Vision