Skip to main content
Book Chapter

The Complexity of Translating Logic to Finite Automata

  • Reinhardt K
DOI: 10.1007/3-540-36387-4_13
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Reinhardt, K. (2002). The Complexity of Translating Logic to Finite Automata (pp. 231–238). https://doi.org/10.1007/3-540-36387-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free