Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Investigations Into Drosophila Wing Development—Results from a Lindenmayer Model Read chapter Read first chapter

1986 | OriginalPaper | Chapter

The Parikh-Boundedness of Etol Languages of Finite Index

Authors : M. Latteux, A. Terlutte

Published in: The Book of L

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

We prove that ETOL languages of finite index are Parikh-bounded. Namely, every ETOL language of finite index contains a letter-equivalent bounded sublanguage.

previous chapter L Systems and Nlog — Reductions
next chapter Computer Networks with Compact Routing Tables
Metadata
Title
The Parikh-Boundedness of Etol Languages of Finite Index
Authors
M. Latteux
A. Terlutte
Copyright Year
1986
Publisher
Springer Berlin Heidelberg
Book
The Book of L

Print ISBN: 978-3-642-95488-7

Electronic ISBN: 978-3-642-95486-3

Copyright Year: 1986

DOI
https://doi.org/10.1007/978-3-642-95486-3_21

Premium Partner

    Image Credits