Publication result detail

Regulated Pushdown Automata

KOLÁŘ, D.; MEDUNA, A.

Original Title

Regulated Pushdown Automata

English Title

Regulated Pushdown Automata

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

The paper suggests a new investigation area of the formal languagetheory - regulated automata. Specifically, it investigates pushdownautomata that regulate the use of their rules by control languages. Itproves that this regulation has no effect on the power of pushdownautomata if thecontrol languages are regular. However, the pushdown automata regulatedbylinear control languages characterize the family of recursivelyenumerablelanguages.

English abstract

The paper suggests a new investigation area of the formal languagetheory - regulated automata. Specifically, it investigates pushdownautomata that regulate the use of their rules by control languages. Itproves that this regulation has no effect on the power of pushdownautomata if thecontrol languages are regular. However, the pushdown automata regulatedbylinear control languages characterize the family of recursivelyenumerablelanguages.

Keywords

pushdown automata, regulated accepting, control languages

Key words in English

pushdown automata, regulated accepting, control languages

Authors

KOLÁŘ, D.; MEDUNA, A.

Released

01.01.2000

Publisher

unknown

Location

Szeged

Book

Acta Cybernetica

ISBN

0324-721X

Periodical

Acta Cybernetica

Volume

2000

Number

4

State

Hungary

Pages from

653

Pages to

664

Pages count

12

BibTex

@article{BUT40357,
  author="Dušan {Kolář} and Alexandr {Meduna}",
  title="Regulated Pushdown Automata",
  journal="Acta Cybernetica",
  year="2000",
  volume="2000",
  number="4",
  pages="653--664",
  issn="0324-721X"
}