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.
Publisher
Association for Computing Machinery (ACM)
Reference11 articles.
1. Rajeev Alur and Pavol Cerný. 2010. Expressiveness of streaming string transducers. FSTTCS (2010). Rajeev Alur and Pavol Cerný. 2010. Expressiveness of streaming string transducers. FSTTCS (2010).
2. Michael Benedikt Timothy Duff Aditya Sharad and James Worrell. 2017. Polynomial automata - Zeroness and applications. LICS (2017) 1--12. Michael Benedikt Timothy Duff Aditya Sharad and James Worrell. 2017. Polynomial automata - Zeroness and applications. LICS (2017) 1--12.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finite-valued Streaming String Transducers;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Slice closures of indexed languages and word equations with counting constraints;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Characterizing attributed tree translations in terms of macro tree transducers;Theoretical Computer Science;2023-06