Publication detail

Linear n-parallel automata

SCHÖNECKER, R.

Original Title

Linear n-parallel automata

English Title

Linear n-parallel automata

Type

conference paper

Language

en

Original Abstract

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.

English abstract

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.

Keywords

language, grammar, linear grammar, n-parallel grammar, automaton, linear n-parallel automata (n-LA)

RIV year

2005

Released

09.10.2005

Publisher

Faculty of Information Technology BUT

Location

Brno

ISBN

80-214-2888-0

Book

Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1

Pages from

274

Pages to

276

Pages count

3

URL

Documents

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