Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)
Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or...
Saved in:
| Published in | Descriptional Complexity of Formal Systems Vol. 11612; pp. 74 - 85 |
|---|---|
| Main Authors | , |
| Format | Book Chapter |
| Language | English |
| Published |
Switzerland
Springer International Publishing AG
01.01.2019
Springer International Publishing |
| Series | Lecture Notes in Computer Science |
| Online Access | Get full text |
| ISBN | 3030232468 9783030232467 |
| ISSN | 0302-9743 1611-3349 1611-3349 |
| DOI | 10.1007/978-3-030-23247-4_5 |
Cover
| Abstract | Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or $$\lambda $$ -transitions. We show inclusion relations and incomparability results of the induced language families. Since for right-one way jumping devices the use of spontaneous transitions is subject to different natural interpretations, we also study this subject in detail, showing that most interpretations are equivalent to each other and lead to the same language families. Finally we also study inclusion and incomparability results to classical language families and to the families of languages accepted by finite automata with translucent letters. |
|---|---|
| AbstractList | Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or $$\lambda $$ -transitions. We show inclusion relations and incomparability results of the induced language families. Since for right-one way jumping devices the use of spontaneous transitions is subject to different natural interpretations, we also study this subject in detail, showing that most interpretations are equivalent to each other and lead to the same language families. Finally we also study inclusion and incomparability results to classical language families and to the families of languages accepted by finite automata with translucent letters. |
| Author | Holzer, Markus Beier, Simon |
| Author_xml | – sequence: 1 givenname: Simon surname: Beier fullname: Beier, Simon – sequence: 2 givenname: Markus surname: Holzer fullname: Holzer, Markus email: holzer@informatik.uni-giessen.de |
| BookMark | eNqFkEtPAyEQgPEZW-0v8LJHPaDDYxc4Nk3rI0YTY-KRsCzbrrbsutBo_73Umnh0LswwfJPhG6JD33qH0DmBKwIgrpWQmGFggCmjXGCu8z00ZOnipy720YAUhGDGuDr4axTyEA22OVaCs2M0JCmYFHkuTtAohDcAoBSkEmqA7h9bX7no-lXjmxAbmz0380XMnrzDr2aT3a9XXePn2Sy1o8vG69iuTDTZxfQrukRW2bgMsTc2Xp6ho9osgxv9nqfoZTZ9mdzih6ebu8n4Ac-ZoBFbWVtLAWrIKa9LRiwoLsuK8rwyktWq4K6iVgoQlFChalukXSsBRQmlk-wU8d3Yte_M5tMsl7rrm5XpN5qA3orTSZxmOinQP6J0EpcwssNCeu3nrtdl276Hfxi6Y7q-_Vi7ELXbQtb59OOlXZguiQs6V0knBV1wLXP2Dd8-e-Y |
| ContentType | Book Chapter |
| Copyright | IFIP International Federation for Information Processing 2019 |
| Copyright_xml | – notice: IFIP International Federation for Information Processing 2019 |
| DBID | FFUUA ABOKW UNPAY |
| DOI | 10.1007/978-3-030-23247-4_5 |
| DatabaseName | ProQuest Ebook Central - Book Chapters - Demo use only Unpaywall for CDI: Monographs and Miscellaneous Content Unpaywall |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 3030232476 9783030232474 |
| EISSN | 1611-3349 |
| Editor | Hospodár, Michal Jirásková, Galina Konstantinidis, Stavros |
| Editor_xml | – sequence: 1 fullname: Jirásková, Galina – sequence: 2 fullname: Hospodár, Michal – sequence: 3 fullname: Konstantinidis, Stavros |
| EndPage | 85 |
| ExternalDocumentID | oai:HAL:hal-02387300v1 EBC5922020_64_85 |
| GroupedDBID | 38. AABBV AAJYQ AATVQ ABBUY ABCYT ACDTA ACDUY AEDXK AEHEY AEJLV AEKFX AHNNE AIFIR ALMA_UNASSIGNED_HOLDINGS ATJMZ AYMPB BBABE CXBFT CZZ EXGDT FCSXQ FFUUA I4C IEZ MGZZY NSQWD OORQV SBO TPJZQ TSXQS Z83 Z88 -DT -~X 29L 2HA 2HV ACGFS ADCXD EJD F5P LAS LDH P2P RSU ~02 -GH 1SB 5QI 875 AASHB ABMNI ABOKW AEFIE FEDTE HVGLF RNI SVGTG UNPAY VI1 |
| ID | FETCH-LOGICAL-g372t-c8fcc200f0524fb31c0948bd245da83f964ed2c870721279fc6089d706b0be83 |
| IEDL.DBID | UNPAY |
| ISBN | 3030232468 9783030232467 |
| ISSN | 0302-9743 1611-3349 |
| IngestDate | Wed Oct 29 11:52:18 EDT 2025 Tue Jul 29 20:14:40 EDT 2025 Tue Oct 21 02:28:33 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| LCCallNum | QA75.5-76.95 |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-g372t-c8fcc200f0524fb31c0948bd245da83f964ed2c870721279fc6089d706b0be83 |
| Notes | Original Abstract: Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-transitions. We show inclusion relations and incomparability results of the induced language families. Since for right-one way jumping devices the use of spontaneous transitions is subject to different natural interpretations, we also study this subject in detail, showing that most interpretations are equivalent to each other and lead to the same language families. Finally we also study inclusion and incomparability results to classical language families and to the families of languages accepted by finite automata with translucent letters. |
| OCLC | 1111387557 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://hal.inria.fr/hal-02387300 |
| PQID | EBC5922020_64_85 |
| PageCount | 12 |
| ParticipantIDs | unpaywall_primary_10_1007_978_3_030_23247_4_5 springer_books_10_1007_978_3_030_23247_4_5 proquest_ebookcentralchapters_5922020_64_85 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-01-01 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – month: 01 year: 2019 text: 2019-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Switzerland |
| PublicationPlace_xml | – name: Switzerland – name: Cham |
| PublicationSeriesSubtitle | Theoretical Computer Science and General Issues |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationSeriesTitleAlternate | Lect.Notes Computer |
| PublicationSubtitle | 21st IFIP WG 1. 02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019, Proceedings |
| PublicationTitle | Descriptional Complexity of Formal Systems |
| PublicationYear | 2019 |
| Publisher | Springer International Publishing AG Springer International Publishing |
| Publisher_xml | – name: Springer International Publishing AG – name: Springer International Publishing |
| RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Naor, Moni Mitchell, John C. Terzopoulos, Demetri Steffen, Bernhard Pandu Rangan, C. Kanade, Takeo Kittler, Josef Hutchison, David Tygar, Doug |
| RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni – sequence: 8 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. – sequence: 9 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard – sequence: 10 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri – sequence: 11 givenname: Doug surname: Tygar fullname: Tygar, Doug |
| SSID | ssj0002208979 ssj0002792 |
| Score | 2.1745467 |
| Snippet | Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to... |
| SourceID | unpaywall springer proquest |
| SourceType | Open Access Repository Publisher |
| StartPage | 74 |
| Title | Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract) |
| URI | http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=5922020&ppg=85 http://link.springer.com/10.1007/978-3-030-23247-4_5 https://hal.inria.fr/hal-02387300 |
| UnpaywallVersion | submittedVersion |
| Volume | 11612 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LaxsxEB4S-9Akh_QV4jQJKvTQBzJrvXZ1NMEmmNYtJWnTk5C02rY0rIO9pqS_vqN9OG0PgR4X5iDmWzHfvD4BvAgZ5yowR532jgqbehpV6TBLkUIpXzheF3PezdX5pZhdyasteN7twnyrGSf6flgs4weNMSVqqm9DX0mk2z3oX84_jL803QFGdTtEr6IcHxd6oyzUiMdyilY00oaUCiP_4pGb1ucuPFiXN_b2p72-_iO6TPfvdnSaoZIfw3Xlhv7XP5KN9x78IezFtQUS9wnQVY9gK5SPYb97tIG0d_gJzOaLMm9nYGqRZvIx5ufkfRnoZ3tLZogvHpdMv0c2SsbraoGk1pKXk7ZcTsYulkd89eopXEwnF2fntH1QgX7lKauozwrv8VoUiWQCYRh5TO4ylzMhc5vxQisRcubxCqdR-F0XXiWZztNEucQhqgfQKxdlOASSpBhcg_JypKzgVmUhcJYWRa60RQLIBvCm87Opu77tqKlvnLAyUjOGTNUoYTI5gNcdFCYar0wnpowQGm4QQlNDaBDCAdANWOamkeS4z_7oP-2fwQ6SIt2UWY6hVy3X4QSJR-VOoT-ezN5-Om1_wd-RndF0 |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSxxBEC50PURzMEaDmxcteEiUXmb7NdPHJbjIQlYRJebUdPf0aFBmZXcWMb8-1fPYPA5CjgN1aOqbpr56fQ1wGDLOVWCOOu0dFTb1NKrSYZYihVK-cLwu5nydqtMrMbmW12tw0O3C3NaME30_KObxg8aYEjXV12FDSaTbPdi4mp6PvjfdAUZ1O0SvohwfF3qlLNSIx3KKVjTShpQKI__ikavW5xa8WJYP9unR3t__EV3G2793dJqhkrvBsnID__MfycZnD_4KXsa1BRL3CdBVO7AWytew3T3aQNo7vAuT6azM2xmYWqSZXMT8nJyVgX6zT2SC-OJxyfhHZKNktKxmSGot-XTSlsvJyMXyiK8-78Hl-OTyyyltH1SgNzxlFfVZ4T1eiyKRTCAMQ4_JXeZyJmRuM15oJULOPF7hNAq_68KrJNN5miiXOET1DfTKWRn2gSQpBtegvBwqK7hVWQicpUWRK22RALI-HHd-NnXXtx019Y0TFkZqxpCpGiVMJvtw1EFhovHCdGLKCKHhBiE0NYQGIewDXYFlHhpJjufs3_6n_TvYRFKkmzLLe-hV82X4gMSjch_bX-8XDfDP3w |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Descriptional+Complexity+of+Formal+Systems&rft.atitle=Nondeterministic+Right+One-Way+Jumping+Finite+Automata+%28Extended+Abstract%29&rft.date=2019-01-01&rft.pub=Springer+International+Publishing+AG&rft.isbn=9783030232467&rft.volume=11612&rft_id=info:doi/10.1007%2F978-3-030-23247-4_5&rft.externalDBID=85&rft.externalDocID=EBC5922020_64_85 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F5922020-l.jpg |