{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:10:38Z","timestamp":1762297838041},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:35:34Z","timestamp":1330194934000},"page":"157-168","source":"Crossref","is-referenced-by-count":38,"title":["Regular expressions for infinite trees and a standard form of automata"],"prefix":"10.1007","author":[{"given":"A. W.","family":"Mostowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"15_CR1","unstructured":"Karpi\u0144ski M., Decidability of the weak definiability in the s2s theories. 3-d symposium of MFCS, Zabor\u00f3w, January 21\u201326 1980, ICS PAS Reports 411 p.47\u201348."},{"key":"15_CR2","first-page":"59","volume":"15","author":"R. McNaughton","year":"1983","unstructured":"McNaughton R., Testing and generating infinite sequences by a finite trees and inequalities between various Rabin pair indices, Information processing letters 15 1983, pl.59\u2013163","journal-title":"Information processing letters"},{"key":"15_CR3","unstructured":"Mostowski A.W., Classes of automata of a given Rabin pair index. Proceedings of workshop on algorithms and computing theory, September 7\u201310,1981 ed. by M.Karpi\u0144ski and Z.Habasi\u0144ski, Pozna\u0144 1981."},{"key":"15_CR4","unstructured":"Mostowski A.W., On differences on automata on infinite trees and those on sequences, Report on the 1-st GTI Workshop, Lutz Prietze ed. Universitat Padderborn, Reiche Teoretische Informatik Marz 1982."},{"key":"15_CR5","first-page":"239","volume":"1","author":"M. O. Rabin","year":"1970","unstructured":"Rabin M.O., Decidability and definiability in Second-order Theories, Actes Congress Intern. Math., 1970 Tome 1 p.239\u2013244.","journal-title":"Actes Congress Intern. Math."},{"key":"15_CR6","first-page":"1","volume-title":"Weakly definiable relations and special automata","author":"M. O. Rabin","year":"1970","unstructured":"Rabin M.O., Weakly definiable relations and special automata. Math.Logic Foundations Set Theory, North Holland 1970 p.1\u201323."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Thatcher J.W. Wright J.B., Generalised Finite Automata Theory with an Application to Second-order Logic. Math. Systems Theory, vol.2, p.57\u201381.","DOI":"10.1007\/BF01691346"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"Wagner K., On \u03c9-regular Sets. Information and Control 43 1979, p.123\u2013177.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:02:49Z","timestamp":1619557369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}