Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)
The Complexity of Translating Logic to Finite Automata
The aim of this chapter is to show a non-elementary lower bound for the complexity of translating logic to finite automata.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2002