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
99
click to vote
CSR
2007
Springer
100
views
Theoretical Computer Science
»
more
CSR 2007
»
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
15 years 9 months ago
Download
users.utu.fi
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin
claim paper
Read More »