9th International Colloquium on Grammatical Inference

Using Multiplicity automata to identify transducer Relations from membership and equivalence queries

author:José Oncina, University of Alicante
published: Oct. 9, 2008, recorded: September 2008, views: 67

You might be experiencing some problems with Your Video player.

Slides

Slides
0:00	Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
0:18	Motivation - 1
0:54	Motivation - 2
1:27	Motivation - 3
2:15	Motivation - 4
3:30	Outline
3:52	Outline - Multiplicity Automata
3:55	Multiplicity Automata
6:21	Multiplicity Automata Example
7:36	The Hankel Matrix
10:26	Carlyle and Paz theorem - 1
10:27	Carlyle and Paz theorem - 2
11:02	Carlyle and Paz theorem - 3
12:11	Carlyle and Paz theorem - 4
12:55	Carlyle and Paz theorem - 5
13:22	Outline - Exact Learning
13:33	Queries - 1
14:31	Queries - 2
14:58	The exact learning model
15:34	The MA Learning Algorithm
16:25	Outline - A bit of Algebra
16:31	What is a Field?
17:35	Working with transducers
18:14	Concatenation extension - 1
18:59	Concatenation extension - 2
19:29	Concatenation extension - 3
20:11	Multiset inclusion extension - 1
20:25	Multiset inclusion extension - 2
21:02	Multiset inclusion extension - 3
21:29	Combining concatenation and inclusion - 1
22:05	Combining concatenation and inclusion - 2
23:19	Outline - Examples
23:21	Non ambiguous, non subsequential example
24:20	The Result - 1
25:33	The Result - 2
27:46	An ambiguous example - 1
29:23	An ambiguous example - 2
31:30	Another ambiguous example
31:47	Conclusions
32:57	Any Questions?

Related content

Visitors who watched this lecture also watched...