발행물
컨퍼런스
The 29th International Conference on Developments in Language Theory
,
Positive Varieties of Lattice Languages
On the transformation of two-way nondeterministic finite automata to unambiguous finite automata
Left Quotients of Deterministic Context-Free Languages
Checking whether two unambiguous grammars describe the same set of strings of length n
Nondeterminism Makes Unary 1-Limited Automata Concise