On context-free languages of scattered words

Z. É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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages142-153
Number of pages12
Volume7410 LNCS
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Context free languages
Context-free Languages
Integer
Language

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z., & Okawa, S. (2012). On context-free languages of scattered words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, 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

On context-free languages of scattered words. / Ésik, Z.; Okawa, Satoshi.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7410 LNCS 2012. p. 142-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7410 LNCS).

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

Ésik, Z & Okawa, S 2012, On context-free languages of scattered words. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7410 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7410 LNCS, pp. 142-153, 16th International Conference on Developments in Language Theory, DLT 2012, Taipei, Taiwan, Province of China, 8/14/12. https://doi.org/10.1007/978-3-642-31653-1_14
Ésik Z, Okawa S. On context-free languages of scattered words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7410 LNCS. 2012. p. 142-153. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-31653-1_14
Ésik, Z. ; Okawa, Satoshi. / On context-free languages of scattered words. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7410 LNCS 2012. pp. 142-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e988e8e417bc458f888b66020641ba6d,
title = "On context-free languages of scattered words",
abstract = "It is known that if a B{\"u}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.",
author = "Z. {\'E}sik and Satoshi Okawa",
year = "2012",
doi = "10.1007/978-3-642-31653-1_14",
language = "English",
isbn = "9783642316524",
volume = "7410 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "142--153",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On context-free languages of scattered words

AU - Ésik, Z.

AU - Okawa, Satoshi

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84864987810&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864987810&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31653-1_14

DO - 10.1007/978-3-642-31653-1_14

M3 - Conference contribution

AN - SCOPUS:84864987810

SN - 9783642316524

VL - 7410 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 142

EP - 153

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -