On context-free languages of scattered words

Zoltan Ésik, Satoshi Okawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (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 or well-ordered words.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 16th International Conference, DLT 2012, Proceedings
Pages142-153
Number of pages12
DOIs
Publication statusPublished - Aug 20 2012
Event16th International Conference on Developments in Language Theory, DLT 2012 - Taipei, Taiwan, Province of China
Duration: Aug 14 2012Aug 17 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7410 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Conference on Developments in Language Theory, DLT 2012
CountryTaiwan, Province of China
CityTaipei
Period8/14/128/17/12

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ésik, Z., & Okawa, S. (2012). On context-free languages of scattered words. In Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings (pp. 142-153). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7410 LNCS). https://doi.org/10.1007/978-3-642-31653-1_14