Software—Practice & Experience
Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Programming Perl
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Towards efficient implementation of XML schema content models
Proceedings of the 2004 ACM symposium on Document engineering
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Regular Expressions with Counting: Weak versus Strong Determinism
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Pillars of computer science
Checking determinism of XML Schema content models in optimal time
Information Systems
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Checking determinism of regular expressions with counting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
We study deterministic regular expressions extended with the counting operator. There exist two notions of determinism, strong and weak determinism, which are equally expressive for standard regular expressions. This, however, changes dramatically in the presence of counting. In particular, we show that weakly deterministic expressions with counting are exponentially more succinct and strictly more expressive than strongly deterministic ones, even though they still do not capture all regular languages. In addition, we present a finite automaton model with counters, study its properties, and investigate the natural extension of the Glushkov construction translating expressions with counting into such counting automata. This translation yields a deterministic automaton if and only if the expression is strongly deterministic. These results then also allow us to derive upper bounds for decision problems for strongly deterministic expressions with counting.