{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:50:52Z","timestamp":1648734652878},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2002,12]]},"abstract":"<jats:p> We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton. <\/jats:p>","DOI":"10.1142\/s0129054102001515","type":"journal-article","created":{"date-parts":[[2002,11,21]],"date-time":"2002-11-21T10:17:37Z","timestamp":1037873857000},"page":"873-887","source":"Crossref","is-referenced-by-count":0,"title":["PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING  LANGUAGES"],"prefix":"10.1142","volume":"13","author":[{"given":"NADIA","family":"NEDJAH","sequence":"first","affiliation":[{"name":"Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rua S\u00e3o Francisco Xavier, 524, Sala 5022-D, Maracan\u00e3, Rio de Janeiro, RJ, 20559-900, Brazil"}]},{"given":"LUIZA DE MACEDO","family":"MOURELLE","sequence":"additional","affiliation":[{"name":"Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rua S\u00e3o Francisco Xavier, 524, Sala 5022-D, Maracan\u00e3, Rio de Janeiro, RJ, 20559-900, Brazil"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53904-2_107"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380151205"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52592-0_68"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"p_9","first-page":"273","volume":"1298","author":"Nedjah CD.","year":"1997","journal-title":"Proc. 6th. International Conference on Algebraic and Logic Programming, Southampton, UK, Lecture Notes in Computer Science, Springer-Verlag"},{"key":"p_10","first-page":"9","volume":"29","author":"Nedjah CD.","year":"1999","journal-title":"Software-Practice and Experience, John Wiley"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793246252"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054102001515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:34:10Z","timestamp":1565192050000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054102001515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":8,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,12]]}},"alternative-id":["10.1142\/S0129054102001515"],"URL":"https:\/\/doi.org\/10.1142\/s0129054102001515","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}