Conference paper

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.
Publication language:english
Original title:Linear n-parallel automata
Title (cs):Lineární n-paralelní automaty
Pages:274-276
Proceedings:Proceedings of 11th Conference and Competition STUDENT EEICT 2005 Volume 1
Conference:STUDENT EEICT 2005
Place:Brno, CZ
Year:2005
ISBN:80-214-2888-0
Publisher:Faculty of Information Technology BUT
URL:http://www.feec.vutbr.cz/EEICT/EEICT/2005/sbornik/02-Magisterske_projekty/07-Informacni_systemy/11-xschon01.pdf [PDF]
Keywords
language, grammar, linear grammar, n-parallel grammar, automaton, linear n-parallel automata (n-LA)
Annotation
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{
   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 = {http://www.fit.vutbr.cz/research/view_pub.php?id=7939}
}

Your IPv4 address: 54.80.211.135
Switch to IPv6 connection

DNSSEC [dnssec]