## Conference paper

Publication language: KØIVKA Zbynìk. String-partitioning Systems. In: Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3. Brno: Faculty of Electrical Engineering and Communication BUT, 2005, pp. 556-560. ISBN 80-214-2890-2. english String-partitioning Systems Øetìzce-rozdìlující systémy 556-560 Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3 STUDENT EEICT 2005 Brno, CZ 2005 80-214-2890-2 Faculty of Electrical Engineering and Communication BUT http://www.feec.vutbr.cz/EEICT/EEICT/2005/sbornik/03-Doktorske_projekty/07-Informacni_systemy/05-krivka.pdf [PDF] string-partitioning, systems, languages, finite index, infinite hierarchy, derivation, reduction, programmed grammars, regulated rewritting 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. @INPROCEEDINGS{ author = {Zbyn{\v{e}}k K{\v{r}}ivka}, title = {String-partitioning Systems}, pages = {556--560}, booktitle = {Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3}, year = {2005}, location = {Brno, CZ}, publisher = {Faculty of Electrical Engineering and Communication BUT}, ISBN = {80-214-2890-2}, language = {english}, url = {http://www.fit.vutbr.cz/research/view_pub.php?id=7758} }