{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T05:56:08Z","timestamp":1721454968328},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p> Regular expressions are often ambiguous. We present a novel method based on Brzozowski\u2019s derivatives to aid the user in diagnosing ambiguous regular expressions. We introduce a derivative-based finite state transducer to generate parse trees and minimal counter-examples. The transducer can be easily customized to either follow the POSIX or Greedy disambiguation policy and based on a finite set of examples it is possible to examine if there are any differences between POSIX and Greedy. <\/jats:p>","DOI":"10.1142\/s0129054117400068","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T08:31:43Z","timestamp":1513326703000},"page":"543-561","source":"Crossref","is-referenced-by-count":4,"title":["Derivative-Based Diagnosis of Regular Expression Ambiguity"],"prefix":"10.1142","volume":"28","author":[{"given":"Martin","family":"Sulzmann","sequence":"first","affiliation":[{"name":"Faculty of Computer Science and Business Information Systems, Karlsruhe University of Applied Sciences, Moltkestrasse 30, 76133 Karlsruhe, Germany"}]},{"given":"Kenny Zhuo Ming","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Information Technology, Nanyang Polytechnic, 180 Ang Mo Kio Avenue 8, Singapore 569830, Singapore"}]}],"member":"219","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"S0129054117400068BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00182-4"},{"key":"S0129054117400068BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90088-5"},{"key":"S0129054117400068BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223204"},{"key":"S0129054117400068BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"S0129054117400068BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117400068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T16:20:24Z","timestamp":1565194824000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117400068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":5,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2017,12,15]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S0129054117400068"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117400068","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}