{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:31Z","timestamp":1725798871531},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_8","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"76-83","source":"Crossref","is-referenced-by-count":1,"title":["Graph Spectral Properties of Deterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Ryoma","family":"Sin\u2019ya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"B\u00e9al, M.P., Crochemore, M.: Minimizing incomplete automata. In: Finite-State Methods and Natural Language Processing (FSMNLP 2008), pp. 9\u201316. Joint Research Center (2008), \n                    \n                      http:\/\/igm.univ-mlv.fr\/~beal\/Recherche\/Publications\/minimizingIncomplete.pdf"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF01185866","volume":"28","author":"C. Choffrut","year":"1995","unstructured":"Choffrut, C., Goldwurm, M.: Rational transductions and complexity of counting problems. Mathematical Systems Theory\u00a028(5), 437\u2013450 (1995), \n                    \n                      http:\/\/dblp.uni-trier.de\/db\/journals\/mst\/mst28.html#ChoffrutG95a","journal-title":"Mathematical Systems Theory"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/22145.22194","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985","author":"A. Goldberg","year":"1985","unstructured":"Goldberg, A., Sipser, M.: Compression and ranking. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 440\u2013448. ACM, New York (1985), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/22145.22194"},{"key":"8_CR4","volume-title":"Graph Spectra for Complex Networks","author":"P.V. Mieghem","year":"2011","unstructured":"Mieghem, P.V.: Graph Spectra for Complex Networks. Cambridge University Press, New York (2011)"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"8_CR6","first-page":"145","volume":"10","author":"S.M. Osnaga","year":"2005","unstructured":"Osnaga, S.M.: On rank one matrices and invariant subspaces. Balkan Journal of Geometry and its Applications (BJGA)\u00a010(1), 145\u2013148 (2005), \n                    \n                      http:\/\/eudml.org\/doc\/126283","journal-title":"Balkan Journal of Geometry and its Applications (BJGA)"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Shur, A.M.: Combinatorial complexity of regular languages. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 289\u2013301. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-79709-8_30"},{"key":"8_CR9","unstructured":"Shur, A.M.: Combinatorial characterization of formal languages. CoRR abs\/1010.5456 (2010), \n                    \n                      http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1010.html#abs-1010-5456"},{"key":"8_CR10","unstructured":"Sin\u2019ya, R.: Rans: More advanced usage of regular expressions, \n                    \n                      http:\/\/sinya8282.github.io\/RANS\/"},{"key":"8_CR11","unstructured":"Sin\u2019ya, R.: Text compression using abstract numeration system on a regular language. Computer Software\u00a030(3), 163\u2013179 (2013), English extended abstract is available at \n                    \n                      http:\/\/arxiv.org\/abs\/1308.0267\n                    \n                    \n                   (in Japanese)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Sin\u2019ya, R.: Graph spectral properties of deterministic finite au tomata (full paper, 12 pages) (2014), \n                    \n                      http:\/\/www.shudo.is.titech.ac.jp\/members\/sinya","DOI":"10.1007\/978-3-319-09698-8_8"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09698-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:12:43Z","timestamp":1558973563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}