Detail publikace

String-partitioning Systems

KŘIVKA, Z.

Originální název

String-partitioning Systems

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

string-partitioning, systems, languages, finite index, infinite hierarchy, derivation, reduction, programmed grammars, regulated rewritting

Autoři

KŘIVKA, Z.

Rok RIV

2005

Vydáno

26. 5. 2005

Nakladatel

Faculty of Electrical Engineering and Communication BUT

Místo

Brno

ISBN

80-214-2942-9

Kniha

Proceedings of International Interdisciplinary HONEYWELL EMI 2005

Strany od

217

Strany do

221

Strany počet

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