Regular Languages and Finite State Recognisers

  • Alan P. Parkes
Chapter

Abstract

This chapter is concerned with the most restricted class of languages in the Chomsky hierarchy(as introduced in Chapter 2): the regular languages. In particular, we encounter our first, and most simple, type of abstract machine, the finite state recogniser (FSR).

Keywords

Start State Regular Language Input String Derivation Tree Null State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2002

Authors and Affiliations

  • Alan P. Parkes
    • 1
  1. 1.Distributed Multimedia Research Group, Computing DepartmentLancaster UniversityLancaster

Personalised recommendations