6533b856fe1ef96bd12b2f5c
RESEARCH PRODUCT
Block-Deterministic Regular Languages
Derick WoodRosa MontalbanoDora Giammarresisubject
Deterministic pushdown automatonDiscrete mathematicsDeterministic finite automatonNested wordDeterministic automatonDeterministic context-free grammarQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematicsdescription
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.
year | journal | country | edition | language |
---|---|---|---|---|
2001-01-01 |