Detail publikace

String-Partitioning Systems and An Infinite Hierarchy

KŘIVKA, Z. SCHÖNECKER, R.

Originální název

String-Partitioning Systems and An Infinite Hierarchy

Typ

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

Jazyk

angličtina

Originální abstrakt

This paper introduces and discusses string-partitioning systems. This formalization consists of partitioning the rewritten string into several parts, which the systems rewrite by rules that specify to which part they are applied.  Based on the number of parts, the present paper establishes an infinite hierarchy of language families that coincides with the hierarchy resulting from the programmed grammars of finite index, so these systems actually represent a counterpart to these grammars.  In its conclusion, this paper suggests  some open problem areas.

Klíčová slova

string-partitioning systems, programmed grammars, finite index, infinite hierarchy

Autoři

KŘIVKA, Z.; SCHÖNECKER, R.

Rok RIV

2006

Vydáno

25. 4. 2006

Místo

Ostrava

ISBN

80-86840-20-4

Kniha

Proceedings of 1st International Workshop on Formal Models (WFM'06)

Strany od

53

Strany do

60

Strany počet

8

BibTex

@inproceedings{BUT22362,
  author="Zbyněk {Křivka} and Rudolf {Schönecker}",
  title="String-Partitioning Systems and An Infinite Hierarchy",
  booktitle="Proceedings of 1st International Workshop on Formal Models (WFM'06)",
  year="2006",
  pages="53--60",
  address="Ostrava",
  isbn="80-86840-20-4"
}