A COMPLETE MAPLE PACKAGE FOR NONCOMMUTATIVE RATIONAL POWER SERIES

Author(s):  
V. HOUSEAUX ◽  
G. JACOB ◽  
N.E. OUSSOUS ◽  
M. PETITOT
1984 ◽  
Vol 29 (2) ◽  
pp. 153-159 ◽  
Author(s):  
Antonio Restivo ◽  
Christophe Reutenauer

2015 ◽  
Vol 26 (08) ◽  
pp. 1127-1146 ◽  
Author(s):  
Vincent Carnino ◽  
Sylvain Lombardy

This paper deals with one-way and two-way weighted automata. When the semiring of weights is commutative, we prove that unambiguous one-way automata, unambiguous two-way automata and deterministic two-way automata realize the same (rational) power series. If the semiring of weights is not commutative, unambiguous one-way automata and deterministic two-way automata realize the same rational power series, but unambiguous two-way automata may realize non rational power series.


1981 ◽  
Vol 48 (2) ◽  
pp. 109-118 ◽  
Author(s):  
Gerd Baron ◽  
Werner Kuich

2009 ◽  
Vol 213 (6) ◽  
pp. 1157-1169
Author(s):  
Xiang-Dong Hou ◽  
Sergio R. López-Permouth ◽  
Benigno R. Parra-Avila

1980 ◽  
Vol 13 (2) ◽  
pp. 189-197 ◽  
Author(s):  
Christophe Reutenauer

2001 ◽  
Vol 8 (42) ◽  
Author(s):  
Zoltán Ésik ◽  
Werner Kuich

We define rationally additive semirings that are a generalization of (omega-)complete and (omega-)continuous semirings. We prove that every rationally additive semiring is an iteration semiring. Moreover, we characterize the semirings of rational power series with coefficients in N_infty, the semiring of natural numbers equipped with a top element, as the free rationally additive semirings.


Sign in / Sign up

Export Citation Format

Share Document