On context-free languages of scattered words

Zoltán Ésik, Satoshi Okawa

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

It is known that if a Büchi context-free language (BCFL) consists of scattered words, then there is an integer n, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by n. Every BCFL is a Muller context-free language (MCFL). In the first part of the paper, we prove that an MCFL of scattered words is a BCFL iff the rank of every word in the language is bounded by an integer depending only on the language. Then we establish operational characterizations of the BCFLs of well-ordered and scattered words. We prove that a language is a BCFL consisting of well-ordered words iff it can be generated from the singleton languages containing the letters of the alphabet by substitution into ordinary context-free languages and the -power operation. We also establish a corresponding result for BCFLs of scattered words and define expressions denoting BCFLs of well-ordered and scattered words. In the final part of the paper we give some applications.

Original languageEnglish
Pages (from-to)1029-1047
Number of pages19
JournalInternational Journal of Foundations of Computer Science
Volume24
Issue number7
DOIs
Publication statusPublished - Nov 1 2013

    Fingerprint

Keywords

  • Context-free language
  • Infinite word
  • Linear ordering

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this