Succinct representation for (non)deterministic finite automata

Succinct representation for (non)deterministic finite automata

(Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any deterministic automaton D having n states over a σ-letter alphabet Σ us...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences 2023-02, Vol.131, p.1-12
Hauptverfasser: Chakraborty, Sankardeep, Grossi, Roberto, Sadakane, Kunihiko, Satti, Srinivasa Rao
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Deterministic finite automata
Encoding
Succinct data structures
Time-space tradeoff
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 12
container_issue
container_start_page 1
container_title Journal of computer and system sciences
container_volume 131
creator Chakraborty, Sankardeep
Grossi, Roberto
Sadakane, Kunihiko
Satti, Srinivasa Rao
description (Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any deterministic automaton D having n states over a σ-letter alphabet Σ using (σ−1)nlog⁡n(1+o(1)) bits, that determines, given a string x, whether D accepts x in optimal O(|x|) time. We also consider the case when there are N
doi_str_mv 10.1016/j.jcss.2022.07.002
format Article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_03913681v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0022000022000526</els_id><sourcerecordid>oai_HAL_hal_03913681v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c378t-b16bf4a72646982f4b815b8421e52e2c9ff290a9e86de3433dec37f9d2ada3bd3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKt_wNMe7WHXyWS7HyBCKWqFggf1HLLJBFPa3ZKkBf-9WSoencsML_MMzMPYLYeCA6_uN8VGh1AgIBZQFwB4xiYcWsixxvKcTVKCOaS6ZFchbAA4n1diwh7fD1q7XsfM095ToD6q6IY-s4PP7vqhnxmK5HeudyE6ndk0RMrUIQ47FdU1u7BqG-jmt0_Z5_PTx3KVr99eXpeLda5F3cS841VnS1VjVVZtg7bsGj7vmhI5zZFQt9ZiC6qlpjIkSiEMJdC2BpVRojNiymanu19qK_fe7ZT_loNycrVYyzED0XJRNfzI0y6edrUfQvBk_wAOcrQlN3K0JUdbEmqZ3CTo4QRR-uLoyMugHfWajPOkozSD-w__Ab1sc1Y</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Succinct representation for (non)deterministic finite automata</title><source>Elsevier ScienceDirect Journals</source><creator>Chakraborty, Sankardeep ; Grossi, Roberto ; Sadakane, Kunihiko ; Satti, Srinivasa Rao</creator><creatorcontrib>Chakraborty, Sankardeep ; Grossi, Roberto ; Sadakane, Kunihiko ; Satti, Srinivasa Rao</creatorcontrib><description>(Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any deterministic automaton D having n states over a σ-letter alphabet Σ using (σ−1)nlog⁡n(1+o(1)) bits, that determines, given a string x, whether D accepts x in optimal O(|x|) time. We also consider the case when there are N&lt;σn non-failure transitions, and obtain various time-space trade-offs. Here some of our results are better than the recent work of Cotumaccio and Prezza (SODA 2021). We also exhibit a data structure for non-deterministic automaton N using σn2+n bits that takes O(n2|x|) time for string membership checking. Finally, we also provide time and space efficient algorithms for performing several standard operations on the languages accepted by finite automata.</description><identifier>ISSN: 0022-0000</identifier><identifier>EISSN: 1090-2724</identifier><identifier>DOI: 10.1016/j.jcss.2022.07.002</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Computer Science ; Deterministic finite automata ; Encoding ; Succinct data structures ; Time-space tradeoff</subject><ispartof>Journal of computer and system sciences, 2023-02, Vol.131, p.1-12</ispartof><rights>2022 The Author(s)</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c378t-b16bf4a72646982f4b815b8421e52e2c9ff290a9e86de3433dec37f9d2ada3bd3</citedby><cites>FETCH-LOGICAL-c378t-b16bf4a72646982f4b815b8421e52e2c9ff290a9e86de3433dec37f9d2ada3bd3</cites><orcidid>0000-0003-0636-9880</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.jcss.2022.07.002$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>230,314,776,780,881,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttps://inria.hal.science/hal-03913681$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Chakraborty, Sankardeep</creatorcontrib><creatorcontrib>Grossi, Roberto</creatorcontrib><creatorcontrib>Sadakane, Kunihiko</creatorcontrib><creatorcontrib>Satti, Srinivasa Rao</creatorcontrib><title>Succinct representation for (non)deterministic finite automata</title><title>Journal of computer and system sciences</title><description>(Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any deterministic automaton D having n states over a σ-letter alphabet Σ using (σ−1)nlog⁡n(1+o(1)) bits, that determines, given a string x, whether D accepts x in optimal O(|x|) time. We also consider the case when there are N&lt;σn non-failure transitions, and obtain various time-space trade-offs. Here some of our results are better than the recent work of Cotumaccio and Prezza (SODA 2021). We also exhibit a data structure for non-deterministic automaton N using σn2+n bits that takes O(n2|x|) time for string membership checking. Finally, we also provide time and space efficient algorithms for performing several standard operations on the languages accepted by finite automata.</description><subject>Computer Science</subject><subject>Deterministic finite automata</subject><subject>Encoding</subject><subject>Succinct data structures</subject><subject>Time-space tradeoff</subject><issn>0022-0000</issn><issn>1090-2724</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKt_wNMe7WHXyWS7HyBCKWqFggf1HLLJBFPa3ZKkBf-9WSoencsML_MMzMPYLYeCA6_uN8VGh1AgIBZQFwB4xiYcWsixxvKcTVKCOaS6ZFchbAA4n1diwh7fD1q7XsfM095ToD6q6IY-s4PP7vqhnxmK5HeudyE6ndk0RMrUIQ47FdU1u7BqG-jmt0_Z5_PTx3KVr99eXpeLda5F3cS841VnS1VjVVZtg7bsGj7vmhI5zZFQt9ZiC6qlpjIkSiEMJdC2BpVRojNiymanu19qK_fe7ZT_loNycrVYyzED0XJRNfzI0y6edrUfQvBk_wAOcrQlN3K0JUdbEmqZ3CTo4QRR-uLoyMugHfWajPOkozSD-w__Ab1sc1Y</recordid><startdate>202302</startdate><enddate>202302</enddate><creator>Chakraborty, Sankardeep</creator><creator>Grossi, Roberto</creator><creator>Sadakane, Kunihiko</creator><creator>Satti, Srinivasa Rao</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-0636-9880</orcidid></search><sort><creationdate>202302</creationdate><title>Succinct representation for (non)deterministic finite automata</title><author>Chakraborty, Sankardeep ; Grossi, Roberto ; Sadakane, Kunihiko ; Satti, Srinivasa Rao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c378t-b16bf4a72646982f4b815b8421e52e2c9ff290a9e86de3433dec37f9d2ada3bd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science</topic><topic>Deterministic finite automata</topic><topic>Encoding</topic><topic>Succinct data structures</topic><topic>Time-space tradeoff</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chakraborty, Sankardeep</creatorcontrib><creatorcontrib>Grossi, Roberto</creatorcontrib><creatorcontrib>Sadakane, Kunihiko</creatorcontrib><creatorcontrib>Satti, Srinivasa Rao</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Journal of computer and system sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chakraborty, Sankardeep</au><au>Grossi, Roberto</au><au>Sadakane, Kunihiko</au><au>Satti, Srinivasa Rao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Succinct representation for (non)deterministic finite automata</atitle><jtitle>Journal of computer and system sciences</jtitle><date>2023-02</date><risdate>2023</risdate><volume>131</volume><spage>1</spage><epage>12</epage><pages>1-12</pages><issn>0022-0000</issn><eissn>1090-2724</eissn><abstract>(Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any deterministic automaton D having n states over a σ-letter alphabet Σ using (σ−1)nlog⁡n(1+o(1)) bits, that determines, given a string x, whether D accepts x in optimal O(|x|) time. We also consider the case when there are N&lt;σn non-failure transitions, and obtain various time-space trade-offs. Here some of our results are better than the recent work of Cotumaccio and Prezza (SODA 2021). We also exhibit a data structure for non-deterministic automaton N using σn2+n bits that takes O(n2|x|) time for string membership checking. Finally, we also provide time and space efficient algorithms for performing several standard operations on the languages accepted by finite automata.</abstract><pub>Elsevier Inc</pub><doi>10.1016/j.jcss.2022.07.002</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0003-0636-9880</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0022-0000
ispartof Journal of computer and system sciences, 2023-02, Vol.131, p.1-12
issn 0022-0000
1090-2724
language eng
recordid cdi_hal_primary_oai_HAL_hal_03913681v1
source Elsevier ScienceDirect Journals
subjects Computer Science
Deterministic finite automata
Encoding
Succinct data structures
Time-space tradeoff
title Succinct representation for (non)deterministic finite automata
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T06%3A06%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Succinct%20representation%20for%20(non)deterministic%20finite%20automata&rft.jtitle=Journal%20of%20computer%20and%20system%20sciences&rft.au=Chakraborty,%20Sankardeep&rft.date=2023-02&rft.volume=131&rft.spage=1&rft.epage=12&rft.pages=1-12&rft.issn=0022-0000&rft.eissn=1090-2724&rft_id=info:doi/10.1016/j.jcss.2022.07.002&rft_dat=%3Chal_cross%3Eoai_HAL_hal_03913681v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0022000022000526&rfr_iscdi=true