Publication detail

Grammar Systems of Finite Index

ELBL, S., MEDUNA, A.

Original Title

Grammar Systems of Finite Index

English Title

Grammar Systems of Finite Index

Type

conference paper

Language

en

Original Abstract

Finite index restriction was already studied for variety of formal models and many results are known. This contribution discusses finite index restriction in grammar systems over one letter alphabet.  It is proved here, that the generative power of such a system is equal to regular languages over one letter alphabet.

English abstract

Finite index restriction was already studied for variety of formal models and many results are known. This contribution discusses finite index restriction in grammar systems over one letter alphabet.  It is proved here, that the generative power of such a system is equal to regular languages over one letter alphabet.

Keywords

Finite index, Grammar, Grammar system, Regular language

RIV year

2004

Released

19.04.2004

Location

Ostrava

ISBN

80-85988-99-2

Book

Proceedings of 7th International Conference ISIM '04

Pages from

141

Pages to

146

Pages count

6

Documents

BibTex


@inproceedings{BUT17115,
  author="Stanislav {Elbl} and Alexandr {Meduna}",
  title="Grammar Systems of Finite Index",
  annote="Finite index restriction was already studied for variety of formal
models and many results are known. This contribution discusses finite
index restriction in grammar systems over one letter alphabet.  It
is proved here, that the generative power of such a system is equal to
regular languages over one letter alphabet.
", booktitle="Proceedings of 7th International Conference ISIM '04", chapter="17115", year="2004", month="april", pages="141--146", type="conference paper" }