{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:21:27Z","timestamp":1778498487530,"version":"3.51.4"},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"value":"354010576X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017309","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"167-183","source":"Crossref","is-referenced-by-count":799,"title":["Concurrency and automata on infinite sequences"],"prefix":"10.1007","author":[{"given":"David","family":"Park","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A. Derivatives of regular expressions. J. ACM 11, 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R. Weak second order arithmetic and finite automata. Z. Math. Logik u Grund. Math. 6, 66\u201392 (1960).","journal-title":"Z. Math. Logik u Grund. Math."},{"key":"21_CR3","unstructured":"B\u00fcchi, J.R. On a decision method in restricted second order arithmetic. Proc. Int. Congr. Logic, Method., Phil. of Sci. 1960. Stanford U. Press, 1962."},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Choueka, Y. Theories of automata on \u03c9-tapes: a simplified approach. J. Comp. Sys. Sci. 8, 117\u2013141 (1974).","journal-title":"J. Comp. Sys. Sci."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/321386.321399","volume":"14","author":"A. Ginzburg","year":"1967","unstructured":"Ginzburg, A. A procedure for checking equality of regular expressions. J. ACM 14, 355\u2013362 (1967).","journal-title":"J. ACM"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Ginzburg, A. \u201cAlgebraic Theory of Automata.\u201d Academic Press 1968.","DOI":"10.1016\/B978-1-4832-0013-2.50009-6"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L. Landweber","year":"1969","unstructured":"Landweber, L. Decision problems for omega-automata. Math. Sys. Thy. 3 376\u2013384 (1969).","journal-title":"Math. Sys. Thy."},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R. Testing and generating infinite sequences by a finite automaton. Inf. & Control 9, 521\u2013530 (1966).","journal-title":"Inf. & Control"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Muller, D.E. Infinite sequences and finite machines. Proc. 4th Ann. Symp. on Switching Circuit Theory and Logical Design, 3\u201316. IEEE 1963.","DOI":"10.1109\/SWCT.1963.8"},{"key":"21_CR10","unstructured":"Milner, R. An algebraic definition of simulation between programs. Proc. 2nd Int. Joint. Conf. on Artificial Intelligence. British Comp. Soc. 1971."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Park, D. On the semantics of fair parallelism. 504\u2013526 in \u201cAbstract Software Specifications\u201d (Proc. 1979 Copenhagen Winter School) ed. D. Bj\u00f8rner. Springer Lec. Notes in Comp. Sci. 86. (1980).","DOI":"10.1007\/3-540-10007-5_47"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M. & Scott, D. Finite automata and their decision problems. IBM J of Res. & Dev. 3, 114\u2013125 (1959).","journal-title":"IBM J of Res. & Dev."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A. Two complete axiom systems for the algebra of regular events. J. ACM 13, 158\u2013169 (1966).","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017309.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:11Z","timestamp":1607531891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0017309","relation":{},"subject":[]}}