gelade2009regular (795B)
1 # Gelade2009regular 2 3 [regular_expression_repetition] operator 4 5 not easy how to define [regular_expression_deterministic] with this operator 6 7 [regular_expression_strongly_deterministic] is now useful because it makes it possible to store only one counter configuration 8 9 - [counter_automata_definition] 10 - thanks to the threshold function, the entire configuration graph can be materialized 11 - if the automaton is [counter_automata_deterministic] then it is a [DFA] 12 - [glushkov_automaton] augmented with counters 13 - if the regexp is [regular_expression_strongly_deterministic] then the [gluskov_automaton] with counters is [counter_automata_deterministic] 14 15 also [dynamic_membership] in [bjorklund2015efficient] 16 17 Up: [academic_paper] on [regular_expressions_counting] 18 19 See also: [wim_martens]