Partial derivative automaton by compressing regular expressions

DOI10.1007/978-3-030-93489-7_9OpenAlexW4205833112MaRDI QIDQ2096587FDOQ2096587

Authors: Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis 

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93489-7_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Analytic combinatorics
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Partial derivatives of regular expressions and finite automaton constructions
• Title not available (Why is that?)
• Variations on the Common Subexpression Problem
• Title not available (Why is that?)
• Algorithms on Strings
• Regular expressions into finite automata
• Fast equation automaton computation
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Simplifying regular expressions. A quantitative perspective
• On average behaviour of regular expressions in strong star normal form
• On the average state complexity of partial derivative automata: an analytic combinatorics approach
• On the Average Size of Glushkov’s Automata
• On the average size of Glushkov and partial derivative automata
• On the size of partial derivatives and the word membership problem

Cited In (4)

• Prefix and Right-Partial Derivative Automata
• Location automata for regular expressions with shuffle and intersection
• Partial Derivative Automaton for Regular Expressions with Shuffle
• Manipulation of regular expressions using derivatives: an overview

This page was built for publication: Partial derivative automaton by compressing regular expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096587)