[{"data": {"name": "Translating Regular Expressions into Small \u03b5-Free Nondeterministic Finite Automata", "@type": "ScholarlyArticle", "genre": "journal-article", "author": [{"name": "Juraj Hromkovi\u010d", "@type": "Person"}, {"name": "Sebastian Seibert", "@type": "Person"}, {"name": "Thomas Wilke", "@type": "Person"}], "@context": "http://schema.org/", "encoding": [{"@type": "MediaObject", "contentUrl": "http://pdfs.semanticscholar.org/1672/83803961a7216e349d27bcbfb4ee377393c8.pdf", "encodingFormat": "application/pdf"}], "publisher": {"name": "Elsevier BV", "@type": "Organization"}, "identifier": [{"@type": "PropertyValue", "value": "10.1006/jcss.2001.1748", "propertyID": "DOI"}, {"@type": "PropertyValue", "value": "CCfenxJhEmwCk-CTKDdUZFGMugz-CD1PpA4Gg17Yt-CR3YfCbHu63CW", "propertyID": "ISCC"}], "datePublished": "2001-06-01"}, "schema": "schema.org", "mediatype": "application/ld+json"}]