Publication detail

On Nondeterminism in Programmed Grammars

MEDUNA, A. VRÁBEL, L. ZEMEK, P.

Original Title

On Nondeterminism in Programmed Grammars

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

In the present paper, we discuss programmed grammars. More specifically, we discuss their nondeterministic behaviour and its reduction. We prove that for every programmed grammar, there exists an equivalent programmed grammar where only a single rule has more than one successor.  Furthermore, we establish an infinite hierarchy of language families resulting from the cardinality of successor sets. Open problem areas are formulated in the conclusion of the paper.

Keywords

Formal languages, Programmed grammars, Nondeterminism, Generative power

Authors

MEDUNA, A.; VRÁBEL, L.; ZEMEK, P.

RIV year

2011

Released

17. 8. 2011

Publisher

Computer and Automation Research Institute, Hungarian Academy of Sciences

Location

Debrecen

ISBN

978-615-5097-19-5

Book

13th International Conference on Automata and Formal Languages

Pages from

316

Pages to

328

Pages count

13

BibTex

@inproceedings{BUT76303,
  author="Alexandr {Meduna} and Lukáš {Vrábel} and Petr {Zemek}",
  title="On Nondeterminism in Programmed Grammars",
  booktitle="13th International Conference on Automata and Formal Languages",
  year="2011",
  pages="316--328",
  publisher="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  address="Debrecen",
  isbn="978-615-5097-19-5"
}