Detail výsledku

String-Partitioning Systems and An Infinite Hierarchy

KŘIVKA, Z.; SCHÖNECKER, R. String-Partitioning Systems and An Infinite Hierarchy. Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: Marq software s.r.o., 2006. p. 53-60. ISBN: 80-86840-20-4.
Typ
článek ve sborníku konference
Jazyk
angličtina
Autoři
Křivka Zbyněk, Ing., Ph.D., FIT (FIT), UIFS (FIT)
Schönecker Rudolf, Ing., FIT (FIT), UIFS (FIT)
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

URL
Rok
2006
Strany
53–60
Sborník
Proceedings of 1st International Workshop on Formal Models (WFM'06)
Konference
1st International Workshop on Formal Models (WFM'06)
ISBN
80-86840-20-4
Vydavatel
Marq software s.r.o.
Místo
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",
  publisher="Marq software s.r.o.",
  address="Ostrava",
  isbn="80-86840-20-4",
  url="http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-182/paper06.pdf"
}
Projekty
Specifický výzkum, VUT, Vnitřní projekty VUT, SV, zahájení: 2005-01-01, ukončení: 2009-12-31, ukončen
Výzkumné skupiny
Výzkumná skupina formálních modelů (VZ FM)
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru