{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:27:18Z","timestamp":1761766038870},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T00:00:00Z","timestamp":1462924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00500-016-2164-4","type":"journal-article","created":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T03:31:06Z","timestamp":1462937466000},"page":"1067-1083","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Weighted restarting automata"],"prefix":"10.1007","volume":"22","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]},{"given":"Qichao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,11]]},"reference":[{"key":"2164_CR1","doi-asserted-by":"crossref","unstructured":"Bollig B, Gastin P, Monmege B, Zeitoun M (2010) Pebble weighted automata and transitive closure logics. In: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG (eds) ICALP 2010, Part II, Lecture notes in computer science, Springer, Heidelberg, vol 6199, pp 587\u2013598","DOI":"10.1007\/978-3-642-14162-1_49"},{"key":"2164_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-rewriting systems. Texts and monographs in computer science","author":"RV Book","year":"1993","unstructured":"Book RV, Otto F (1993) String-rewriting systems. Texts and monographs in computer science. Springer, New York"},{"key":"2164_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee K, Doyen L, Henzinger TA (2009) Probabilistic weighted automata. In: Bravetti M, Zavattaro G (eds) CONCUR 2009, Proc., Lecture Notes in Computer Science, vol 5710, Springer, Heidelberg, pp 244\u2013258","DOI":"10.1007\/978-3-642-04081-8_17"},{"key":"2164_CR4","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/0022-0000(86)90062-0","volume":"33","author":"E Dahlhaus","year":"1986","unstructured":"Dahlhaus E, Warmuth MK (1986) Membership for growing context-sensitive grammars is polynomial. J Comput Syst Sci 33:456\u2013472","journal-title":"J Comput Syst Sci"},{"key":"2164_CR5","unstructured":"Droste M, G\u00f6tze D (2013) The support of nested weighted automata. In: Bensch S, Drewes F, Freund R, Otto F (eds) NCMA 2013, Proc., Oesterreichische Computer Gesellschaft, Wien, books@ocg.at, Band 294, pp 101\u2013116"},{"key":"2164_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-01492-5_1","volume-title":"Handbook of weighted automata, monographs in theoretical computer science","author":"M Droste","year":"2009","unstructured":"Droste M, Kuich W (2009) Semirings and formal power series. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata, monographs in theoretical computer science. Springer, Heidelberg, pp 3\u201328"},{"key":"2164_CR7","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1142\/S0129054111009069","volume":"22","author":"M Droste","year":"2011","unstructured":"Droste M, Meinecke I (2011) Weighted automata and regular expressions over valuation monoids. Int J Found Comput Sci 22:1829\u20131844","journal-title":"Int J Found Comput Sci"},{"key":"2164_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of weighted automata. Monographs in theoretical computer science","author":"M Droste","year":"2009","unstructured":"Droste M, Kuich W, Vogler H (2009) Handbook of weighted automata. Monographs in theoretical computer science. Springer, Heidelberg"},{"key":"2164_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and their applications","author":"JS Golan","year":"1999","unstructured":"Golan JS (1999) Semirings and their applications. Kluwer Academic Publishers, Dordrecht"},{"key":"2164_CR10","doi-asserted-by":"crossref","DOI":"10.1142\/3903","volume-title":"Semirings: algebraic theory and applications in computer science","author":"U Hebisch","year":"1998","unstructured":"Hebisch U, Weinert HJ (1998) Semirings: algebraic theory and applications in computer science. World Scientific, Singapore"},{"key":"2164_CR11","unstructured":"Hundeshagen N (2013) Relations and transductions realized by restarting automata. Doctoral thesis, Universit\u00e4t Kassel"},{"key":"2164_CR12","doi-asserted-by":"crossref","unstructured":"Hundeshagen N, Otto F (2012) Characterizing the rational functions by restarting transducers. In: Dediu AH, Mart\u00edn-Vide C (eds) LATA 2012, Proc., Lecture notes in computer science, vol 7183. Springer, Heidelberg, pp 325\u2013336","DOI":"10.1007\/978-3-642-28332-1_28"},{"key":"2164_CR13","doi-asserted-by":"crossref","unstructured":"Jan\u010dar P, Mr\u00e1z F, Pl\u00e1tek M, Vogel J (1995) Restarting automata. In: Reichel H (ed) FCT, Lecture notes in computer science, vol 965. Springer, Heidelberg, pp 283\u2013292","DOI":"10.1007\/3-540-60249-6_60"},{"key":"2164_CR14","doi-asserted-by":"crossref","unstructured":"Jan\u010dar P, Mr\u00e1z F, Pl\u00e1tek M, Vogel J (1997) On restarting automata with rewriting. In: P\u01ceun G, Salomaa A (eds) New trends in formal languages, Lecture notes in computer science, vol 1218. Springer, Heidelberg, pp 119\u2013136","DOI":"10.1007\/3-540-62844-4_8"},{"key":"2164_CR15","doi-asserted-by":"crossref","unstructured":"Jan\u010dar P, Mr\u00e1z F, Pl\u00e1tek M, Vogel J (1998) Different types of monotonicity for restarting automata. In: Arvind V, Ramanujam S (eds) Foundations of software technology and theoretical computer science, Lecture notes in computer science, vol 1530. Springer, Heidelberg, pp 343\u2013354","DOI":"10.1007\/978-3-540-49382-2_32"},{"issue":"4","key":"2164_CR16","first-page":"287","volume":"4","author":"P Jan\u010dar","year":"1999","unstructured":"Jan\u010dar P, Mr\u00e1z F, Pl\u00e1tek M, Vogel J (1999) On monotonic automata with a restart operation. J Autom Lang Comb 4(4):287\u2013311","journal-title":"J Autom Lang Comb"},{"issue":"4","key":"2164_CR17","first-page":"407","volume":"9","author":"T Jurdzi\u0144ski","year":"2004","unstructured":"Jurdzi\u0144ski T, Lory\u015b K, Niemann G, Otto F (2004) Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages. J Autom Lang Comb 9(4):407\u2013437","journal-title":"J Autom Lang Comb"},{"key":"2164_CR18","doi-asserted-by":"crossref","unstructured":"Kirsten D (2009) The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. In: Diekert V, Nowotka D (eds) DLT 2009, Lecture Notes in Computer Science, vol 5583. Springer, Heidelberg, pp 326\u2013333","DOI":"10.1007\/978-3-642-02737-6_26"},{"key":"2164_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.14232\/actacyb.20.2.2011.1","volume":"20","author":"D Kirsten","year":"2011","unstructured":"Kirsten D (2011) The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybern 20:211\u2013221","journal-title":"Acta Cybern"},{"issue":"2","key":"2164_CR20","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R McNaughton","year":"1988","unstructured":"McNaughton R, Narendran P, Otto F (1988) Church\u2013Rosser Thue systems and formal languages. J ACM 35(2):324\u2013344","journal-title":"J ACM"},{"key":"2164_CR21","doi-asserted-by":"crossref","unstructured":"Niemann G, Otto F (2000) Restarting automata, Church\u2013Rosser languages, and representations of r.e. languages. In: Rozenberg G, Thomas W (eds) Developments in Language Theory\u2014Foundations, Applications, and Perspectives, DLT 1999, Proc., World Scientific, Singapore, pp 103\u2013114","DOI":"10.1142\/9789812792464_0009"},{"key":"2164_CR22","first-page":"269","volume-title":"Recent advances in formal languages and applications, studies in computational intelligence","author":"F Otto","year":"2006","unstructured":"Otto F (2006) Restarting automata. In: \u00c9sik Z, Mart\u00edn-Vide C, Mitrana V (eds) Recent advances in formal languages and applications, studies in computational intelligence, vol 25. Springer, Heidelberg, pp 269\u2013303"},{"key":"2164_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-theoretic aspects of formal power series. Texts and monographs in computer science","author":"A Salomaa","year":"1978","unstructured":"Salomaa A, Soittola M (1978) Automata-theoretic aspects of formal power series. Texts and monographs in computer science. Springer, New York"},{"issue":"2\u20133","key":"2164_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger MP (1961) On the definition of a family of automata. Inform Control 4(2\u20133):245\u2013270","journal-title":"Inform Control"},{"key":"2164_CR25","doi-asserted-by":"crossref","unstructured":"Stra\u0148\u00e1kov\u00e1 M (2000) Selected types of pg-ambiguity: processing based on analysis by reduction. In: Sojka P, Kope\u010dek I, Pala K (eds) Text, speech and dialogue, Lecture notes in computer science, vol 1902. Springer, Heidelberg, pp 139\u2013144","DOI":"10.1007\/3-540-45323-7_24"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2164-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:46:17Z","timestamp":1559079977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,11]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2164"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2164-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,11]]}}}