,

Turn Complexity of Context-free Languages, Pushdown and One-Counter Automata

,

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