Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Deterministic languages and non-generators

Deterministic languages and non-generators

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 182/1985
BookSTACS 85
DOI10.1007/BFb0023988
Copyright1985
ISBN978-3-540-13912-6
DOI10.1007/BFb0023993
Pages39-46
Subject CollectionComputer Science
SpringerLink DateMonday, April 10, 2006
Add to marked items

Deterministic languages and non-generators

L. Boasson1 and A. Petit2

(1)  UER de Mathématiques et Informatique, Université Paris 7, 2 Place Jussieu, 75005 Paris, France
(2)  15 Résidence des Gemeaux, 94260 Fresnes, France
Abstract
This communication is devoted to the proof of the following results: the family of context-free non-generators cannot be principal with a deterministic generator. A similar result holds for the largest sub-cone of linear languages as well as of one-counter languages.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.113 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)