Skip to main content
SpringerLink
Log in

Nondeterministic FAs

  • Chapter
  • First Online:
The Pillars of Computation Theory

Part of the book series: Universitext ((UTX))

  • 1582 Accesses

Abstract

The material in this section refines the development in Chapter 10 by restricting attention to NOAs whose set Q of states is finite. We call such an NOA a nondeterministic finite automaton (NFA, for short).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Colorado State University, Fort Collins, CO, USA

    Arnold L. Rosenberg (Research Professor)

  2. University of Massachusetts, Amherst, MA, USA

    Arnold L. Rosenberg (Research Professor)

Authors
  1. Arnold L. Rosenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arnold L. Rosenberg .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag New York

About this chapter

Cite this chapter

Rosenberg, A.L. (2010). Nondeterministic FAs. In: The Pillars of Computation Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09639-1_11

Download citation

Publish with us

Policies and ethics

Search

Navigation