Sheet1
Page 1
Transducer Problem
 
An NDFT, or nondeterministic finite transducer, is an
NDFA, a nondeterministic finite automaton, with output.
We will first describe NDFA's and introduce the notation
we will use, and then we will describe NDFT's.
You
will be asked to simulate the execution of NDFT's.
An NDFA consists of a labeled directed graph, with nodes
called `states' and arrows called `transitions', and two
designated nodes of the graph: the start and stop state.
We will use strictly positive integers, 1, 2, 3, ..., as
labels of states, and lower case letters, a, b, c, ...,
as labels of transitions.
We will denote a transition
as
LABEL : ORIGIN > TARGET
where LABEL is the transition label, ORIGIN is the label
of the transition origin state, and TARGET is the label
of the transition target state.
An NDFA can be describ
ed by a sequence of such transition denotations and the
labels of the start and stop states.
A path through an NDFA is a sequence of transitions with
the target of each but the last being the origin of the
next transition in the sequence.
The origin of the path
is the origin of the first transition, and the target of
the path is the target of the last transition.
The
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '11
 k.v.arya

Click to edit the document details