{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:41Z","timestamp":1725664601834},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_129","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:38:05Z","timestamp":1330292285000},"page":"206-218","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semi-groups acting on context-free graphs"],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"17_CR1","first-page":"18","volume":"4","author":"A. V. Anisimov","year":"1971","unstructured":"A. V. Anisimov. Group languages. Kibernetica 4, pages 18\u201324, 1971.","journal-title":"Kibernetica"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0890-5401(89)90054-0","volume":"82","author":"A. Arnold","year":"1989","unstructured":"A. Arnold and A. Dicky. Transition systems equivalence. Information and Computation 82, pages 198\u2013229, 1989.","journal-title":"Information and Computation"},{"key":"17_CR3","first-page":"94","volume":"259","author":"J. Baeten","year":"1987","unstructured":"J. Baeten, J. Bergstra, and J. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE 87, LNCS 259, pages 94\u2013111. 1987.","journal-title":"LNCS"},{"key":"17_CR4","unstructured":"H. Bass and J.P. Serre. Arbres, amalgames, SL2. SMF, collection ast\u00e9risque, nr 46, 1983."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(91)90222-N","volume":"82","author":"M. Bauderon","year":"1991","unstructured":"M. Bauderon. Infinite hypergraph I, basic properties (fundamental study). TCS 82, pages 177\u2013214, 1991.","journal-title":"TCS"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(92)90011-4","volume":"103","author":"M. Bauderon","year":"1992","unstructured":"M. Bauderon. Infinite hypergraph II, systems of recursive equations. TCS 103, pages 165\u2013190, 1992.","journal-title":"TCS"},{"key":"17_CR7","first-page":"59","volume":"B","author":"J. Berstel","year":"1991","unstructured":"J. Berstel and L. Boasson. Context-free languages. In Handbook of theoretical computer science, vol. B, Chapter 2, pages 59\u2013102. Elsevier, 1991.","journal-title":"Handbook of theoretical computer science"},{"key":"17_CR8","first-page":"339","volume":"nr 24-4","author":"D. Caucal","year":"1990","unstructured":"D. Caucal. Graphes canoniques de graphes alg\u00e9briques. RAIRO TIA, nr 24-4, pages 339\u2013352, 1990.","journal-title":"RAIRO TIA"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"D. Caucal. On the regular structure of prefix rewritings. TCS 106, pages 61\u201386, 1992.","journal-title":"TCS"},{"key":"17_CR10","first-page":"1","volume":"53","author":"D. Caucal","year":"1995","unstructured":"D. Caucal. Bisimulation of context-free grammars and of pushdown automata. To appear in CSLI, Modal Logic and process algebra, vol. 53, Stanford, pages 1\u201320, 1995.","journal-title":"To appear in CSLI, Modal Logic and process algebra"},{"key":"17_CR11","first-page":"138","volume":"630","author":"S. Christensen","year":"1992","unstructured":"S. Christensen, H. Hiittel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, LNCS 630, pages 138\u2013147. 1992.","journal-title":"LNCS"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"B. Courcelle. The monadic second-order logic of graphs ii: infinite graphs of bounded width. Math. Systems Theory 21, pages 187\u2013221, 1989.","journal-title":"Math. Systems Theory"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"B. Courcelle. Graph rewriting: and algebraic and logic approach. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 193\u2013242, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"17_CR14","unstructured":"B. Courcelle. The monadic second-order logic of graphs IV: definability properties of equational graphs. Annals of Pure and Applied Logic, pages 183\u2013255, 1990."},{"key":"17_CR15","unstructured":"W. Dicks and M.J. Dunwoody. Groups acting on graphs. Cambridge University Press, 1990."},{"key":"17_CR16","unstructured":"S. Eilenberg. Automata, Languages and Machines, vol. A. Academic Press, 1974."},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"C. Frougny and J. Sakarovitch. Synchronized rational relations of finite and infinite words. TCS 108, pages 45\u201382, 1993.","journal-title":"TCS"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF02992834","volume":"39","author":"R. Halin","year":"1973","unstructured":"R. Halin. Automorphisms and endomorphisms of infinite locally finite graphs. Abh. Math. Sem. Univ. Hamburg 39, pages 251\u2013283, 1973.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"17_CR19","unstructured":"M.A. Harrison. Introduction To Formal Language Theory. Addison-Wesley, 1978."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. In Proceedings of Dagstuhl seminar on Algorithms in Automata theory. To appear in TCS, 1994.","DOI":"10.1007\/978-3-540-48654-1_5"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"C.M. Hoffmann. Group-theoretic algorithms and graph-isomorphism. LNCS 136, 1982.","DOI":"10.1007\/3-540-11493-9"},{"issue":"no3","key":"17_CR22","first-page":"295","volume":"26","author":"D. E. Muller","year":"1983","unstructured":"D. E. Muller and P. E. Schupp. Groups, the theory of ends and context-free languages. JCSS vol 26, no 3, pages 295\u2013310, 1983.","journal-title":"JCSS"},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. E. Muller","year":"1985","unstructured":"D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata and second-order logic. TCS 37, pages 51\u201375, 1985.","journal-title":"TCS"},{"key":"17_CR24","first-page":"167","volume":"104","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. LNCS 104, pages 167\u2013183, 1981.","journal-title":"LNCS"},{"key":"17_CR25","unstructured":"L. Pelecq. Automorphism groups of context-free graphs. Accepted for publication in TCS, pages 1\u201317, 1995."},{"key":"17_CR26","first-page":"1","volume":"1","author":"G. Senizergues","year":"1989","unstructured":"G. Senizergues. Graphes context-free. Notes de cours de DEA de l'universit\u00e9 de Bordeaux 1, pages 1\u201398, 1989.","journal-title":"Notes de cours de DEA de l'universit\u00e9 de Bordeaux"},{"key":"17_CR27","unstructured":"G. Senizergues. Semi-groups acting on context-free graphs. LaBRI internal report nr 1094\u201395, can be accessed at the URL, http:\/\/www.labri.u-bordeaux.fr\/, 1995."},{"key":"17_CR28","unstructured":"G. S\u00e9nizergues. The isomorphism problem for the transition-graphs of pushdown automata. Talk given at FAIT 89, Wuerzburg, Germany, December 1989."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T19:11:14Z","timestamp":1687288274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}