Publication Details

String-Partitioning Systems and An Infinite Hierarchy

KŘIVKA, Z.; SCHÖNECKER, R. String-Partitioning Systems and An Infinite Hierarchy. In Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: 2006. p. 53-60. ISBN: 80-86840-20-4.
Czech title
Řetězce-rozdělující systémy a nekonečná hierarchie
Type
conference paper
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D. (DIFS)
Schönecker Rudolf, Ing.
URL
Keywords

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

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.

Published
2006
Pages
53–60
Proceedings
Proceedings of 1st International Workshop on Formal Models (WFM'06)
ISBN
80-86840-20-4
Place
Ostrava
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"
}
Back to top