Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
ČERMÁK, M.
Originální název
Basic Properties of n-Languages
Anglický název
Druh
Stať ve sborníku mimo WoS a Scopus
Originální abstrakt
This paper investigates theory of n-languages, where n-languages are given by sets of n-tuples of strings.
In the present paper, two n-accepting move-restricted automata systems are defined. The automata systems are given by pushdown or finite automata with move-restricting set. By this set, the systems control which moves can be used at the same time. The paper discuses some basic properties of the class of n-languages defined by the automata systems.
Anglický abstrakt
Klíčová slova
control computation, finite automata, pushdown automata, automata system, closure properties
Klíčová slova v angličtině
Autoři
Vydáno
28.04.2011
Nakladatel
Faculty of Information Technology BUT
Místo
Brno
ISBN
978-80-214-4273-3
Kniha
Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3
Strany od
460
Strany do
464
Strany počet
5
URL
http://www.feec.vutbr.cz/EEICT/2011/sbornik/03-Doktorske%20projekty/08-Informacni%20systemy/01-xcerma16.pdf07-xkoutn11.pdf
BibTex
@inproceedings{BUT91271, author="Martin {Čermák}", title="Basic Properties of n-Languages", booktitle="Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3", year="2011", pages="460--464", publisher="Faculty of Information Technology BUT", address="Brno", isbn="978-80-214-4273-3", url="http://www.feec.vutbr.cz/EEICT/2011/sbornik/03-Doktorske%20projekty/08-Informacni%20systemy/01-xcerma16.pdf07-xkoutn11.pdf" }