Detail publikace

Grammar Systems of Finite Index

Originální název

Grammar Systems of Finite Index

Anglický název

Grammar Systems of Finite Index

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

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