{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:20:43Z","timestamp":1648923643809},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2002,2]]},"abstract":"<jats:p>The aim of this paper is to compare three efficient representations of the position automaton of a regular expression: the Thompson \u220a-automaton, the [Formula: see text]-structure and the \u2131-structure, an optimization of the [Formula: see text]-structure. These representations are linear w.r.t. the size s of the expression, since their construction is in O(s) space and time, as well as the computation of the set \u03b4(X,a) of the targets of the transitions by a of any subset X of states. The comparison is based on the evaluation of the number of edges of the underlying graphs respectively created by the construction step or visited by the computation of a set \u03b4(X,a).<\/jats:p>","DOI":"10.1142\/s0129054102000972","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:05:45Z","timestamp":1027767945000},"page":"99-113","source":"Crossref","is-referenced-by-count":4,"title":["EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS"],"prefix":"10.1142","volume":"13","author":[{"given":"JEAN-MARC","family":"CHAMPARNAUD","sequence":"first","affiliation":[{"name":"Laboratoire d'Informatique Fondamentale et Appliqu\u00e9e, Universit\u00e9 de Rouen, F-76821 Mont-Saint-Aignan Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90287-4"},{"key":"p_5","first-page":"88","volume":"644","author":"Chang C.-H.","year":"1992","journal-title":"Lecture Notes in Computer Science"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1070\/RM1961v016n05ABEH004112"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055777"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023448"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63174-7_9"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"p_14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.36045\/bbms\/1105730628","volume":"4","author":"Ziadi D.","year":"1997","journal-title":"Bull. Belg. Math. Soc"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054102000972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,5]],"date-time":"2020-03-05T04:54:28Z","timestamp":1583384068000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054102000972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,2]]}},"alternative-id":["10.1142\/S0129054102000972"],"URL":"https:\/\/doi.org\/10.1142\/s0129054102000972","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}