Publication result detail

Syntactic Complexity of Context-Free Grammars over Word Monoids

MEDUNA, A.

Original Title

Syntactic Complexity of Context-Free Grammars over Word Monoids

English Title

Syntactic Complexity of Context-Free Grammars over Word Monoids

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

The syntactic complexity of context-free grammars defined over word monoids is investigated.

English abstract

The syntactic complexity of context-free grammars defined over word monoids is investigated.

Keywords

syntactic complexity, context-free grammars, word monoids, recursively enumerable languages

Key words in English

syntactic complexity, context-free grammars, word monoids, recursively enumerable languages

Authors

MEDUNA, A.

Released

01.01.1996

Publisher

Springer Verlag

Location

Berlin

Book

Acta Informatica

ISBN

0001-5903

Periodical

ACTA INFORMATICA

Volume

1996

Number

33

State

Federal Republic of Germany

Pages from

457

Pages to

462

Pages count

6

BibTex

@article{BUT191804,
  author="Alexandr {Meduna}",
  title="Syntactic Complexity of Context-Free Grammars over Word Monoids",
  journal="ACTA INFORMATICA",
  year="1996",
  volume="1996",
  number="33",
  pages="457--462",
  issn="0001-5903"
}