Counting Subwords and Regular Languages

Charles Colbourn, Ryan E. Dougherty, Thomas F. Lidbetter, Jeffrey Shallit

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

Abstract

Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x’s is less than the number of y’s, resp., is less than or equal). We give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently.

Original languageEnglish (US)
Title of host publicationDevelopments in Language Theory - 22nd International Conference, DLT 2018, Proceedings
EditorsMizuho Hoshi, Shinnosuke Seki
PublisherSpringer Verlag
Pages231-242
Number of pages12
ISBN (Print)9783319986531
DOIs
StatePublished - Jan 1 2018
Event22nd International Conference on Developments in Language Theory, DLT 2018 - Tokyo, Japan
Duration: Sep 10 2018Sep 14 2018

Publication series

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

Other

Other22nd International Conference on Developments in Language Theory, DLT 2018
CountryJapan
CityTokyo
Period9/10/189/14/18

Fingerprint

Subword
Formal languages
Regular Languages
Counting
Necessary Conditions
Sufficient Conditions
Language

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Colbourn, C., Dougherty, R. E., Lidbetter, T. F., & Shallit, J. (2018). Counting Subwords and Regular Languages. In M. Hoshi, & S. Seki (Eds.), Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings (pp. 231-242). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11088 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-98654-8_19

Counting Subwords and Regular Languages. / Colbourn, Charles; Dougherty, Ryan E.; Lidbetter, Thomas F.; Shallit, Jeffrey.

Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. ed. / Mizuho Hoshi; Shinnosuke Seki. Springer Verlag, 2018. p. 231-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11088 LNCS).

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

Colbourn, C, Dougherty, RE, Lidbetter, TF & Shallit, J 2018, Counting Subwords and Regular Languages. in M Hoshi & S Seki (eds), Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11088 LNCS, Springer Verlag, pp. 231-242, 22nd International Conference on Developments in Language Theory, DLT 2018, Tokyo, Japan, 9/10/18. https://doi.org/10.1007/978-3-319-98654-8_19
Colbourn C, Dougherty RE, Lidbetter TF, Shallit J. Counting Subwords and Regular Languages. In Hoshi M, Seki S, editors, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Springer Verlag. 2018. p. 231-242. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-98654-8_19
Colbourn, Charles ; Dougherty, Ryan E. ; Lidbetter, Thomas F. ; Shallit, Jeffrey. / Counting Subwords and Regular Languages. Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. editor / Mizuho Hoshi ; Shinnosuke Seki. Springer Verlag, 2018. pp. 231-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d6f542abbba747d7a0493a703c99345b,
title = "Counting Subwords and Regular Languages",
abstract = "Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x’s is less than the number of y’s, resp., is less than or equal). We give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently.",
author = "Charles Colbourn and Dougherty, {Ryan E.} and Lidbetter, {Thomas F.} and Jeffrey Shallit",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-98654-8_19",
language = "English (US)",
isbn = "9783319986531",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "231--242",
editor = "Mizuho Hoshi and Shinnosuke Seki",
booktitle = "Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings",

}

TY - GEN

T1 - Counting Subwords and Regular Languages

AU - Colbourn, Charles

AU - Dougherty, Ryan E.

AU - Lidbetter, Thomas F.

AU - Shallit, Jeffrey

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x’s is less than the number of y’s, resp., is less than or equal). We give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently.

AB - Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x’s is less than the number of y’s, resp., is less than or equal). We give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently.

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

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

U2 - 10.1007/978-3-319-98654-8_19

DO - 10.1007/978-3-319-98654-8_19

M3 - Conference contribution

SN - 9783319986531

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

SP - 231

EP - 242

BT - Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings

A2 - Hoshi, Mizuho

A2 - Seki, Shinnosuke

PB - Springer Verlag

ER -