{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:42:53Z","timestamp":1720201373853},"reference-count":67,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1016\/j.tcs.2022.04.038","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T06:43:58Z","timestamp":1652251438000},"page":"94-116","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A computation model with automatic functions and relations as primitive operations"],"prefix":"10.1016","volume":"924","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Zeyong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ammar Fathin","family":"Sabili","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9152-1706","authenticated-orcid":false,"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2022.04.038_br0010","series-title":"The Theory of Parsing, Translation, and Compiling","author":"Aho","year":"1972"},{"key":"10.1016\/j.tcs.2022.04.038_br0020","series-title":"Computational Complexity: A Modern Approach","author":"Arora","year":"2009"},{"key":"10.1016\/j.tcs.2022.04.038_br0030","first-page":"245","article-title":"Complexity of recognition of symmetry on Turing machines","volume":"15","author":"Barzdin","year":"1965","journal-title":"Probl. Kibern."},{"key":"10.1016\/j.tcs.2022.04.038_br0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull., New Ser., Am. Math. Soc."},{"key":"10.1016\/j.tcs.2022.04.038_br0050","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.059","article-title":"Iterated sequential transducers as language generating devices","volume":"369","author":"Bordihn","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0060","series-title":"Handbook of Computability and Complexity in Analysis","first-page":"173","article-title":"A survey on analog models of computation","author":"Bournez","year":"2021"},{"key":"10.1016\/j.tcs.2022.04.038_br0070","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second-order arithmetic and finite automata","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. Math. Log. Grundl. Math."},{"key":"10.1016\/j.tcs.2022.04.038_br0080","series-title":"Proceedings of the International Congress on Logic, Methodology and Philosophy of Science","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/j.tcs.2022.04.038_br0090","article-title":"Information and Randomness - an Algorithmic Perspective","author":"Calude","year":"2002"},{"key":"10.1016\/j.tcs.2022.04.038_br0100","series-title":"To Halt, or Not to Halt. That Is the Question","author":"Calude","year":"2022"},{"key":"10.1016\/j.tcs.2022.04.038_br0110","series-title":"Developments in Language Theory, 5th International Conference","first-page":"1","article-title":"Automata: From uncertainty to quantum","volume":"vol. 2295","author":"Calude","year":"2001"},{"issue":"3","key":"10.1016\/j.tcs.2022.04.038_br0120","article-title":"Evaluating the complexity of mathematical problems: Part 1","volume":"18","author":"Calude","year":"2009","journal-title":"Complex Syst."},{"issue":"4","key":"10.1016\/j.tcs.2022.04.038_br0130","article-title":"Evaluating the complexity of mathematical problems: Part 2","volume":"18","author":"Calude","year":"2010","journal-title":"Complex Syst."},{"issue":"10","key":"10.1016\/j.tcs.2022.04.038_br0140","first-page":"1196","article-title":"What is the value of taxicab(6)?","volume":"9","author":"Calude","year":"2003","journal-title":"J. Univers. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2022.04.038_br0150","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0168-0072(97)00039-0","article-title":"Deterministic automata: simulation, universality and minimality","volume":"90","author":"Calude","year":"1997","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1016\/j.tcs.2022.04.038_br0160","series-title":"Proceedings of the 3rd International Conference Developments in Language Theory","first-page":"519","article-title":"Deterministic automata: simulation, universality and minimality. Extended abstract","author":"Calude","year":"1997"},{"key":"10.1016\/j.tcs.2022.04.038_br0170","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.tcs.2021.09.005","article-title":"Bi-immunity over different size alphabets","volume":"894","author":"Calude","year":"2021","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"10.1016\/j.tcs.2022.04.038_br0180","first-page":"1563","article-title":"Deterministic frequency pushdown automata","volume":"21","author":"Calude","year":"2015","journal-title":"J. Univers. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2022.04.038_br0190","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0304-3975(99)00159-0","article-title":"Recursively enumerable reals and Chaitin omega numbers","volume":"255","author":"Calude","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0200","series-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"252","article-title":"Deciding parity games in quasipolynomial time","author":"Calude","year":"2017"},{"key":"10.1016\/j.tcs.2022.04.038_br0210","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.tcs.2019.10.011","article-title":"Searching for shortest and least programs","volume":"807","author":"Calude","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2022.04.038_br0220","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10699-016-9489-4","article-title":"The deluge of spurious correlations in big data","volume":"22","author":"Calude","year":"2017","journal-title":"Found. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0230","series-title":"Developments in Language Theory, 12th International Conference","first-page":"170","article-title":"Universal recursively enumerable sets of strings","volume":"vol. 5257","author":"Calude","year":"2008"},{"issue":"22","key":"10.1016\/j.tcs.2022.04.038_br0240","doi-asserted-by":"crossref","first-page":"2253","DOI":"10.1016\/j.tcs.2011.01.002","article-title":"Universal recursively enumerable sets of strings","volume":"412","author":"Calude","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0250","series-title":"Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing","author":"Calude","year":"2000"},{"key":"10.1016\/j.tcs.2022.04.038_br0260","first-page":"96","article-title":"Automatic functions, linear time and learning","volume":"vol. 7318","author":"Case","year":"2012"},{"issue":"3","key":"10.1016\/j.tcs.2022.04.038_br0270","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-9(3:19)2013","article-title":"Automatic functions, linear time and learning","volume":"9","author":"Case","year":"2013","journal-title":"Log. Methods Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2022.04.038_br0280","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"10.1016\/j.tcs.2022.04.038_br0290","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0300","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0219022","article-title":"Addition machines","volume":"19","author":"Floyd","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2022.04.038_br0310","series-title":"Proceedings of the 9th Annual International Conference on Theory and Applications of Models of Computation","first-page":"373","article-title":"Finite automata over structures","author":"Gandhi","year":"2012"},{"key":"10.1016\/j.tcs.2022.04.038_br0320","author":"Gao"},{"key":"10.1016\/j.tcs.2022.04.038_br0330","series-title":"Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","first-page":"21","article-title":"Automatic structures: twenty years later","author":"Gr\u00e4del","year":"2020"},{"issue":"1","key":"10.1016\/j.tcs.2022.04.038_br0340","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","article-title":"A new normal-form theorem for context-free phrase structure grammars","volume":"12","author":"Greibach","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2022.04.038_br0350","series-title":"Parallel neighbor-sort (or the glory of the induction principle)","author":"Habermann","year":"1972"},{"key":"10.1016\/j.tcs.2022.04.038_br0360","series-title":"15th Annual Symposium on Switching and Automata Theory","first-page":"13","article-title":"On the power of multiplication in random access machines","author":"Hartmanis","year":"1974"},{"key":"10.1016\/j.tcs.2022.04.038_br0370","first-page":"1","article-title":"On the structure of feasible computations","volume":"vol. 14","author":"Hartmanis","year":"1976"},{"key":"10.1016\/j.tcs.2022.04.038_br0380","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2022.04.038_br0390","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(82)90042-1","article-title":"On direct products of automaton decidable theories","volume":"19","author":"Hodgson","year":"1982","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0400","first-page":"39","article-title":"D\u00e9cidabilit\u00e9 par automate fini","volume":"7","author":"Hodgson","year":"1983","journal-title":"Ann. Sci. Math. Qu\u00e9."},{"key":"10.1016\/j.tcs.2022.04.038_br0410","series-title":"Th\u00e9ories d\u00e9cidables par automate fini","author":"Hodgson","year":"1976"},{"key":"10.1016\/j.tcs.2022.04.038_br0420","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2022.04.038_br0430","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-SAT","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0440","series-title":"An efficient recognition and syntax-analysis algorithm for context-free languages","author":"Kasami","year":"1966"},{"key":"10.1016\/j.tcs.2022.04.038_br0450","series-title":"Implementation and Application of Automata","first-page":"3","article-title":"Decision problems for finite automata over infinite algebraic structures","author":"Khoussainov","year":"2016"},{"key":"10.1016\/j.tcs.2022.04.038_br0460","series-title":"Proceedings of Logic Colloquium 2007","first-page":"132","article-title":"Three lectures on automatic structures","volume":"vol. 35","author":"Khoussainov","year":"2010"},{"key":"10.1016\/j.tcs.2022.04.038_br0470","first-page":"367","article-title":"Automatic presentations of structures","volume":"vol. 960","author":"Khoussainov","year":"1995"},{"issue":"3","key":"10.1016\/j.tcs.2022.04.038_br0480","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0204028","article-title":"Speed of recognition of context-free languages by array automata","volume":"4","author":"Kosaraju","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2022.04.038_br0490","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.entcs.2009.09.015","article-title":"On one-way one-bit o(one)-message cellular automata","volume":"252","author":"Kutrib","year":"2009","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0500","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-2013-878","article-title":"One-dimensional cellular automaton transducers","volume":"126","author":"Kutrib","year":"2013","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.tcs.2022.04.038_br0510","first-page":"87","article-title":"Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power","volume":"vol. 12098","author":"Kutrib","year":"2020"},{"key":"10.1016\/j.tcs.2022.04.038_br0520","series-title":"Complexity of linear languages and its closures and exploring automatic functions as models of computation","author":"Li","year":"2018"},{"key":"10.1016\/j.tcs.2022.04.038_br0530","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2015.05.001","article-title":"Generalized finite automata over real and complex numbers","volume":"591","author":"Meer","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2022.04.038_br0540","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2019.104452","article-title":"Periodic generalized automata over the reals","volume":"269","author":"Meer","year":"2019","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2022.04.038_br0550","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2178\/bsl\/1186666149","article-title":"Describing groups","volume":"13","author":"Nies","year":"2007","journal-title":"Bull. Symb. Log."},{"key":"10.1016\/j.tcs.2022.04.038_br0560","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2013.06.001","article-title":"Conjunctive and Boolean grammars: the true general case of the context-free grammars","volume":"9","author":"Okhotin","year":"2013","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"10.1016\/j.tcs.2022.04.038_br0570","first-page":"107","article-title":"Nondeterministic one-tape off-line Turing machines and their time complexity","volume":"14","author":"Pighizzini","year":"2009","journal-title":"J. Autom. Lang. Comb."},{"key":"10.1016\/j.tcs.2022.04.038_br0580","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","article-title":"Real time computation","volume":"1","author":"Rabin","year":"1963","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.tcs.2022.04.038_br0590","series-title":"Mathematical Foundations of Computer Science 1981","first-page":"473","article-title":"A framework for studying grammars","volume":"vol. 118","author":"Rovan","year":"1981"},{"issue":"2","key":"10.1016\/j.tcs.2022.04.038_br0600","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2178\/bsl\/1208442827","article-title":"Automata presenting structures: a survey of the finite string case","volume":"14","author":"Rubin","year":"2008","journal-title":"Bull. Symb. Log."},{"key":"10.1016\/j.tcs.2022.04.038_br0610","series-title":"Automata, Languages and Programming, 6th Colloquium","first-page":"520","article-title":"On the power of random access machines","volume":"vol. 71","author":"Sch\u00f6nhage","year":"1979"},{"key":"10.1016\/j.tcs.2022.04.038_br0620","series-title":"Turing machines and automatic functions as models of computation","author":"Seah","year":"2012"},{"key":"10.1016\/j.tcs.2022.04.038_br0630","series-title":"Methods and Theory of Automata and Languages","author":"Stephan","year":"2016"},{"key":"10.1016\/j.tcs.2022.04.038_br0640","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2022.04.038_br0650","series-title":"Turing Machines with Sublogarithmic Space, vol. 843","author":"Szepietowski","year":"1994"},{"key":"10.1016\/j.tcs.2022.04.038_br0660","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(76)90074-7","article-title":"Iterated a-NGSM maps and \u0393 systems","volume":"32","author":"Wood","year":"1976","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2022.04.038_br0670","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","article-title":"Recognition and parsing of context-free languages in time n3","volume":"10","author":"Younger","year":"1967","journal-title":"Inf. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397522002626?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397522002626?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T00:16:56Z","timestamp":1674865016000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397522002626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":67,"alternative-id":["S0304397522002626"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2022.04.038","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A computation model with automatic functions and relations as primitive operations","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2022.04.038","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}