null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Finite Automata

List Price: $94.99
SKU:
9780367394998
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Mark V. Lawson
    Format:
    Paperback
    Pages:
    320
    Publisher:
    CRC Press (September 25, 2019)
    Imprint:
    Chapman and Hall/CRC
    Language:
    English
    ISBN-13:
    9780367394998
    Weight:
    16oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260403050946149-20260403.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $94.99
    Country of Origin:
    United States
    Pub Discount:
    30
    Case Pack:
    1
    As low as:
    $90.24
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
  • Overview

    Interest in semigroup theory and automata is currently on the rise, and the ideas of finite automata are becoming more accepted by the mathematical community. The time is right to begin introducing those ideas to students in mathematics and theoretical computer science. This book presents a well-motivated introduction to finite automata and semigroup theory and makes clear connections to other areas, including combinatorial group theory and symbolic dynamics as well as formal language theory and aspects of theoretical computer science. The author develops the underlying algebra gently but rigorously and includes more than 200 exercises with hints and solutions.