Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Term Rewriting Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regular Expressions into Finite Automata
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
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
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
Counter automata for parameterised timing analysis of box-based systems
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the same languages as the usual regular expressions, but are exponentially more succinct. We define a class of finite automata with counters and a deterministic subclass of these. Deterministic finite automata with counters can recognize words in linear time. Furthermore, we describe a subclass of the regular expressions with numerical constraints, a polynomial-time test for this subclass, and a polynomial-time construction of deterministic finite automata with counters from expressions in the subclass.