The Complexity of Translating Logic to Finite Automata

  • Klaus Reinhardt
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)

Abstract

The aim of this chapter is to show a non-elementary lower bound for the complexity of translating logic to finite automata.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Klaus Reinhardt
    • 1
  1. 1.Wilhelm-Schickhard Institut für InformatikEberhard-Karls-Universität TübingenGermany

Personalised recommendations