[
Lists Home |
Date Index |
Thread Index
]
From: "Henry S. Thompson" <ht@cogsci.ed.ac.uk>
> Any non-deterministic finite-state automata can be determinized.
>
> Some non-deterministic regular expressions _cannot_ be determinized.
>
> A common example of a non-determinizable regexp is the one for chess
> games:
>
> w(bw)*b?
I'm getting that "jargon soup" feeling. When you talk about "determinizing"
an NFA, I guess you mean converting it to a DFA.
But when you talk about "determinizing" a regular expression, I guess you
mean converting it to a deterministic regular expression.
No relationship between these two operatons.
Bob Foster
|
