Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Algebraic Ordinals

Bloom S.L., Ésik Z.

Fundamenta Informaticae

2010

Vol. 99, nr 4

383-407

An algebraic tree T is one determined by a finite system of fixed point equations. The frontier Fr(T ) of an algebraic tree T is linearly ordered by the lexicographic order

Partial Conway and Iteration Semirings

Bloom S.L., Ésik Z., Kuich W.

Fundamenta Informaticae

2008

Vol. 86, nr 1-2

19-40

A Conway semiring is a semiring S equipped with a unary operation *: S →S, always called 'star', satisfying the sum star and product star identities. It is known that these identities imply a Kleene type theorem. Some computationally important semirings, such as N or N^{rat}((σ)) of rational power series of words on σ with coefficients in N, cannot have a total star operation satisfying the Conway identities. We introduce here partial Conway semirings, which are semirings S which have a star operation defined only on an ideal of S; when the arguments are appropriate, the operation satisfies the above identities. We develop the general theory of partial Conway semirings and prove a Kleene theorem for this generalization.

Deciding whether the frontier of a regular tree is scattered

Bloom S.L., Esik Z.

Fundamenta Informaticae

2003

Vol. 55, nr 1

1-21