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
Strong iteration lemmata for regular, linear, context-free, and linear indexed languages

Strong iteration lemmata for regular, linear, context-free, and linear indexed languages

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1684/1999
BookFundamentals of Computation Theory
DOI10.1007/3-540-48321-7
Copyright1999
ISBN978-3-540-66412-3
DOI10.1007/3-540-48321-7_18
Page829
Subject CollectionComputer Science
SpringerLink DateFriday, January 01, 1999
Add to marked items

Strong iteration lemmata for regular, linear, context-free, and linear indexed languages

Pál Dömösi6 Contact Information and Manfred Kudlek7 Contact Information

(6)  Institute of Mathematics and Informatics, Lajos Kossuth University, Debrecen, Egyetem tèr 1, H-4032, Hungary
(7)  Fachbereich Informatik, Universität Hamburg, Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany
Abstract
New iteration lemmata are presented, generalizing most of the known iteration lemmata for regular, linear, context-free, and linear indexed languages.

Contact Information Pál Dömösi
Email: domosi@math.klte.hu

Contact Information Manfred Kudlek
Email: kudlek@informatik.uni-hamburg.de
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.106 • Server: MPWEB26
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)