Publication detail

n-Accepting Restricted Pushdown Automata Systems

ČERMÁK, M. MEDUNA, A.

Original Title

n-Accepting Restricted Pushdown Automata Systems

English Title

n-Accepting Restricted Pushdown Automata Systems

Type

conference paper

Language

en

Original Abstract

This paper deals with n-accepting pushdown automata systems, consisting of n components represented by pushdown automata. These systems accept n-languages, consisting of n-strings.  The paper discusses two restricted versions of these systems.  During each step of the accepting process, one version prescribes the components that simultaneously work while the other determines which transition rule can be used in each component.

English abstract

This paper deals with n-accepting pushdown automata systems, consisting of n components represented by pushdown automata. These systems accept n-languages, consisting of n-strings.  The paper discusses two restricted versions of these systems.  During each step of the accepting process, one version prescribes the components that simultaneously work while the other determines which transition rule can be used in each component.

Keywords

restricted automata system, n-generation, n-string, n-language, n-acceptance

RIV year

2011

Released

17.08.2011

Publisher

Computer and Automation Research Institute, Hungarian Academy of Sciences

Location

Nyíregyháza

ISBN

978-615-5097-19-5

Book

13th International Conference on Automata and Formal Languages

Edition

NEUVEDEN

Edition number

NEUVEDEN

Pages from

168

Pages to

183

Pages count

15

Documents

BibTex


@inproceedings{BUT76312,
  author="Martin {Čermák} and Alexandr {Meduna}",
  title="n-Accepting Restricted Pushdown Automata Systems",
  annote="This paper deals with n-accepting pushdown automata systems, consisting of
n components represented by pushdown automata. These systems accept n-languages,
consisting of n-strings.  The paper discusses two restricted versions of these
systems.  During each step of the accepting process, one version prescribes the
components that simultaneously work while the other determines which transition
rule can be used in each component.",
  address="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  booktitle="13th International Conference on Automata and Formal Languages",
  chapter="76312",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  year="2011",
  month="august",
  pages="168--183",
  publisher="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  type="conference paper"
}