From Hadamard Expressions to Weighted Rotating Automata and Back
This paper deals with the conversion of expressions denoting Hadamard series into weighted rotating automata. We prove that any algorithm converting rational series into one-way weighted automata can be extended to provide an algorithm which achieves our goal. We apply this to define the derivation and the follow automata of a Hadamard expression. Our method is also used to extend algorithms which perform the inverse conversion, up to some adjustment in order to fulfill some constraints.
- 4.Guillon, B.: Two-wayness: automata and transducers. Ph.D. thesis, Université Paris Diderot - Università degli studi di Milano, Paris (2016)Google Scholar
- 11.Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of STOC, pp. 275–286. ACM (1978)Google Scholar