Definitionresearch
One-unambiguous regular expression
Also called deterministic regular expression, one-unambiguous expression.
A regex whose positions can be matched by a one-symbol lookahead, so it has a deterministic Glushkov automaton.
A regex whose positions can be matched by a one-symbol lookahead, so it has a deterministic Glushkov automaton.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag PBD15E Edit this page History Report an error