Comparing consecutive letter counts in multiple context-free languages

Florian Lehner*, Christian Lindorfer

*Korrespondierende/r Autor/in für diese Arbeit

Publikation: Beitrag in einer FachzeitschriftArtikel

Abstract

Context-free grammars are not able to capture cross-serial dependencies occurring in some natural languages. To overcome this issue, Seki et al. introduced a generalization called m-multiple context-free grammars (m-MCFGs), which deal with m-tuples of strings. We show that m-MCFGs are capable of comparing the number of consecutive occurrences of at most 2m different letters. In particular, the language {a 1 n 1 a 2 n 2 ⋯a 2m+1 n 2m+1 |n 1≥n 2≥…≥n 2m+1≥0} is (m+1)-multiple context-free, but not m-multiple context-free.

Originalspracheenglisch
Seiten (von - bis)1-5
Seitenumfang5
FachzeitschriftTheoretical Computer Science
Jahrgang868
DOIs
PublikationsstatusVeröffentlicht - 8 Mai 2021

ASJC Scopus subject areas

  • !!Theoretical Computer Science
  • !!Computer Science(all)

Fingerprint

Untersuchen Sie die Forschungsthemen von „Comparing consecutive letter counts in multiple context-free languages“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren