Separating words by occurrences of subwords

We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.

Saved in:
Bibliographic Details
Published in:Journal of applied and industrial mathematics 2014-04, Vol.8 (2), p.293-299
Main Authors: Vyalyi, M. N., Gimadeev, R. A.
Format: Article
Language:English
Subjects:
Automata theory
Codes
Combinatorics
Complexity
Joints
Lower bounds
Mathematical analysis
Mathematics
Mathematics and Statistics
Polynomials
Separation
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793
cites cdi_FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793
container_end_page 299
container_issue 2
container_start_page 293
container_title Journal of applied and industrial mathematics
container_volume 8
creator Vyalyi, M. N.
Gimadeev, R. A.
description We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.
doi_str_mv 10.1134/S1990478914020161
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1551068233</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3327879641</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793</originalsourceid><addsrcrecordid>eNp1kE9LAzEQxYMoWGo_gLcFL4KsZpJs_hylaBUKHqrnJckmZWW7WZMu0m9vakVE8TSPmd-bGR5C54CvASi7WYFSmAmpgGGCgcMRmuxbJRNKHH9rqU7RLKXWYAqEU87JBF2t3KCj3rb9ungPsUmF2RXB2jFG11uXiuCLNJrP0Rk68bpLbvZVp-jl_u55_lAunxaP89tlaQlnUBKnrLFCew8OCNPCVxzAYtI02uSrzAlhpfKGUalIJVjWmoIEKRvTCEWn6PKwd4jhbXRpW2_aZF3X6d6FMdVQVYC5JJRm9OIX-hrG2OfvMkWpIhxLyBQcKBtDStH5eojtRsddDbjeJ1j_STB7yMGTMtuvXfyx-V_TBygqcBA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1533926081</pqid></control><display><type>article</type><title>Separating words by occurrences of subwords</title><source>ABI/INFORM global</source><source>Springer Nature</source><creator>Vyalyi, M. N. ; Gimadeev, R. A.</creator><creatorcontrib>Vyalyi, M. N. ; Gimadeev, R. A.</creatorcontrib><description>We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.</description><identifier>ISSN: 1990-4789</identifier><identifier>EISSN: 1990-4797</identifier><identifier>DOI: 10.1134/S1990478914020161</identifier><language>eng</language><publisher>Moscow: Pleiades Publishing</publisher><subject>Automata theory ; Codes ; Combinatorics ; Complexity ; Joints ; Lower bounds ; Mathematical analysis ; Mathematics ; Mathematics and Statistics ; Polynomials ; Separation ; Studies</subject><ispartof>Journal of applied and industrial mathematics, 2014-04, Vol.8 (2), p.293-299</ispartof><rights>Pleiades Publishing, Ltd. 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793</citedby><cites>FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/1533926081?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,11668,27903,27904,36039,36040,44342</link.rule.ids></links><search><creatorcontrib>Vyalyi, M. N.</creatorcontrib><creatorcontrib>Gimadeev, R. A.</creatorcontrib><title>Separating words by occurrences of subwords</title><title>Journal of applied and industrial mathematics</title><addtitle>J. Appl. Ind. Math</addtitle><description>We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.</description><subject>Automata theory</subject><subject>Codes</subject><subject>Combinatorics</subject><subject>Complexity</subject><subject>Joints</subject><subject>Lower bounds</subject><subject>Mathematical analysis</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Polynomials</subject><subject>Separation</subject><subject>Studies</subject><issn>1990-4789</issn><issn>1990-4797</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kE9LAzEQxYMoWGo_gLcFL4KsZpJs_hylaBUKHqrnJckmZWW7WZMu0m9vakVE8TSPmd-bGR5C54CvASi7WYFSmAmpgGGCgcMRmuxbJRNKHH9rqU7RLKXWYAqEU87JBF2t3KCj3rb9ungPsUmF2RXB2jFG11uXiuCLNJrP0Rk68bpLbvZVp-jl_u55_lAunxaP89tlaQlnUBKnrLFCew8OCNPCVxzAYtI02uSrzAlhpfKGUalIJVjWmoIEKRvTCEWn6PKwd4jhbXRpW2_aZF3X6d6FMdVQVYC5JJRm9OIX-hrG2OfvMkWpIhxLyBQcKBtDStH5eojtRsddDbjeJ1j_STB7yMGTMtuvXfyx-V_TBygqcBA</recordid><startdate>20140401</startdate><enddate>20140401</enddate><creator>Vyalyi, M. N.</creator><creator>Gimadeev, R. A.</creator><general>Pleiades Publishing</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20140401</creationdate><title>Separating words by occurrences of subwords</title><author>Vyalyi, M. N. ; Gimadeev, R. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Automata theory</topic><topic>Codes</topic><topic>Combinatorics</topic><topic>Complexity</topic><topic>Joints</topic><topic>Lower bounds</topic><topic>Mathematical analysis</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Polynomials</topic><topic>Separation</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Vyalyi, M. N.</creatorcontrib><creatorcontrib>Gimadeev, R. A.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI商业信息数据库</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM global</collection><collection>Computing Database</collection><collection>ProQuest Science Journals</collection><collection>Engineering Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of applied and industrial mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vyalyi, M. N.</au><au>Gimadeev, R. A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Separating words by occurrences of subwords</atitle><jtitle>Journal of applied and industrial mathematics</jtitle><stitle>J. Appl. Ind. Math</stitle><date>2014-04-01</date><risdate>2014</risdate><volume>8</volume><issue>2</issue><spage>293</spage><epage>299</epage><pages>293-299</pages><issn>1990-4789</issn><eissn>1990-4797</eissn><abstract>We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.</abstract><cop>Moscow</cop><pub>Pleiades Publishing</pub><doi>10.1134/S1990478914020161</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1990-4789
ispartof Journal of applied and industrial mathematics, 2014-04, Vol.8 (2), p.293-299
issn 1990-4789
1990-4797
language eng
recordid cdi_proquest_miscellaneous_1551068233
source ABI/INFORM global; Springer Nature
subjects Automata theory
Codes
Combinatorics
Complexity
Joints
Lower bounds
Mathematical analysis
Mathematics
Mathematics and Statistics
Polynomials
Separation
Studies
title Separating words by occurrences of subwords
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T14%3A01%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Separating%20words%20by%20occurrences%20of%20subwords&rft.jtitle=Journal%20of%20applied%20and%20industrial%20mathematics&rft.au=Vyalyi,%20M.%20N.&rft.date=2014-04-01&rft.volume=8&rft.issue=2&rft.spage=293&rft.epage=299&rft.pages=293-299&rft.issn=1990-4789&rft.eissn=1990-4797&rft_id=info:doi/10.1134/S1990478914020161&rft_dat=%3Cproquest_cross%3E3327879641%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2641-2e9cbc7aff1e124a7f5611c02ddab3664e77c89fb4389257489fa318188dbd793%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1533926081&rft_id=info:pmid/&rfr_iscdi=true