Bibliographic Details
| Title: |
Polynomially Ambiguous Unary Weighted Automata over Fields. |
| Authors: |
Kostolányi, Peter1 (AUTHOR) kostolanyi@fmph.uniba.sk |
| Superior Title: |
Theory of Computing Systems. Apr2023, Vol. 67 Issue 2, p291-309. 19p. |
| Subject Terms: |
*ROBOTS, *MACHINE theory, DIFFERENCE equations, POWER series |
| Abstract: |
Every univariate rational series over an algebraically closed field is shown to be realised by some polynomially ambiguous unary weighted automaton. Unary weighted automata over algebraically closed fields thus always admit polynomially ambiguous equivalents. On the other hand, it is shown that this property does not hold over any other field of characteristic zero, generalising a recent observation about unary weighted automata over the field of rational numbers. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theory of Computing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Premier |
|
Full text is not displayed to guests. |
Login for full access.
|