{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:37Z","timestamp":1725468517674},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055807","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"571-579","source":"Crossref","is-referenced-by-count":1,"title":["Representing hyper-graphs by regular languages"],"prefix":"10.1007","author":[{"given":"Salvatore La","family":"Torre","sequence":"first","affiliation":[]},{"given":"Margherita","family":"Napoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren and D. Seese, \u201cEasy problems for tree-decomposable graphs\u201d, Journal of Algorithms, 12 (1991) 308\u2013340.","journal-title":"Journal of Algorithms"},{"key":"54_CR2","unstructured":"K. Barthelmann, \u201cWhen Can an Equational Simple Graph Be Generated by Hyperedge Replacement?\u201d, this Volume."},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon and B. Courcelle, \u201cGraph Expressions and Graph Rewritings\u201d, Mathematical System Theory, 20 (1987) 83\u2013127.","journal-title":"Mathematical System Theory"},{"issue":"2","key":"54_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"H. L. Bodlaender","year":"1993","unstructured":"H. L. Bodlaender and R. H. M\u00f6hring, \u201cThe pathwidth and treewidth of cographs\u201d, SIAM Journal on Discrete Mathematics, 6 (2) (1993) 181\u2013188.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"D. Caucal, \u201cOn infinite transition graphs having a decidable monadic theory\u201d, Proc. of ICALP'96, (F. M. auf der Heide and B. Monien, Eds.), Lecture Notes in Computer Science, vol. 1099 (1996) 194\u2013205.","DOI":"10.1007\/3-540-61440-0_128"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D. G. Corneil, H. Lerchs and L. Stuart Burlingham, \u201cComplement reducible graphs\u201d, Discrete Applied Mathematics, 3 (1981) 163\u2013174.","journal-title":"Discrete Applied Mathematics"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"B. Courcelle, \u201cThe monadic second-order logic of graphs. II. Infinite graphs of bounded width\u201d, Mathematical System Theory, 21 (1989) 187\u2013121.","journal-title":"Mathematical System Theory"},{"key":"54_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"B. Courcelle, \u201cThe monadic second-order logic of graphs. III. Tree-width, forbidden minors and complexity issues\u201d, RAIRO Inform. Th\u00e9or. Appl., 26 (1992) 257\u2013286.","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"54_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jcss.1996.0013","volume":"52","author":"A. Ehrenfeucht","year":"1996","unstructured":"A. Ehrenfeucht, J. Engelfriet and G. Rozenberg, \u201cFinite Languages for the Representation of Finite Graphs\u201d, Journal of Computer and System Sciences, 52 (1996) 170\u2013184.","journal-title":"Journal of Computer and System Sciences"},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(94)00272-X","volume":"154","author":"J. Engelfriet","year":"1996","unstructured":"J. Engelfriet, T. Harju, A. Proskurowski and G. Rozenberg, \u201cCharacterization and Complexity of Uniformly Non-primitive Labeled 2-Structures\u201d, Theoretical Computer Science, 154 (1996) 247\u2013282.","journal-title":"Theoretical Computer Science"},{"key":"54_CR11","unstructured":"J. Hopcroft and J. Ullman, \u201cIntroduction to Automata Theory, Formal Languages and Computation\u201d Addison-Wesley Series in Computer Science (Addison-Wesley Publishing Company) (1979)."},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. Seymour, \u201cGraph Minors. II Algorithmic aspects of treewidth\u201d, Journal of Algorithms, 7 (1986) 309\u2013322.","journal-title":"Journal of Algorithms"},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdez","year":"1982","unstructured":"J. Valdez, R. E. Tarjan and E. Lawler, \u201cThe recognition of series parallel digraphs\u201d, SIAM Journal of Computing, 11 (1982) 298\u2013313.","journal-title":"SIAM Journal of Computing"},{"key":"54_CR14","unstructured":"www.unisa.it\/papers\/g.ps.gz"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T18:51:32Z","timestamp":1549911092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0055807","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}