Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-26T15:06:27.512Z Has data issue: false hasContentIssue false

4 - Automata

Published online by Cambridge University Press:  05 March 2013

Jean Berstel
Affiliation:
Université de Paris-Est
Dominique Perrin
Affiliation:
Université de Paris-Est
Christophe Reutenauer
Affiliation:
Université du Québec, Montréal
Get access

Summary

In this chapter, we study unambiguous automata. The main idea is to replace computations on words by computations on paths labeled by words. This is a technique which is well known in formal language theory. It will be used here in a special form related to the characteristic property of codes.

Within this frame, the main fact is the equivalence between codes and unambiguous automata. The uniqueness of paths in unambiguous automata corresponds to the uniqueness of factorizations for a code. Unambiguous automata appear to be a generalization of deterministic automata in the same manner as the notion of a code extends the notion of a prefix code.

We present devices for encoding and decoding, using transducers. A special class of transducers, called sequential transducers, is introduced. It will be shown in Chapter 5 to be related to the deciphering delay.

The chapter is organized as follows.

In the first section, we study unambiguous automata in connection with codes. In the next section, the flower automaton is defined. We show that it is a universal automaton in the sense that any unambiguous automaton associated with a code can be obtained by a reduction of the flower automaton of this code. We also show how to decompose the flower automaton of the composition of two codes.

In the last section, we use transducers. We introduce an algorithm to transform a transducer realizing a function into a sequential (possibly infinite) transducer.

Type
Chapter
Information
Codes and Automata , pp. 177 - 198
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×