Derivatives of Regular Expressions

Cited in

(only showing first 100 items - show all)

Adapting functional programs to higher order logic
An axiom system for sequence-based specification
Generalized language equations with multiple solutions
Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems
On generalized language equations
Complete systems of \(\mathcal B\)-rational identities
Properties of code events and homomorphisms over regular events
Computers in semigroups
A specification of parallel problems
Regular expressions into finite automata
A matrix-linguistic method of analyzing finite discrete dynamic systems
The validation of SGML content models
From regular expressions to DFA's using compressed NFA's
Well-abstracted transition systems: Application to FIFO automata.
Follow automata.
Learning regular languages using RFSAs.
Derivatives of rational expressions and related theorems.
Reducing NFAs by invariant equivalences.
Alternating finite automata and star-free languages
Regular language representations in the constructive type theory of Coq
On series-parallel pomset languages: rationality, context-freeness and automata
Compiling and verifying SC-SystemJ programs for safety-critical reactive systems
The inclusion problem for regular expressions
Construction of fuzzy automata from fuzzy regular expressions
Derivatives of rational expressions with multiplicity
A type checking algorithm for concurrent object protocols
Canonical derivatives, partial derivatives and finite automaton constructions.
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Super-pattern matching
Almost event-rate independent monitoring
Some properties of inclusions of multisets and contractive Boolean operators
Lambek calculus with conjugates
Automata and rational expressions
Learning algorithms
A formally verified, optimized monitor for metric first-order dynamic logic
A set automaton to locate all pattern matches in a term
Compositional verification of concurrent systems by combining bisimulations
Manipulation of regular expressions using derivatives: an overview
Location based automata for expressions with shuffle
Context-free grammars with lookahead
Nondeterministic syntactic complexity
Applying string-rewriting to sequence-based specification
Verification and enforcement of access control policies
Functional dependencies on extended relations defined by regular languages
State-complexity hierarchies of uniform languages of alphabet-size length
Language operations with regular expressions of polynomial size
A mesh of automata
Context-free coalgebras
Deciding Kleene algebra terms equivalence in Coq
A goal-directed decision procedure for hybrid PDL
A formalisation of the Myhill-Nerode theorem based on regular expressions
On the hierarchy of generalizations of one-unambiguous regular languages
Bisimilar and logically equivalent programs in PDL with parallel operator
One-unambiguity of regular expressions with numeric occurrence indicators
Factor theory and the unity of opposites
Proof Pearl: regular expression equivalence and relation algebra
Derivatives and partial derivatives for regular shuffle expressions
A description based on languages of the final non-deterministic automaton
Boolean operations and inclusion test for attribute-element constraints
Closures which preserve finiteness in families of languages
Dot-depth of star-free events
General properties of star height of regular events
Star height of certain families of regular events
Solvable classes of discrete dynamic programming
Operads, quasiorders, and regular languages
Varieties and covarieties of languages (extended abstract)
Rational operational models
Fairness and communication-based semantics for session-typed languages
Derivatives for regular shuffle expressions
From \(\omega\)-regular expressions to Büchi automata via partial derivatives
From finite automata to regular expressions and back -- a summary on descriptional complexity
Position automaton construction for regular expressions with intersection
POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
On the state complexity of partial derivative automata for regular expressions with intersection
Derived-term automata of multitape rational expressions
Derivatives for Enhanced Regular Expressions
Types from Frames as Finite Automata
Derivatives of regular expressions and an application
The complexity of regular(-like) expressions
On the average state complexity of partial derivative automata: an analytic combinatorics approach
Deciding regular expressions (in-)equivalence in Coq
The full quotient and its closure property for regular languages
Efficient program transformers for translating \(\mathsf {LCC}\) to \(\mathsf {PDL}\)
Stream differential equations: specification formats and solution methods
Conversion of fuzzy automata into fuzzy regular expressions using transitive closure
Equational theories of abnormal termination based on Kleene algebra
Partial derivatives for context-free languages. From -regular expressions to pushdown automata
From grammars and automata to algebras and coalgebras
Corrigendum to our paper: How Expressions Can Code for Automata
Partial derivative automata formalized in Coq
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
Construction of tree automata from regular expressions
A Decision Procedure for Regular Expression Equivalence in Type Theory
Overlap-free languages and solid codes
Static trace-based deadlock analysis for synchronous Mini-Go
Derived-term automata for extended weighted rational expressions
Deriving Syntax and Axioms for Quantitative Regular Behaviours
A propositional dynamic logic for concurrent programs based on the -calculus
On the coalgebraic theory of Kleene algebra with tests
ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

This page was built for publication: Derivatives of Regular Expressions

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