{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:41:06Z","timestamp":1658565666540},"reference-count":12,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270100231","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:56:05Z","timestamp":1486047365000},"page":"23-48","source":"Crossref","is-referenced-by-count":5,"title":["A fast algorithm to decide on the equivalence of stateless DPDA"],"prefix":"10.1051","volume":"27","author":[{"given":"Didier","family":"Caucal","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. CAUCAL D., D\u00e9cidabilit\u00e9 de l'\u00e9galit\u00e9 des langages alg\u00e9briques infinitaires simples, L.N.CS., Vol. 210, 1986, pp. 37-48.8277230595.68072","DOI":"10.1007\/3-540-16078-7_63"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. CAUCAL D., A Fast Algorithm to Decide on Simple Grammars Equivalence, L.N.C.S., Vol. 401 1989, pp. 66-85.10481560704.68072","DOI":"10.1007\/3-540-51859-2_8"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. COURCELLE B., An Axiomatic Approach to the KH Algorithms, Math. Systems Theory, Vol. 16, 1983, pp. 191-231.7024480581.68032","DOI":"10.1007\/BF01744577"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. COURCELLE B. and VUILLEMIN J., Completeness Result for the Equivalence of Recursive Schemes, J.C.S.S., Vol. 12, 1976, pp. 179-197.4112250342.68008","DOI":"10.1016\/S0022-0000(76)80036-0"},{"key":"R5","unstructured":"5. HARRISON M., Introduction to Formal Language Theory, Addison-Wesley, 1978.5263970411.68058"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HARRISON M., HAVEL I. and YEDUHA\u00cf A., On Equivalence of Grammars Through Transformation Trees, T.C.S.,Vol. 9, 1979, pp. 191-231.5405550409.68041","DOI":"10.1016\/0304-3975(79)90024-0"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. KORENJAK A. and HOPCROFT J., Simple Deterministic Languages, Seventh annual I.E.E.E. switching and automata theory conference, 1966, pp. 36-46","DOI":"10.1109\/SWAT.1966.22"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. OLSHANSKY T. and PNUELI A., A Direct Algorithm for Checking Equivalence of LL(k) Grammars, T.C.S., Vol. 4, 1977, pp. 321-349.4619960358.68118","DOI":"10.1016\/0304-3975(77)90016-0"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. OYAMAGUCHI M. and HONDA N., The Decidability of Equivalence for Deterministic Stateless Pushdown Automata, Information and Control, Vol. 38, 1978, pp. 367-376.5095590393.68078","DOI":"10.1016\/S0019-9958(78)90139-0"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. TOMITA E., An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata, T.C.S., Vol. 32, 1984, pp. 87-1207611630552.68065","DOI":"10.1016\/0304-3975(84)90026-4"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. VALIANT L., The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata, Information and Control, Vol. 25, 1974, pp. 123-153.3915910285.68025","DOI":"10.1016\/S0019-9958(74)90839-0"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. VALIANT L. and PATERSON M., Deterministic One-Counter Automata, J.C.S.S., Vol. 10, 1975, pp. 340-350.3791490307.68038","DOI":"10.1016\/S0022-0000(75)80005-5"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270100231\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:20:22Z","timestamp":1658564422000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270100231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":12,"journal-issue":{"issue":"1"},"alternative-id":["ita1993270100231"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270100231","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}