One-unambiguous regular languages
Information and Computation
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Deterministic Regular Languages
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
XML type checking with macro tree transducers
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Learning deterministic regular expressions for the inference of schemas from XML data
Proceedings of the 17th international conference on World Wide Web
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Checking determinism of XML Schema content models in optimal time
Information Systems
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Validating XML documents in the streaming model with external memory
Proceedings of the 15th International Conference on Database Theory
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with counters.