Modelling Dialogue Systems by Finite Automata
by
Ivan Kopeček,
Libor Škarvada,
March 2003, 13 pages.
FIMU-RS-2003-01.
Available as Postscript,
PDF.
Abstract:
Based on finite state formalization, this paper deals with
the problem of modelling and automatic programming of dialogue systems.
The approach presented here is based on finding an operator (a construction)
that assigns a corresponding dialogue system to a dialogue corpus.
It will be shown that this construction is universal, in the sense
that each dialogue system can be obtained in this way, and some
related issues (uniqueness, algorithmization and algorithmical
complexity) will be briefly discussed. The theory is illustrated on
a simple example. Some related problems are formulated.