Detail výsledku

String-partitioning Systems

KŘIVKA, Z. String-partitioning Systems. Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3. Brno: Faculty of Electrical Engineering and Communication BUT, 2005. p. 556-560. ISBN: 80-214-2890-2.
Typ
článek ve sborníku konference
Jazyk
angličtina
Autoři
Křivka Zbyněk, Ing., Ph.D., FIT (FIT), UIFS (FIT)
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
URL
Rok
2005
Strany
556–560
Sborník
Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3
Konference
STUDENT EEICT 2005
ISBN
80-214-2890-2
Vydavatel
Faculty of Electrical Engineering and Communication BUT
Místo
Brno
BibTeX 
@inproceedings{BUT192569,
  author="Zbyněk {Křivka}",
  title="String-partitioning Systems",
  booktitle="Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 3",
  year="2005",
  pages="556--560",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="80-214-2890-2",
  url="http://www.feec.vutbr.cz/EEICT/EEICT/2005/sbornik/03-Doktorske_projekty/07-Informacni_systemy/05-krivka.pdf"
}
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru