From regular expressions to deterministic automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Deterministic generalized automata
Theoretical Computer Science
Characterization of Glushkov automata
Theoretical Computer Science
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers
On validation of XML streams using finite state machines
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Generalizations of 1-deterministic regular languages
Information and Computation
Multi-tape automata with symbol classes
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We introduce the notions of blocked, block-marked and blockdeterministic regular expressions. We characterize block-deterministic regular expressions with deterministic Glushkov block automata. The results can be viewed as a generalization of the characterization of one-unambiguous regular expressions with deterministic Glushkov automata. In addition, when a language L has a block-deterministic expression E, we can construct a deterministic finite-state automaton for L that has size linear in the size of E.