Complexity of decision problems for simple regular expressions
From MaRDI portal
Recommendations
- Complexity of decision problems for XML schemas and chain regular expressions
- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
- The complexity of SORE-definability problems
- Succinctness of the Complement and Intersection of Regular Expressions
- Complexity of Data Tree Patterns over XML Documents
Cited in
(22)- Efficient inclusion checking for deterministic tree automata and XML schemas
- The inclusion problem for regular expressions
- Complexity of regex crosswords
- Checking determinism of regular expressions with counting
- One-unambiguity of regular expressions with numeric occurrence indicators
- The complexity of regular(-like) expressions
- Succinctness of the Complement and Intersection of Regular Expressions
- Extended Regular Expressions: Succinctness and Decidability
- Active XML document rewriting based on tree automata theory
- Complexity of decision problems for XML schemas and chain regular expressions
- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
- The complexity of SORE-definability problems
- Weak inclusion for XML types
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions
- Regular Expressions with Counting: Weak versus Strong Determinism
- Distributed XML design
- Incremental algorithms for solving regular expression intersection non-emptiness
- Automata for XML -- a survey
- Frontiers of tractability for typechecking simple XML transformations
- Schemas for unordered XML on a DIME
- Efficient inclusion for a class of XML types with interleaving and counting
This page was built for publication: Complexity of decision problems for simple regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311160)