Inclusion Test Algorithms for One-Unambiguous Regular Expressions
From MaRDI portal
Publication:5505596
Recommendations
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- CDuce: an XML-centric general-purpose language
- Derivatives of Regular Expressions
- Introduction to algorithms
- Mathematical Foundations of Computer Science 2004
- One-unambiguous regular languages
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- Rewriting regular inequalities
- THE ABSTRACT THEORY OF AUTOMATA
Cited in
(6)- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
- Efficient testing and matching of deterministic regular expressions
- The inclusion problem for regular expressions
- The inclusion problem for regular expressions
- One-unambiguity of regular expressions with numeric occurrence indicators
- Deciding definability by deterministic regular expressions
This page was built for publication: Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505596)