Scattered context-free linear orderings

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

6 Citations (Scopus)

Abstract

We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages216-227
Number of pages12
Volume6795 LNCS
DOIs
Publication statusPublished - 2011
Event15th International Conference on Developments in Language Theory, DLT 2011 - Milan, Italy
Duration: Jul 19 2011Jul 22 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6795 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th International Conference on Developments in Language Theory, DLT 2011
CountryItaly
CityMilan
Period7/19/117/22/11

Fingerprint

Context free languages
Linear Ordering
Context-free Languages
Exponential time
Context

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z. (2011). Scattered context-free linear orderings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 216-227). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6795 LNCS). https://doi.org/10.1007/978-3-642-22321-1_19

Scattered context-free linear orderings. / Ésik, Z.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6795 LNCS 2011. p. 216-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6795 LNCS).

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

Ésik, Z 2011, Scattered context-free linear orderings. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6795 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6795 LNCS, pp. 216-227, 15th International Conference on Developments in Language Theory, DLT 2011, Milan, Italy, 7/19/11. https://doi.org/10.1007/978-3-642-22321-1_19
Ésik Z. Scattered context-free linear orderings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6795 LNCS. 2011. p. 216-227. (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-22321-1_19
Ésik, Z. / Scattered context-free linear orderings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6795 LNCS 2011. pp. 216-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3c81bdeb9c314396a3b331eff808235a,
title = "Scattered context-free linear orderings",
abstract = "We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.",
author = "Z. {\'E}sik",
year = "2011",
doi = "10.1007/978-3-642-22321-1_19",
language = "English",
isbn = "9783642223204",
volume = "6795 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "216--227",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Scattered context-free linear orderings

AU - Ésik, Z.

PY - 2011

Y1 - 2011

N2 - We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

AB - We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

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

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

U2 - 10.1007/978-3-642-22321-1_19

DO - 10.1007/978-3-642-22321-1_19

M3 - Conference contribution

AN - SCOPUS:79960704312

SN - 9783642223204

VL - 6795 LNCS

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

SP - 216

EP - 227

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

ER -