Design of Sequential Machines from Their Regular Expressions
Journal of the ACM (JACM)
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
On Concatenative Decompositions of Regular Events
IEEE Transactions on Computers
A Grammar Based Model for XML Schema Integration
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
An XML document transformation algorithm inferred from an edit script between DTDs
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
State complexity of unique rational operations
Theoretical Computer Science
Deciding determinism of caterpillar expressions
Theoretical Computer Science
A homomorphism theorem for weighted context-free grammars
Journal of Computer and System Sciences
Efficient transformations from regular expressions to finite automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
From Glushkov WFAs to rational expressions
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Typed and unambiguous pattern matching on strings using regular expressions
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Learning regular expressions from representative examples and membership queries
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Context-Free grammars and XML languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The validation of SGML content models
Mathematical and Computer Modelling: An International Journal
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
The inclusion problem for regular expressions
Journal of Computer and System Sciences
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
Automata-based symbolic string analysis for vulnerability detection
Formal Methods in System Design
| Hi-index | 14.98 |
A regular expression is called unambiguous if every tape in the event can be generated from the expression in one way only. The flow-graph technique for constructing an expression is shown to preserve ambiguities of the graph, and thus, if the graph is that of a deterministic automaton, the expression is unambiguous. A procedure for generating a nondeterministic automaton which preserves the ambiguities of the given regular expression is described. Finally, a procedure for testing whether a given expression is ambiguous is given.