Login / Signup

The equivalence problem for N.T.S. languages is decidable.

Géraud Sénizergues
Published in: Theoretical Computer Science (1983)
Keyphrases