Detail publikace

Linear n-parallel automata

SCHÖNECKER, R.

Originální název

Linear n-parallel automata

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

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.

Klíčová slova

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

Autoři

SCHÖNECKER, R.

Rok RIV

2005

Vydáno

9. 10. 2005

Nakladatel

Faculty of Information Technology BUT

Místo

Brno

ISBN

80-214-2888-0

Kniha

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

Strany od

274

Strany do

276

Strany počet

3

URL

http://www.feec.vutbr.cz/EEICT/EEICT/2005/sbornik/02-Magisterske_projekty/07-Informacni_systemy/11-xschon01.pdf

BibTex

@inproceedings{BUT18911,
  author="Rudolf {Schönecker}",
  title="Linear n-parallel automata",
  booktitle="Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1",
  year="2005",
  pages="274--276",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  isbn="80-214-2888-0",
  url="http://www.feec.vutbr.cz/EEICT/EEICT/2005/sbornik/02-Magisterske_projekty/07-Informacni_systemy/11-xschon01.pdf"
}