Some more algorithms for Conway’s universal automaton
In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with Conway’s universal automaton. We give some algorithms of constructing this automaton and consider some examples.
Saved in:
| Published in | Acta Universitatis Sapientiae. Informatica Vol. 6; no. 1; pp. 5 - 20 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Cluj-Napoca
De Gruyter Open
01.06.2014
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2066-7760 1844-6086 2066-7760 |
| DOI | 10.2478/ausi-2014-0015 |
Cover
| Abstract | In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with Conway’s universal automaton. We give some algorithms of constructing this automaton and consider some examples. |
|---|---|
| AbstractList | In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with Conway’s universal automaton. We give some algorithms of constructing this automaton and consider some examples. |
| Author | Dolgov, Vasily Melnikov, Boris |
| Author_xml | – sequence: 1 givenname: Boris surname: Melnikov fullname: Melnikov, Boris email: B.Melnikov@tltsu.ru organization: Russia, Togliatti State University – sequence: 2 givenname: Vasily surname: Dolgov fullname: Dolgov, Vasily email: terenga74@mail.ru organization: Russia, Togliatti State University |
| BookMark | eNqFj71OwzAUhS0EEqV0ZY7EnPY6jp14RBV_UiUGYLac9qakSuJix1TZeA1ejyfBUZBgQGK6ZzjfueeckePWtEjIBYV5kmb5QntXxQnQNAag_IhMEhAizjIBx7_0KZk5t4NgyVhOIZ-Q7NE0GDXGYqTrrbFV99K4qDQ2Wpr2oPvP9w8X-bZ6Q-t0HWnfmUZ3pj0nJ6WuHc6-75Q831w_Le_i1cPt_fJqFa-TNOliWoRPlK2LAkqRywSlYMCKXPMsB4lSCig2km90iiVPGdeCauCC55BSThHZlCzGXN_udX_Qda32tmq07RUFNUxXw3Q1TFfD9EBcjsTemlePrlM7420bSipGOU9YKgCCaz661tY4Z7H8P1aOQOjQod3g1vo-iJ_0v0ER2C9aznyz |
| ContentType | Journal Article |
| Copyright | 2014. This work is published under http://creativecommons.org/licenses/by-nc-nd/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2014. This work is published under http://creativecommons.org/licenses/by-nc-nd/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 8FE 8FG ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS ADTOC UNPAY |
| DOI | 10.2478/ausi-2014-0015 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Computer Science Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Publicly Available Content Database Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Publicly Available Content Database CrossRef |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 2 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2066-7760 |
| EndPage | 20 |
| ExternalDocumentID | 10.2478/ausi-2014-0015 10_2478_ausi_2014_0015 10_2478_ausi_2014_0015615 |
| GroupedDBID | 5VS 9WM ABFKT ACGFS ADBLJ AHGSO AIKXB ALMA_UNASSIGNED_HOLDINGS EBS EJD HZ~ KQ8 O9- QD8 SOJ AAYXX CITATION 8FE 8FG ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS ADTOC IPNFZ RIG SLJYH UNPAY |
| ID | FETCH-LOGICAL-c242t-1b17313cbb0f6892e96303b8a57809e9960bd95da4ef5435a61a0565804151ee3 |
| IEDL.DBID | BENPR |
| ISSN | 2066-7760 1844-6086 |
| IngestDate | Wed Oct 01 16:30:29 EDT 2025 Sun Oct 19 01:24:23 EDT 2025 Wed Oct 01 05:51:36 EDT 2025 Sat Sep 06 17:04:16 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. http://creativecommons.org/licenses/by-nc-nd/3.0 cc-by-nc-nd |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c242t-1b17313cbb0f6892e96303b8a57809e9960bd95da4ef5435a61a0565804151ee3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.proquest.com/docview/3155234600?pq-origsite=%requestingapplication%&accountid=15518 |
| PQID | 3155234600 |
| PQPubID | 6761189 |
| PageCount | 16 |
| ParticipantIDs | unpaywall_primary_10_2478_ausi_2014_0015 proquest_journals_3155234600 crossref_primary_10_2478_ausi_2014_0015 walterdegruyter_journals_10_2478_ausi_2014_0015615 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2014-06-01 |
| PublicationDateYYYYMMDD | 2014-06-01 |
| PublicationDate_xml | – month: 06 year: 2014 text: 2014-06-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Cluj-Napoca |
| PublicationPlace_xml | – name: Cluj-Napoca |
| PublicationTitle | Acta Universitatis Sapientiae. Informatica |
| PublicationYear | 2014 |
| Publisher | De Gruyter Open De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Publisher_xml | – name: De Gruyter Open – name: De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| SSID | ssj0001738108 ssib007756055 ssib044728026 ssib039772476 ssib038075351 |
| Score | 1.8765796 |
| Snippet | In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with... |
| SourceID | unpaywall proquest crossref walterdegruyter |
| SourceType | Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 5 |
| SubjectTerms | constructing algorithms Conway’s universal automaton nondeterministic finite automata |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NSuRAEC50PKx78GdVHP_IQXAvrenpn0mOIooIiqAD7il0JxUVx2SYJAyzp32NfT2fxO5OoiiC-gApSH1dqa9TVV8B7IoQuewlggTINeGUahJITImfci60lTtxU67nF_J0wM9uxM0M9NpZGNtW6b79iatYHoyS1LUr835woKri3qBKObGZfhbmpDD8uwNzg4vLwz_2ZhVwTqTv1jtamXJDHaVfKzV-YOBtJnqllz-qbKSmEzUc_oSFiStaJ3g7rqZlWyR1uedksZ4HLJxkoW05edivSr0f_30n6Pi911qChYaKeof12VmGGcx-wWK75sFron4F-lf5I3q2IddTw9t8fF_ePRaeIbveUZ5N1PTp3__Cq-oGD2NPVWVuaHCercLg5Pj66JQ0-xZIbBJ1SaimfUZZrLWfyiDsocHJZzpQJqr9EK2Oi05CkSiOqTA0S0mqDH8STsKIIrI16GR5huvgqdRHlCEPUqk4jdNQ9jULY4yZH6OWrAt7re-jUS2rEZnriPVHZP0RWX_YfjvRha0WmqgJryJiVjiOcUPWuvD7Ba5PLfXeoflq8OMnDNvb-Lr9TZivUbS_aLagU44r3DaMpdQ7zRF9Bty05nk priority: 102 providerName: Unpaywall |
| Title | Some more algorithms for Conway’s universal automaton |
| URI | https://www.degruyter.com/doi/10.2478/ausi-2014-0015 https://www.proquest.com/docview/3155234600 https://www.sciendo.com/pdf/10.2478/ausi-2014-0015 |
| UnpaywallVersion | publishedVersion |
| Volume | 6 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2066-7760 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001738108 issn: 2066-7760 databaseCode: KQ8 dateStart: 20130101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 2066-7760 dateEnd: 99991231 omitProxy: true ssIdentifier: ssib007756055 issn: 1844-6086 databaseCode: BENPR dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVJWN databaseName: Sciendo customDbUrl: eissn: 2066-7760 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001738108 issn: 2066-7760 databaseCode: 9WM dateStart: 20130908 isFulltext: true titleUrlDefault: https://content.sciendo.com/ providerName: Sciendo – providerCode: PRVJWN databaseName: Sciendo:Open Access customDbUrl: eissn: 2066-7760 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001738108 issn: 2066-7760 databaseCode: ADBLJ dateStart: 20130908 isFulltext: true titleUrlDefault: https://www.sciendo.com/ providerName: Sciendo – providerCode: PRVAZK databaseName: Walter De Gruyter: Open Access Journals customDbUrl: eissn: 2066-7760 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001738108 issn: 2066-7760 databaseCode: AHGSO dateStart: 20130908 isFulltext: true titleUrlDefault: https://www.degruyterbrill.com providerName: Walter de Gruyter |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV1Lb9NAEB61yQE4tLwqAiXyAQkuq9reh-0DQmlpqCqIKiBSOVm79rogpXZobEW58Tf69_pLOuNHLRCCk0-7lj_P7ny7M_MNwCsZWaH8VLLQCsOE5xkWKpsxNxNCGpI7qatcP83UyVycnsvzLZh1tTCUVtntifVGnRYJ3ZEfcNIK4wL987vlT0Zdoyi62rXQ0G1rhfRtLTG2DUOflLEGMDw8np19vrOwIEAP31diktq65H1cjNiQL3oHLQR1b2oJSn1rE5AiVl1fFwrBFB4IGiVIHBUe6Gr1A83OE4yoyO-erqev96p8qTdrvVg8gJ11HRRP7cVVtSm7IGzt26YPYaclpc6ksaJHsGXzx7DbNXxw2vX_BIIvxaV1KDXX0YsLRKf8frlykPY6R0W-1pubX9crp2pSPXA-XZUFEuIifwrz6fHXoxPWdl5gCbrsknkGP9TjiTFupsLIt_jHXG5CjevbjSwpupg0kqkWNpNIuLTyNDIpWYsZedbyPRjkRW6fgaMz11oViTBTWnhJFqnA8CixCXcTaxQfwesOpXjZCGzEeDAhPGPCMyY8KfNOjmC_AzFuF9oq7s1iBG_ugP3vTP4fuPcT_n0E8r7n_379C7jf_Hm6oNmHQXlV2ZfIV0ozhu1w-mEMw8n7w4-n49Yk8TmfnU2-3QJbSeYW |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NbtQwEB6V9lA4tOVPLJTiAwguVuP4J8mhQlBabWm7QtBKvQU7cQrSNlmaRKu98Rq8TB-GJ2Gcn0YgBKc-gCfReOz5xjPzDcBzGVmh_FTS0ApDBWOGhspm1MuEkMbRnTRdrscTNT4V78_k2RJc9b0wrqyyvxObizotEvdGvs0dVxgX6J9fz75RNzXKZVf7ERq6G62Q7jQUY11jx6FdzDGEK3cO3uF-v_D9_b2T3THtpgzQBN1TRZlhAWc8McbLVBj5Fv_O4ybUaMteZB17iUkjmWphM4ngQiumETXIhriHWctR7i1YEVxEGPytvN2bfPh4bdFBgIhi6Px07O6SD3k4h758MQACIdy0qA4QNa9EgWPgavr5QiGowgCkZZ7EVeG2rsuvaOZMUAd9fvesA1xerfOZXsz1dHoH1uZNEj6155f1ouqTvo0v3d-AtQ4Ekzet1d6FJZvfg_V-wATp7pv7EHwqLixxpcBET89xN6ovFyVBmE12i3yuFz-__yhJ3ZaWoDxdVwUC8CJ_AKc3sgcPYTkvcvsIiM48a1UkwkxpwZIsUoHhUWIT7iXWKD6Cl72W4llL6BFjIOT0GTt9xk6frtJPjmCzV2LcHewyHsxwBK-uFftfSf4feh8E_n0F4szH__78M1gdnxwfxUcHk8MncLu1Avc4tAnL1WVtnyJWqsxWZ5AEPt_0GfgFZxgc5w |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3bSsNAEB20gpeHesdq1TwI-hKaNJtt8liqtd6qUAu-hd1kUoU2KU1C6Zu_4e_5Je42SatSEPyAGZKzO8zZyclZgDPTRkKrnqlaSLhKdJ2rFkVf1XxCTC7tTqZ_uT60aatLbl_MXE0YZbJKD3ujZBKnDqkVL3QTOSjLvQaqpGZVWBK9iQXWiSqbfmXo-cuwQqlobwVYqbeuO4_zQUtNmlhZqWHjguCfDWnOMteSYMgmY9bvb0BxPP12PXuwby2ouQXFjDsq9XSxt2EJgx3YzO9lULIy3YVaJxygIhW0Cuv3QnH8fx1EimCnSiMMxmzy-f4RKUmqyBD5WBKHgreGwR50m1fPjZaaXZCguqKzxqrOxcvphsu55lPLrqIAVjO4xUQZajZK4xXu2abHCPqm4EWM6kwQHnPqOaQjGvtQCMIAD0BhvoZIbWL5lBHd9W1a44btomtoLnJqlOA8R8kZpj4Yjjg_SDwdiacj8ZQCObME5RxEJ6uHyDGk05tBBLsqwcUM2D8zVX_hPk-4OELQs8P_BJ3C6tNl07m_ad8dwXq6NeSgpQyFeJTgseAdMT_JdtYX0FnV9w |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NSuRAEC50PKx78GdVHP_IQXAvrenpn0mOIooIiqAD7il0JxUVx2SYJAyzp32NfT2fxO5OoiiC-gApSH1dqa9TVV8B7IoQuewlggTINeGUahJITImfci60lTtxU67nF_J0wM9uxM0M9NpZGNtW6b79iatYHoyS1LUr835woKri3qBKObGZfhbmpDD8uwNzg4vLwz_2ZhVwTqTv1jtamXJDHaVfKzV-YOBtJnqllz-qbKSmEzUc_oSFiStaJ3g7rqZlWyR1uedksZ4HLJxkoW05edivSr0f_30n6Pi911qChYaKeof12VmGGcx-wWK75sFron4F-lf5I3q2IddTw9t8fF_ePRaeIbveUZ5N1PTp3__Cq-oGD2NPVWVuaHCercLg5Pj66JQ0-xZIbBJ1SaimfUZZrLWfyiDsocHJZzpQJqr9EK2Oi05CkSiOqTA0S0mqDH8STsKIIrI16GR5huvgqdRHlCEPUqk4jdNQ9jULY4yZH6OWrAt7re-jUS2rEZnriPVHZP0RWX_YfjvRha0WmqgJryJiVjiOcUPWuvD7Ba5PLfXeoflq8OMnDNvb-Lr9TZivUbS_aLagU44r3DaMpdQ7zRF9Bty05nk |
| 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%3Ajournal&rft.genre=article&rft.atitle=Some+more+algorithms+for+Conway%E2%80%99s+universal+automaton&rft.jtitle=Acta+Universitatis+Sapientiae.+Informatica&rft.au=Melnikov%2C+Boris&rft.au=Dolgov%2C+Vasily&rft.date=2014-06-01&rft.pub=De+Gruyter+Brill+Sp.+z+o.o.%2C+Paradigm+Publishing+Services&rft.issn=1844-6086&rft.eissn=2066-7760&rft.volume=6&rft.issue=1&rft.spage=5&rft.epage=20&rft_id=info:doi/10.2478%2Fausi-2014-0015 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2066-7760&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2066-7760&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2066-7760&client=summon |