Detail publikace

Linear n-parallel automata

Originální název

Linear n-parallel automata

Anglický název

Linear n-parallel automata

Jazyk

en

Originální abstrakt

A linear n-parallel automata represent a simple formal model of parallel abstract machines computing. These automata accept instances of languages with respect to the analogy of restricted parallelism in the linear n-parallel grammars. Under their generative power they constitute an infinite hierarchy of languages which exceeds from bounds of the context free languages.

Anglický abstrakt

A linear n-parallel automata represent a simple formal model of parallel abstract machines computing. These automata accept instances of languages with respect to the analogy of restricted parallelism in the linear n-parallel grammars. Under their generative power they constitute an infinite hierarchy of languages which exceeds from bounds of the context free languages.

BibTex


@inproceedings{BUT18911,
  author="Rudolf {Schönecker}",
  title="Linear n-parallel automata",
  annote="A linear n-parallel automata represent a simple formal model of parallel abstract machines computing. These automata accept instances of languages with respect to the analogy of restricted parallelism in the linear n-parallel grammars. Under their generative power they constitute an infinite hierarchy of languages which exceeds from bounds of the context free languages.",
  address="Faculty of Information Technology BUT",
  booktitle="Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1",
  chapter="18911",
  institution="Faculty of Information Technology BUT",
  year="2005",
  month="october",
  pages="274--276",
  publisher="Faculty of Information Technology BUT",
  type="conference paper"
}