Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: weighted finite automata

Sortuj według:

Ogranicz wyniki do:

Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata

Droste M., Kari J., Steinby P.

Fundamenta Informaticae

2006

Vol. 73, nr 1-2

99-106

We continue investigations of weighted finite automata (WFA) as devices to compute real functions. Based on eigenvalues of the transition matrices of automata we provide a simple necessary condition for continuity and smoothness properties of the functions they compute. Using this condition we show that polynomials are the only smooth functions computed by WFA and that any WFA computing a polynomial of degree k must have at least k+1 states.

Undecidability in integer weighted finite automata

Halava V., Harju T.

Fundamenta Informaticae

1999

Vol. 38, Nr 1,2

189-200

It is shown that the universe problem L(Ag) = A* is undecidable for 4-state finite automata A with integer weight function g on its transitions. This holds even in the case, where A is acyclic and the weighting g satisfies the unimodality condition. The language L(Ag) is defined as the set of words w for which there exists a path p of A having zero weight, that is, g(p) = 0.