Result Details
String-partitioning Systems
KŘIVKA, Z. String-partitioning Systems. Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3. Brno: Faculty of Electrical Engineering and Communication BUT, 2005. p. 556-560. ISBN: 80-214-2890-2.
Type
conference paper
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D., FIT (FIT), DIFS (FIT)
Abstract
String-partitioning systems, discussed in this contribution, are based on grammatical rules. Each of these rules are a pure context-free rules whose left hand equals to a special symbol, called a {\em bounder}. By this bounder, during every derivation or reduction step, this system divides the current string into several parts. These systems define their languages by deriving or, in contrast, reducing strings by using these rules. An infinite hierarchy of language families is obtained.
Keywords
string-partitioning, systems, languages, finite index, infinite hierarchy, derivation, reduction, programmed grammars, regulated rewritting
URL
Published
2005
Pages
556–560
Proceedings
Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3
Conference
STUDENT EEICT 2005
ISBN
80-214-2890-2
Publisher
Faculty of Electrical Engineering and Communication BUT
Place
Brno
BibTeX
@inproceedings{BUT192569,
author="Zbyněk {Křivka}",
title="String-partitioning Systems",
booktitle="Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3",
year="2005",
pages="556--560",
publisher="Faculty of Electrical Engineering and Communication BUT",
address="Brno",
isbn="80-214-2890-2",
url="http://www.feec.vutbr.cz/EEICT/EEICT/2005/sbornik/03-Doktorske_projekty/07-Informacni_systemy/05-krivka.pdf"
}
Departments