Publication detail

String-partitioning Systems

KŘIVKA, Z.

Original Title

String-partitioning Systems

Type

article in a collection out of WoS and Scopus

Language

English

Original 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

Authors

KŘIVKA, Z.

RIV year

2005

Released

26. 5. 2005

Publisher

Faculty of Electrical Engineering and Communication BUT

Location

Brno

ISBN

80-214-2942-9

Book

Proceedings of International Interdisciplinary HONEYWELL EMI 2005

Pages from

217

Pages to

221

Pages count

5

URL

http://www.feec.vutbr.cz/EEICT/EMI/2005/sbornik/03-Doctoral_projects/06-Information_Technologies/01-krivka.pdf

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"
}