{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:29:03Z","timestamp":1648816143832},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0304-3975(98)00192-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:30:39Z","timestamp":1027650639000},"page":"307-325","source":"Crossref","is-referenced-by-count":1,"title":["Realtime subshifts"],"prefix":"10.1016","volume":"237","author":[{"given":"Petr","family":"K\u016frka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Maass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00192-3_BIB1","first-page":"75","article-title":"On k-tape versus (k\u22121)-tape real time computation","volume":"7","author":"Aanderaa","year":"1974","journal-title":"SIAM-AMS"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB2","first-page":"138","article-title":"Languages and subshifts","volume":"vol. 192","author":"Blanchard","year":"1985"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB3","doi-asserted-by":"crossref","unstructured":"F. Blanchard, P. K\u016frka, Language complexity of rotations and Sturmian sequences, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(97)00105-9"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","article-title":"Quasi-realtime languages","volume":"4","author":"Book","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB5","first-page":"139","article-title":"Covers for coded systems","volume":"vol. 135","author":"Fiebig","year":"1992"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB7","unstructured":"W. Krieger, On a Class of Algebraic Subshifts, Universit\u00e4t Heidelberg, Mathematisches Institut, Heft No. 62, Mai 1993."},{"key":"10.1016\/S0304-3975(98)00192-3_BIB8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S014338579706985X","article-title":"Languages, equicontinuity and attractors in cellular automata","volume":"17","author":"K\u016frka","year":"1997","journal-title":"Ergod. Theory Dyn. Systems"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB9","series-title":"An introduction to Symbolic Dynamics and Coding","author":"Lind","year":"1995"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","article-title":"Puissances de mots et reconnaissabilit\u00e9 des points fixes d'une substitution","volume":"99","author":"Moss\u00e9","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00192-3_BIB11","first-page":"101","article-title":"Reconnaissabilit\u00e9 des substitutions et complexit\u00e9 des suites automatiques","volume":"124","author":"Moss\u00e9","year":"1996","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB12","doi-asserted-by":"crossref","unstructured":"M. Queff\u00e9lec, Substitution Dynamical Systems Spectral Analysis, Lecture Notes in Mathematics vol. 1294, Springer, Berlin, 1987.","DOI":"10.1007\/BFb0081890"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB13","series-title":"Computational Complexity","author":"Wagner","year":"1986"},{"key":"10.1016\/S0304-3975(98)00192-3_BIB14","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/BF01295322","article-title":"Subshifts of finite type and sofic systems","volume":"77","author":"Weiss","year":"1973","journal-title":"Monats. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001923?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001923?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T14:56:08Z","timestamp":1555253768000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0304397598001923"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00192-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}