Description

Book Synopsis
One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup­ theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger.

Table of Contents
I Mathematical Preliminaries.- I.1 Words and Languages.- I.2 Automata and Regular Languages.- I.3 Semigroups and Homomorphisms.- II Formal Languages and Formal Logic.- II.1 Examples.- II.2 Definitions.- III Finite Automata.- III.1 Monadic Second-Order Sentences and Regular Languages.- III.2 Regular Numerical Predicates.- III.3 Infinite Words and Decidable Theories.- IV Model-Theoretic Games.- IV.1 The Ehrenfeucht-Fraïssé Game.- IV.2 Application to FO[

Finite Automata Formal Logic and Circuit Complexity Progress in Theoretical Computer Science

    Product form

    £80.99

    Includes FREE delivery

    RRP £89.99 – you save £9.00 (10%)

    Order before 4pm today for delivery by Fri 19 Jun 2026.

    A Hardback by Howard Straubing

    1 in stock


      View other formats and editions of Finite Automata Formal Logic and Circuit Complexity Progress in Theoretical Computer Science by Howard Straubing

      Publisher: Birkhauser Boston
      Publication Date: 03/05/1994
      ISBN13: 9780817637194, 978-0817637194
      ISBN10:

      Description

      Book Synopsis
      One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup­ theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger.

      Table of Contents
      I Mathematical Preliminaries.- I.1 Words and Languages.- I.2 Automata and Regular Languages.- I.3 Semigroups and Homomorphisms.- II Formal Languages and Formal Logic.- II.1 Examples.- II.2 Definitions.- III Finite Automata.- III.1 Monadic Second-Order Sentences and Regular Languages.- III.2 Regular Numerical Predicates.- III.3 Infinite Words and Decidable Theories.- IV Model-Theoretic Games.- IV.1 The Ehrenfeucht-Fraïssé Game.- IV.2 Application to FO[

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account