Detail publikačního výsledku

Start String in Formal Language Theory

RYCHNOVSKÝ, L.

Originální název

Start String in Formal Language Theory

Anglický název

Start String in Formal Language Theory

Druh

Stať ve sborníku mimo WoS a Scopus

Originální abstrakt

The present paper discusses regular-regulated right-linear
grammars with start strings rather than single symbols. It
demonstrates that these grammars with start strings consisting
of no more than n + 1 symbols are stronger than these
grammars with start strings consisting of no more than n
symbols, for all n >= 1.

Anglický abstrakt

The present paper discusses regular-regulated right-linear
grammars with start strings rather than single symbols. It
demonstrates that these grammars with start strings consisting
of no more than n + 1 symbols are stronger than these
grammars with start strings consisting of no more than n
symbols, for all n >= 1.

Klíčová slova

right-linear grammars, regular regulation, infinite hierarchy
of language families

Klíčová slova v angličtině

right-linear grammars, regular regulation, infinite hierarchy
of language families

Autoři

RYCHNOVSKÝ, L.

Rok RIV

2010

Vydáno

20.04.2008

Nakladatel

Faculty of Information Technology BUT

Místo

Brno

ISBN

978-80-214-3617-6

Kniha

Proceedings of the 14th Conference STUDENT EEICT 2008

Strany od

422

Strany do

426

Strany počet

5

BibTex

@inproceedings{BUT30861,
  author="Lukáš {Rychnovský}",
  title="Start String in Formal Language Theory",
  booktitle="Proceedings of the 14th Conference STUDENT EEICT 2008",
  year="2008",
  pages="422--426",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  isbn="978-80-214-3617-6"
}