Publication Details

Linear n-parallel automata

SCHÖNECKER Rudolf. Linear n-parallel automata. In: Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1. Brno: Faculty of Information Technology BUT, 2005, pp. 274-276. ISBN 80-214-2888-0.
Czech title
Lineární n-paralelní automaty
Type
conference paper
Language
english
Authors
Schönecker Rudolf, Ing. (DIFS FIT BUT)
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, CZ
BibTeX 
@INPROCEEDINGS{FITPUB7939,
   author = "Rudolf Sch{\"{o}}necker",
   title = "Linear n-parallel automata",
   pages = "274--276",
   booktitle = "Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1",
   year = 2005,
   location = "Brno, CZ",
   publisher = "Faculty of Information Technology BUT",
   ISBN = "80-214-2888-0",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7939"
}
Back to top