Detail publikačního výsledku

Regulated Pushdown Automata

KOLÁŘ, D.; MEDUNA, A.

Originální název

Regulated Pushdown Automata

Anglický název

Regulated Pushdown Automata

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

pushdown automata, regulated accepting, control languages

Klíčová slova v angličtině

pushdown automata, regulated accepting, control languages

Autoři

KOLÁŘ, D.; MEDUNA, A.

Vydáno

01.01.2000

Nakladatel

unknown

Místo

Szeged

Kniha

Acta Cybernetica

ISSN

0324-721X

Periodikum

Acta Cybernetica

Svazek

2000

Číslo

4

Stát

Maďarsko

Strany od

653

Strany do

664

Strany počet

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