{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:06:45Z","timestamp":1769184405558,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3654057","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:40:58Z","timestamp":1768423258000},"page":"8903-8917","source":"Crossref","is-referenced-by-count":0,"title":["A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2571-2904","authenticated-orcid":false,"given":"Sahil Rajesh","family":"Dhayalkar","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"ref2","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"2006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/230514.571645"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref5","volume-title":"Deep Learning","author":"Goodfellow","year":"2016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.5555\/3104322.3104425"},{"key":"ref7","first-page":"315","article-title":"Deep sparse rectifier neural networks","volume-title":"Proc. 14th Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref10","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Vaswani"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.3.393"},{"key":"ref12","first-page":"5247","article-title":"Extracting automata from recurrent neural networks using queries and counter examples","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","volume":"80","author":"Weiss"},{"key":"ref13","article-title":"Neural Turing machines","author":"Graves","year":"2014","journal-title":"arXiv:1410.5401"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1991.155350"},{"key":"ref15","article-title":"On the computational power of RNNs","author":"Korsky","year":"2019","journal-title":"arXiv:1906.06349"},{"key":"ref16","article-title":"Learning hierarchical structures with differentiable nondeterministic stacks","author":"DuSell","year":"2021","journal-title":"arXiv:2109.01982"},{"key":"ref17","article-title":"Neural programmer-interpreters","author":"Reed","year":"2015","journal-title":"arXiv:1511.06279"},{"key":"ref18","first-page":"7096","article-title":"On the ability and limitations of transformers to recognize formal languages","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process. (EMNLP)","author":"Bhattamishra"},{"key":"ref19","first-page":"443","article-title":"A formal hierarchy of RNN architectures","volume-title":"Proc. 58th Annu. Meeting Assoc. Comput. Linguistics","author":"Merrill"},{"key":"ref20","article-title":"Topological expressivity of ReLU neural networks","author":"Ergen","year":"2023","journal-title":"arXiv:2310.11130"},{"key":"ref21","article-title":"Learning halfspaces and neural networks with random initialization","author":"Zhang","year":"2015","journal-title":"arXiv:1511.07948"},{"key":"ref22","article-title":"Approximating continuous functions by ReLU nets of minimal width","author":"Hanin","year":"2017","journal-title":"arXiv:1710.11278"},{"key":"ref23","article-title":"In search of the real inductive bias: On the role of implicit regularization in deep learning","author":"Neyshabur","year":"2014","journal-title":"arXiv:1412.6614"},{"key":"ref24","article-title":"Neural networks as universal finite-state machines: A constructive deterministic finite automaton theory","author":"Dhayalkar","year":"2025","journal-title":"arXiv:2505.11694"},{"key":"ref25","article-title":"The geometry of ReLU networks through the ReLU transition graph","author":"Dhayalkar","year":"2025","journal-title":"arXiv:2505.11692"},{"key":"ref26","article-title":"A combinatorial theory of dropout: Sub networks, graph geometry, and generalization","author":"Dhayalkar","year":"2025","journal-title":"arXiv:2504.14762"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.120034","article-title":"A provably stable neural network Turing machine with finite precision and time","volume":"658","author":"Stogin","year":"2024","journal-title":"Inf. Sci."},{"key":"ref28","article-title":"Training neural networks as recognizers of formal languages","author":"Butoi","year":"2024","journal-title":"arXiv:2411.07107"},{"key":"ref29","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"ref30","article-title":"Transformers learn shortcuts to automata","author":"Liu","year":"2022","journal-title":"arXiv:2210.10749"},{"key":"ref31","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Paszke"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"ref33","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11352830.pdf?arnumber=11352830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:03:25Z","timestamp":1769115805000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11352830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3654057","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}