Abstract

This Hilbert Method, as discussed in this paper, is the idea to encode combinatorial objects used by automata, such as words or trees, into algebraic objects, such as numbers and polynomials, and to reason about the latter using results about polynomials like Hilbert's Basis Theorem. A typical application of the method is deciding of equivalence for string-to-string transducers that use registers.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call