Publication Details

String-partitioning Systems

KŘIVKA, Z. String-partitioning Systems. In Proceedings of International Interdisciplinary HONEYWELL EMI 2005. Brno: Faculty of Electrical Engineering and Communication BUT, 2005. p. 217-221. ISBN: 80-214-2942-9.
Czech title
Řetězce-rozdělující systémy
Type
conference paper
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D. (DIFS)
URL
Keywords
string-partitioning, systems, languages, finite index, infinite hierarchy, derivation, reduction, programmed grammars, regulated rewritting
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.

Published
2005
Pages
217–221
Proceedings
Proceedings of International Interdisciplinary HONEYWELL EMI 2005
ISBN
80-214-2942-9
Publisher
Faculty of Electrical Engineering and Communication BUT
Place
Brno
BibTeX 
@inproceedings{BUT21501,
  author="Zbyněk {Křivka}",
  title="String-partitioning Systems",
  booktitle="Proceedings of International Interdisciplinary HONEYWELL EMI 2005",
  year="2005",
  pages="217--221",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="80-214-2942-9",
  url="http://www.feec.vutbr.cz/EEICT/EMI/2005/sbornik/03-Doctoral_projects/06-Information_Technologies/01-krivka.pdf"
}
Back to top