New answers tagged

3 votes

Translating non-deterministic finite automata with counters to deterministic ones

Yes, they can be employed in a straightforward way. However, the size of the formulas blows up exponentially big. Let $\ell_{s \to t}$ denote the formula on the NFA transition from $s$ to $t$. For ...
D.W.'s user avatar
  • 154k
0 votes

Dangling else determinism

As pointed by @Pseudonym a context-free language is deterministic if and only if it has a grammar such that is $LR(k)$, for some $k$. Let's take $k = 1$, the grammar is $LR(1)$ (and $LALR(1)$) so it ...
Blasco's user avatar
  • 1

Top 50 recent answers are included