{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:39:27Z","timestamp":1649180367038},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1007\/bf00289112","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T13:55:24Z","timestamp":1096898124000},"page":"245-253","source":"Crossref","is-referenced-by-count":0,"title":["A regularity test for dual bordered OS systems"],"prefix":"10.1007","volume":"23","author":[{"given":"W.","family":"Bucher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00289411","volume":"20","author":"W. Bucher","year":"1983","unstructured":"Bucher, W.: Two-Symbol DOS Systems Generating Regular Languages. Acta Inf. 20, 133?142 (1983)","journal-title":"Acta Inf."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(85)90162-8","volume":"40","author":"W. Bucher","year":"1985","unstructured":"Bucher, W., Ehrenfeucht, A., Haussler, D.: On Total Regulators Generated by Derivation Relations. Theor. Comput. Sci. 40, 131?148 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. London: Chapman & Hall 1971"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On Regularity of Context-Free Languages. Theor. Comput. Sci. 27, 311?332 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"CR5","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Reading: Addison Wesley 1978"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by Divisibility in Abstract Algebras. Proc. Lond. Math. Soc. Ser. III, 2, 326?336 (1952)","journal-title":"Proc. Lond. Math. Soc. Ser. III"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/00207167908803161","volume":"7","author":"T. Harju","year":"1979","unstructured":"Harju, T., Penttonen, M.: Some Decidability Problems of Sentential Forms. Int. J. Comput. Math. 7, 95?108 (1979)","journal-title":"Int. J. Comput. Math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J.P. Kruskal","year":"1972","unstructured":"Kruskal, J.P.: The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. J. Comb. Theory, Ser. A, 13, 297?305 (1972)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"CR9","first-page":"244","volume":"117","author":"M. Linna","year":"1981","unstructured":"Linna, M.: On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. Proc. 3rd FCT, LNCS 117, 244?249 (1981)","journal-title":"Proc. 3rd FCT, LNCS"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0019-9958(80)90131-X","volume":"44","author":"H. Maurer","year":"1980","unstructured":"Maurer, H., Salomaa, A., Wood, D.: Pure grammars. Inf. Control 44, 47?72 (1980)","journal-title":"Inf. Control"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF00571462","volume":"2","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: On Sentential Forms of Context-Free Grammars. Acta Inf. 2, 40?49 (1973)","journal-title":"Acta Inf."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289112.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289112\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:40Z","timestamp":1554743680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF00289112"],"URL":"https:\/\/doi.org\/10.1007\/bf00289112","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}