Authors: Jonas Mansson
Abstract
In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains. We also show how these automata can be used to compute the Hilbert series and Poincaré series for any algebra with a rational set of leading words of its minimal Gröbner basis.
Jonas Mansson,
Lund University,
Department of Mathematics
Solvegatan, 18,
Box 118, S-22100,
Lund, Sweden
e-mail:
Fulltext
–
0.21 Mb