Publication Details

Linear n-parallel automata

SCHÖNECKER, R. Linear n-parallel automata. Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1. Brno: Faculty of Information Technology BUT, 2005. p. 274-276. ISBN: 80-214-2888-0.
Czech title
Lineární n-paralelní automaty
Type
conference paper
Language
English
Authors
Schönecker Rudolf, Ing.
URL
Keywords

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

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.

Published
2005
Pages
274–276
Proceedings
Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1
Conference
STUDENT EEICT 2005, Brno, CZ
ISBN
80-214-2888-0
Publisher
Faculty of Information Technology BUT
Place
Brno
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"
}
Back to top