About: Simplifying Regular Expressions Further

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Simplifying Regular Expressions Further Goto Sponge Distinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ArticleEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #91292 Simplifying Regular Expressions Further
sameAs	Simplifying Regular Expressions Further
http://eprints.org/ontology/hasAccepted	Simplifying Regular Expressions Further (PDF)
http://eprints.org/ontology/hasDocument	Simplifying Regular Expressions Further (PDF) Simplifying Regular Expressions Further (Other) Simplifying Regular Expressions Further (Other) Simplifying Regular Expressions Further (Other) Simplifying Regular Expressions Further (Other) Simplifying Regular Expressions Further (Other)
dc:hasVersion	Simplifying Regular Expressions Further (PDF)
Title	Simplifying Regular Expressions Further
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
Date	2022
Creator	Colin Runciman Stefan Kahrs
status	peer reviewed published
Publisher	Elsevier
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.
Is Part Of	Journal of Symbolic Computation https://kar.kent.ac.uk/id/repository
Subject	QA 75 Electronic computers. Computer science QA 9 Formal systems, logics
list of authors	https://kar.kent.ac.uk/id/eprint/91292#authors
volume	109
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #91292 Simplifying Regular Expressions Further

Faceted Search & Find service v1.17_git144 as of Jul 26 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 37 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software