http://iet.metastore.ingenta.com
1887

## Finite automata

• Author(s):
• DOI:

$16.00 (plus tax if applicable) ##### Buy Knowledge Pack 10 chapters for$120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:

Handbook of Mathematical Models for Languages and Computation — Recommend this title to your library

## Thank you

In this five-section chapter, we cover finite automata that represents perhaps the simplest language-accepting rewriting systems. In Section 5.1, we define their basic versions. Then, in Section 5.2, we introduce finite automata that read a symbol during every single computational step. In Section 5.3, we study deterministic finite automata. In Section 5.4, we cover several reduced and minimal versions of finite automata. Finally, in Section 5.5, we define regular expressions and demonstrate the equivalence between them and finite automata.

Chapter Contents:

• 5.1 Mathematical elements of finite automata
• 5.1.1 How to specify finite automata
• 5.1.1.1 Informal description
• 5.1.1.2 State table
• 5.1.1.3 State diagram
• 5.1.1.4 Formal description
• 5.2 Finite automata that always read
• 5.3 Determinism
• 5.4 Reduction and minimization
• 5.5 Regular expressions

Inspec keywords:

Preview this chapter:

Finite automata, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch5-1.gif /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch5-2.gif

### Related content

content/books/10.1049/pbpc026e_ch5
pub_keyword,iet_inspecKeyword,pub_concept
6
6
This is a required field