TY - GEN
T1 - Counting Subwords and Regular Languages
AU - Colbourn, Charles
AU - Dougherty, Ryan E.
AU - Lidbetter, Thomas F.
AU - Shallit, Jeffrey
N1 - Publisher Copyright:
© 2018, Springer Nature Switzerland AG.
PY - 2018
Y1 - 2018
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
AN - SCOPUS:85053891796
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
T2 - 22nd International Conference on Developments in Language Theory, DLT 2018
Y2 - 10 September 2018 through 14 September 2018
ER -