11-711: Algorithms for NLP Homework Assignment #1: Formal Language Theory Solutions
Out: September 10, 2009 Due: September 24, 2009
Problem 1 [10 points]
Prove that, for any deterministic FSA A = (Q,
Tutorial for OpenFST and PyFST
11-711 Class Recitation
September 5th, 2013
Slides adapted from : http:/www.openfst.org/twiki/bin/view/FST/FstSltTutorial
More examples and information in : http:/www.op
11-711: Algorithms for NLP
Homework Assignment #0: Installing the Tools Youll Need
Out: August 27, 2013
Due: September 3, 2013
(No materials actually need to be turned-in)
1
Introduction
These instruc
Morphology with
Finite-
State Machines
(Con7nued)
Algorithms for NLP
September 5, 2013
Outline
Some linguis7c phenomena
Dicul7es with formally dening the problem
of mor
Morphology with
Finite-
State Machines
Algorithms for NLP
September 3, 2013
Administrivia
Academic honesty policies
Assignment 1
Outline
1. Some linguisFc phenomena
2
Minimization of FSA
Can we transform a large automaton into a smaller one
(provided a smaller one exists)?
If A is a DFSA, is there an algorithm for constructing an
equivalent minimal automaton Amin
Recitation 2: Power Set Construction and
Pumping Lemma for Regular Languages
11-711: Algorithms for NLP
September 13, 2013
Power Set Construction
Example NDFSA A
NDFSA A = (Q , , , q0 , F ):
1
q0
q1
1
11-711: Algorithms for NLP
Recitation #2: Power Set Construction and Pumping Lemma
Solutions
Power Set Construction
Given the following NDFSA A over = cfw_0, 1,
1
q0
q1
1
0
1
q3
q2
use the power set c
The Not So Short
A
Introduction to L TEX 2
A
Or LTEX 2 in 157 minutes
by Tobias Oetiker
Hubert Partl, Irene Hyna and Elisabeth Schlegl
Version 5.01, April 06, 2011
ii
Copyright 1995-2011 Tobias Oetike