{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:57Z","timestamp":1730280717451,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785848","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-12","source":"Crossref","is-referenced-by-count":3,"title":["Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete"],"prefix":"10.1109","author":[{"given":"Petr","family":"Jancar","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_31"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2307\/2272973"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00285-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743435"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_221"},{"journal-title":"Algorithmic complexity of well-quasi-orders","year":"2017","author":"schmitz","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_70"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-5(1:2)2009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1142\/9789812562494_0054"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700377256"},{"key":"ref10","first-page":"260","article-title":"Fast equivalence-checking for normed context-free processes","volume":"8","author":"czerwi?ski","year":"2010","journal-title":"Proc FSTTCS'10 ser Leibniz Int Proc Inf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"journal-title":"Introduction to Formal Language Theory","year":"1978","author":"harrison","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00064-X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61604-7_60"},{"key":"ref15","first-page":"5: 1","article-title":"Undecidability of bisimilarity by Defender's forcing","volume":"55","author":"jan?ar","year":"2008","journal-title":"J ACM"},{"key":"ref16","first-page":"415","article-title":"Decidability of DPDA language equivalence via first-order grammars","author":"jan?ar","year":"2012","journal-title":"Proc LICS'12"},{"key":"ref17","first-page":"10: 1","article-title":"Bisimilarity on basic process algebra is in 2EXPTIME (an explicit proof)","volume":"9","author":"jan?ar","year":"2013","journal-title":"Log Meth Comput Sci"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-662-43951-7_20","article-title":"Bisimulation equivalence of first-order grammars","volume":"8573","author":"jan?ar","year":"2014","journal-title":"Proc ICALP'14 ser Lect Notes in Comput Sci"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-54830-7_1","article-title":"Equivalences of pushdown systems are hard","volume":"8412","author":"jan?ar","year":"2014","journal-title":"Proc FoS-SaCS '14 ser Lect Notes in Comput Sci"},{"key":"ref28","first-page":"1","article-title":"Complexity bounds for ordinal-based termination","volume":"8762","author":"schmitz","year":"2014","journal-title":"Proc RP 2014 ser Lect Notes in Comput Sci"},{"key":"ref4","first-page":"160","article-title":"On bisimilarity of higher-order pushdown automata: Undecidability at order two","volume":"18","author":"broadbent","year":"2012","journal-title":"Proc FSTTCS'12 ser Leibniz Int Proc Inf"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15155-2_54"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.11.003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1992.185539"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2858784"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60246-1_148"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00009-1"},{"key":"ref7","first-page":"85","article-title":"Bisimulation of context-free grammars and pushdown automata","volume":"53","author":"caucal","year":"1995","journal-title":"Modal Logic and Process Algebra a bisimulation perspective"},{"journal-title":"Modal Correspondence Theory","year":"1975","author":"van benthem","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"key":"ref1","first-page":"488","article-title":"Bisimilarity of pushdown automata is nonelernentary","author":"benedikt","year":"2013","journal-title":"Proc LICS'13"},{"key":"ref20","first-page":"52: 1","article-title":"Deciding semantic finiteness of pushdown processes and first-order grammars w. r. t. bisimulation equivalence","volume":"58","author":"jan?ar","year":"2016","journal-title":"Proc MFCS’ 16 ser Leibniz Int Proc Inf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.12.004"},{"journal-title":"Equivalence of pushdown automata via first-order grammars","year":"2018","author":"jan?ar","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_46"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01967649"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785848.pdf?arnumber=8785848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785848\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785848","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}