Pumping Properties of Path-Restricted Tree-Controlled Languages
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F11%3APU96115" target="_blank" >RIV/00216305:26230/11:PU96115 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Pumping Properties of Path-Restricted Tree-Controlled Languages
Original language description
This paper discusses new kind of a restriction placed on tree-controlled grammars-context-free grammars with some root-to-leaf paths in their derivation trees restricted by a control language. We introduce an n-path restriction and demonstrate that if the control language is linear, there are several families of generated languages depending on the length of common part of restricted paths. Then, the paper introduces several pumping properties of these families.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-214-4305-1
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
61-69
Publisher name
Brno University of Technology
Place of publication
Brno
Event location
Lednice
Event date
Oct 14, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—