Loading…
String matching with simple devices
With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show O ( n 2 / log n ) to be an upper time bound on string matching. This result is tight by a previously known lower bound.
Saved in:
| Published in: | Information processing letters 2007-12, Vol.105 (1), p.32-34 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | |
|---|---|
| cites | cdi_FETCH-LOGICAL-c306t-adf8356050b05fe08186bb80a1bd32b14a392a0044c1bae0d26872895ba70ddf3 |
| container_end_page | 34 |
| container_issue | 1 |
| container_start_page | 32 |
| container_title | Information processing letters |
| container_volume | 105 |
| creator | Petersen, Holger |
| description | With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show
O
(
n
2
/
log
n
)
to be an upper time bound on string matching. This result is tight by a previously known lower bound. |
| doi_str_mv | 10.1016/j.ipl.2007.07.011 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237276465</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019007002037</els_id><sourcerecordid>1365308191</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-adf8356050b05fe08186bb80a1bd32b14a392a0044c1bae0d26872895ba70ddf3</originalsourceid><addsrcrecordid>eNp9UEtLw0AQXkTBWv0B3oriMXFmN9kkeJLiCwoe1POyr9gNaRJ304r_3g0teBM-mDl8j5mPkEuEFAH5bZO6oU0pQJFOQDwiMywLmnDE6pjMACgkgBWckrMQGgDgGStm5Ppt9K77XGzkqNfT8u3G9SK4zdDahbE7p204Jye1bIO9OMw5-Xh8eF8-J6vXp5fl_SrRDPiYSFOXLOeQg4K8tlBiyZUqQaIyjCrMJKuoBMgyjUpaMJTHA8sqV7IAY2o2J1d738H3X1sbRtH0W9_FSEFZQQue8TyScE_Svg_B21oM3m2k_xEIYqpCNCJWIaYqxATEqLk5GMugZVt72WkX_oQV5rykNPLu9jwbv9w560XQznbaGuetHoXp3T8pv5S0cXk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237276465</pqid></control><display><type>article</type><title>String matching with simple devices</title><source>ScienceDirect Freedom Collection</source><source>Elsevier SD Backfile Mathematics</source><source>ScienceDirect Journals</source><creator>Petersen, Holger</creator><creatorcontrib>Petersen, Holger</creatorcontrib><description>With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show
O
(
n
2
/
log
n
)
to be an upper time bound on string matching. This result is tight by a previously known lower bound.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2007.07.011</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Computational complexity ; Computer science; control theory; systems ; Exact sciences and technology ; Miscellaneous ; Simulation ; String matching ; Studies ; Theoretical computing ; Theory of computation</subject><ispartof>Information processing letters, 2007-12, Vol.105 (1), p.32-34</ispartof><rights>2007 Elsevier B.V.</rights><rights>2008 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Dec 31, 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c306t-adf8356050b05fe08186bb80a1bd32b14a392a0044c1bae0d26872895ba70ddf3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0020019007002037$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3429,3564,27924,27925,45972,46003</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19156822$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Petersen, Holger</creatorcontrib><title>String matching with simple devices</title><title>Information processing letters</title><description>With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show
O
(
n
2
/
log
n
)
to be an upper time bound on string matching. This result is tight by a previously known lower bound.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computational complexity</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Miscellaneous</subject><subject>Simulation</subject><subject>String matching</subject><subject>Studies</subject><subject>Theoretical computing</subject><subject>Theory of computation</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNp9UEtLw0AQXkTBWv0B3oriMXFmN9kkeJLiCwoe1POyr9gNaRJ304r_3g0teBM-mDl8j5mPkEuEFAH5bZO6oU0pQJFOQDwiMywLmnDE6pjMACgkgBWckrMQGgDgGStm5Ppt9K77XGzkqNfT8u3G9SK4zdDahbE7p204Jye1bIO9OMw5-Xh8eF8-J6vXp5fl_SrRDPiYSFOXLOeQg4K8tlBiyZUqQaIyjCrMJKuoBMgyjUpaMJTHA8sqV7IAY2o2J1d738H3X1sbRtH0W9_FSEFZQQue8TyScE_Svg_B21oM3m2k_xEIYqpCNCJWIaYqxATEqLk5GMugZVt72WkX_oQV5rykNPLu9jwbv9w560XQznbaGuetHoXp3T8pv5S0cXk</recordid><startdate>20071231</startdate><enddate>20071231</enddate><creator>Petersen, Holger</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20071231</creationdate><title>String matching with simple devices</title><author>Petersen, Holger</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-adf8356050b05fe08186bb80a1bd32b14a392a0044c1bae0d26872895ba70ddf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computational complexity</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Miscellaneous</topic><topic>Simulation</topic><topic>String matching</topic><topic>Studies</topic><topic>Theoretical computing</topic><topic>Theory of computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Petersen, Holger</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Petersen, Holger</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>String matching with simple devices</atitle><jtitle>Information processing letters</jtitle><date>2007-12-31</date><risdate>2007</risdate><volume>105</volume><issue>1</issue><spage>32</spage><epage>34</epage><pages>32-34</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show
O
(
n
2
/
log
n
)
to be an upper time bound on string matching. This result is tight by a previously known lower bound.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2007.07.011</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2007-12, Vol.105 (1), p.32-34 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237276465 |
| source | ScienceDirect Freedom Collection; Elsevier SD Backfile Mathematics; ScienceDirect Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computational complexity Computer science control theory systems Exact sciences and technology Miscellaneous Simulation String matching Studies Theoretical computing Theory of computation |
| title | String matching with simple devices |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T13%3A11%3A07IST&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=String%20matching%20with%20simple%20devices&rft.jtitle=Information%20processing%20letters&rft.au=Petersen,%20Holger&rft.date=2007-12-31&rft.volume=105&rft.issue=1&rft.spage=32&rft.epage=34&rft.pages=32-34&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2007.07.011&rft_dat=%3Cproquest_cross%3E1365308191%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c306t-adf8356050b05fe08186bb80a1bd32b14a392a0044c1bae0d26872895ba70ddf3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=237276465&rft_id=info:pmid/&rfr_iscdi=true |