{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T14:07:04Z","timestamp":1709561224356},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0020-0190(03)00281-3","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:15:45Z","timestamp":1054595745000},"page":"187-193","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic finite automata with recursive calls and DPDAs"],"prefix":"10.1016","volume":"87","author":[{"given":"Jean H.","family":"Gallier","sequence":"first","affiliation":[]},{"given":"Salvatore","family":"La Torre","sequence":"additional","affiliation":[]},{"given":"Supratik","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00281-3_BIB001","series-title":"Proc. of the 6th ACM Symposium on the Foundations of Software Engineering","first-page":"175","article-title":"Model checking of hierarchical state machines","author":"Alur","year":"1998"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB002","series-title":"Proc. of the 13th International Conference on Computer-Aided Verification, CAV'01","first-page":"207","article-title":"Analysis of recursive state machines","volume":"2102","author":"Alur","year":"2001"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB003","series-title":"Proc. of the 28th International Colloquium Automata, Languages and Programming, ICALP'01","first-page":"652","article-title":"Model checking of unrestricted hierarchical state machines","volume":"2076","author":"Benedikt","year":"2001"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB004","series-title":"Unified Modeling Language User Guide","author":"Booch","year":"1997"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB005","series-title":"Proc. of the 3rd International Conference on Machines, Computations and Universality, MCU'01","first-page":"177","article-title":"On the transition graphs of Turing machines","volume":"2055","author":"Caucal","year":"2001"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB006","series-title":"Proc. of the 17th IEEE Symposium on Foundations of Computer Science, FOCS'76","first-page":"137","article-title":"Algebraic families of interpretations","author":"Courcelle","year":"1976"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB007","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02088013","article-title":"The monadic second-order logic of graphs: II. Infinite graphs of bounded width","volume":"21","author":"Courcelle","year":"1989","journal-title":"Math. System Theory"},{"issue":"2","key":"10.1016\/S0020-0190(03)00281-3_BIB008","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(81)90055-4","article-title":"Dpda's in \u201catomic normal form\u201d and applications to equivalence problems","volume":"14","author":"Gallier","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(03)00281-3_BIB009","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","article-title":"Statecharts: a visual formalism for complex systems","volume":"8","author":"Harel","year":"1987","journal-title":"Sci. Comput. Programm."},{"key":"10.1016\/S0020-0190(03)00281-3_BIB010","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB011","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","article-title":"Strict deterministic grammars","volume":"7","author":"Harrison","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(03)00281-3_BIB012","first-page":"95","article-title":"Systems of pushdown acceptors and context-free grammars","volume":"6","author":"Kuich","year":"1970","journal-title":"EIK"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB013","series-title":"Proc. of the 17th IEEE Symposium on Foundations of Computer Science, FOCS'76","first-page":"122","article-title":"Categories for fixpoint semantic","author":"Lehmann","year":"1976"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB014","first-page":"255","article-title":"On the interpretation of recursive polyadic program schemes","volume":"15","author":"Nivat","year":"1975","journal-title":"Sympos. Math."},{"key":"10.1016\/S0020-0190(03)00281-3_BIB015","series-title":"Proc. of the 24th International Colloquium Automata, Languages and Programming, ICALP'97","first-page":"671","article-title":"The equivalence problem for deterministic pushdown automata is decidable","volume":"1256","author":"S\u00e9nizergues","year":"1997"},{"key":"10.1016\/S0020-0190(03)00281-3_BIB016","series-title":"Proc. of the 3rd International Conference on Machines, Computations and Universality, MCU'01","first-page":"114","article-title":"Some applications of the decidability of DPDA's equivalence","volume":"2055","author":"S\u00e9nizergues","year":"2001"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(03)00281-3_BIB017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00389-3","article-title":"Decidability of DPDA equivalence","volume":"255","author":"Stirling","year":"2001","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"10.1016\/S0020-0190(03)00281-3_BIB018","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/355598.362773","article-title":"Transition network grammars for natural language analysis","volume":"13","author":"Woods","year":"1970","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T23:56:19Z","timestamp":1553126179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0020019003002813"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00281-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}