Publication detail

String-Partitioning Systems and An Infinite Hierarchy

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

Original Title

String-Partitioning Systems and An Infinite Hierarchy

Type

conference paper

Language

English

Original Abstract

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.

Keywords

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

Authors

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

RIV year

2006

Released

25. 4. 2006

Location

Ostrava

ISBN

80-86840-20-4

Book

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

Pages from

53

Pages to

60

Pages count

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