{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T20:40:13Z","timestamp":1706042413135},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"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":[[1990,2]]},"DOI":"10.1007\/bf01237236","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T23:47:12Z","timestamp":1109375232000},"page":"179-186","source":"Crossref","is-referenced-by-count":12,"title":["On characterizations of recursively enumerable languages"],"prefix":"10.1007","volume":"28","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]},{"given":"Paavo","family":"Turakainen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B.S. Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci.8, 315?332 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","volume":"19","author":"R.V. Book","year":"1982","unstructured":"Book, R.V., Jantzen, M., Wrathall, C.: Monadic Thue systems. Theor. Comput. Sci.19, 231?251 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/322123.322136","volume":"26","author":"K. Culik II","year":"1979","unstructured":"Culik, K. II: A purely homomorphic characterization of recursively enumerable sets. J. Assoc. Comput. Math.26, 345?350 (1979)","journal-title":"J. Assoc. Comput. Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322203.322211","volume":"27","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J., Rozenberg, G.: Fixed point languages, equality languages, and representation of recursively enumerable languages. J. Assoc. Comput. Mach.27, 499?518 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(88)90068-0","volume":"62","author":"V. Geffert","year":"1988","unstructured":"Geffert, V.: A representation of recursively enumerable languages by two homomorphisms and a quotient. Theor. Comput. Sci.62, 235?249 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"CR6","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BFb0017154","volume-title":"Context-free-like forms for the phrase-structure grammars","author":"V. Geffert","year":"1988","unstructured":"Geffert, V.: Context-free-like forms for the phrase-structure grammars. (Lect. Notes Comput. Sci., vol. 324, pp. 309?317) Berlin Heidelberg New York: Springer 1988"},{"key":"CR7","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/BFb0036926","volume-title":"On composition of morphisms and inverse morphisms","author":"M. Latteux","year":"1983","unstructured":"Latteux, M., Leguy, J.: On composition of morphisms and inverse morphisms. (Lect. Notes Comput. Sci., vol. 154, pp. 420?432) Berlin Heidelberg New York: Springer 1983"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF00267045","volume":"22","author":"M. Latteux","year":"1985","unstructured":"Latteux, M., Leguy, J., Ratoandromanana, B.: The family of one-counter languages is closed under quotient. Acta Inf.22, 579?588 (1985)","journal-title":"Acta Inf."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(88)90135-4","volume":"28","author":"M. Latteux","year":"1988","unstructured":"Latteux, M., Timmerman, E.: Bifaithful starry transductions. Inf. Process. Lett.28, 1?4 (1988)","journal-title":"Inf. Process. Lett."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(78)90050-6","volume":"7","author":"J.E. Pin","year":"1978","unstructured":"Pin, J.E.: Sur le monoide syntactique deL * lorsqueL est un langage fini. Theor. Comput. Sci.7, 211?215 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"CR11","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal languages. New York: Academic Press 1973"},{"key":"CR12","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"Salomaa, A.: Jewels of Formal Language Theory. Rockville, Maryland: Computer Sience Press, 1981"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1137\/0202014","volume":"2","author":"W.J. Savitch","year":"1973","unstructured":"Savitch, W.J.: How to make arbitrary grammars look like context-free grammars. SIAM J. Comput.2, 174?182 (1973)","journal-title":"SIAM J. Comput."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/1385-7258(78)90031-8","volume":"40","author":"P. Turakainen","year":"1978","unstructured":"Turakainen, P.: On characterization of recursively enumerable languages in terms of linear languages and VW-grammars. Indagationes Math.40, 145?153 (1978)","journal-title":"Indagationes Math."},{"key":"CR15","first-page":"162","volume":"20","author":"P. Turakainen","year":"1983","unstructured":"Turakainen, P.: A machine-oriented approach to compositions of morphisms and inverse morphisms. Bull. EATCS20, 162?166 (1983)","journal-title":"Bull. EATCS"},{"key":"CR16","unstructured":"Turakainen, P.: Transducers and compositions of morphisms and inverse morphisms. In: Studies in honour of Arto Kustaa Salomaa on the occasion of his fiftieth birthday. Ann. Univ. Turku. Ser. A I186, 118?128 (1984)"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/00207168108803235","volume":"9","author":"P.M.B. Vit\u00e1nyi","year":"1981","unstructured":"Vit\u00e1nyi, P.M.B.: A note on DPDA transductions of {0,1}* and inverse DPDA transductions of the Dyck set. Int. J. Comput. Math.9, 131?137 (1981)","journal-title":"Int. J. Comput. Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/0022-0000(78)90028-4","volume":"16","author":"P.M.B. Vit\u00e1nyi","year":"1978","unstructured":"Vit\u00e1nyi, P.M.B., Savitch, W.J.: On inverse deterministic pushdown transductions. J. Comput. Syst. Sci.16, 423?444 (1978)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01237236.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01237236\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01237236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T20:20:44Z","timestamp":1706041244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01237236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["BF01237236"],"URL":"https:\/\/doi.org\/10.1007\/bf01237236","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}