Publication detail

Basic Properties of n-Languages

ČERMÁK, M.

Original Title

Basic Properties of n-Languages

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

control computation, finite automata, pushdown automata, automata system, closure properties

Authors

ČERMÁK, M.

Released

28. 4. 2011

Publisher

Faculty of Information Technology BUT

Location

Brno

ISBN

978-80-214-4273-3

Book

Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3

Pages from

460

Pages to

464

Pages count

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"
}