This HTML5 document contains 30 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n21https://kar.kent.ac.uk/91292/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
dchttp://purl.org/dc/elements/1.1/
n11http://purl.org/ontology/bibo/status/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n16https://kar.kent.ac.uk/id/subject/
n18https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n3http://eprints.org/ontology/
bibohttp://purl.org/ontology/bibo/
n9https://kar.kent.ac.uk/id/publication/
n12https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5doi:10.1016/
owlhttp://www.w3.org/2002/07/owl#
n19https://kar.kent.ac.uk/id/eprint/91292#
n6https://kar.kent.ac.uk/id/document/
n8https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n15https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:91292
rdf:type
n3:ArticleEPrint n3:EPrint bibo:AcademicArticle bibo:Article
rdfs:seeAlso
n21:
owl:sameAs
n5:j.jsc.2021.08.003
n3:hasAccepted
n6:3253014
n3:hasDocument
n6:3253040 n6:3253215 n6:3253216 n6:3253217 n6:3253014 n6:3253218
dc:hasVersion
n6:3253014
dcterms:title
Simplifying Regular Expressions Further
wdrs:describedby
n14:export_kar_RDFN3.n3 n18:export_kar_RDFN3.n3
dcterms:date
2022
dcterms:creator
n15:ext-colin.runciman@cs.york.ac.uk n15:ext-s.m.kahrs@kent.ac.uk
bibo:status
n11:peerReviewed n11:published
dcterms:publisher
n12:ext-f308aad1ef8f70546c3a197f104f2ad5
bibo:abstract
We describe a cumulative series of transformations to simplify regular expressions, and investigate their effectiveness and cost. Transformations depending on increasingly powerful comparisons of expressions give results clearly superior to commonly used algebraic simplifications. Early in the series, efficient transformations enabled by language-invariant attributes are surprisingly effective. Later in the series, transformations depending on comparisons of expressed languages are made feasible by bounding the size of subexpressions to which they are applied. We set out the principles of our transformations, address some key implementation issues, and evaluate the results of systematic test measurements.
dcterms:isPartOf
n8:repository n9:ext-07477171
dcterms:subject
n16:QA75 n16:QA9
bibo:authorList
n19:authors
bibo:volume
109