PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  monoid
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote A variant of Jensen’s functional equation on semigroups
Fadli B., Zeglami D., Kabbaj S.
Demonstratio Mathematica
|
2016
|
Vol. 49, nr 4
414--420
EN
We determine the solutions f : S → H of the following functional equation f(xy) + f(σ(y)x) = 2f(x), x,y∈S, and the solutions f1, f2, f3 : M → H of the functional equation f1(xy) + f2(σ(y)x) = 2f3(x), x,y∈M, where S is a semigroup, M is a monoid, H is an abelian group 2-torsion free, and σ is an involutive automorphism.
2
Content available remote Quadratic Algorithms for Testing of Codes and ◊-Codes
Han N. D., Vinh H. N., Thang D. Q., Huy P. T.
Fundamenta Informaticae
|
2014
|
Vol. 130, nr 2
163--177
EN
The Sardinas-Patterson's test for codes has contributed many effective testing algorithms to the development of theory of codes, formal languages, etc. However, we will show that a modification of this test proposed in this paper can deduce more effective testing algorithms for codes. As a consequence, we establish a quadratic algorithm that, given as input a regular language X defined by a tuple (ϕ, M, B), where ϕ : A* → M is a monoid morphism saturating X, M is a finite monoid, B Í M, X = ϕ−1(B), decides in time complexity O(n2) whether X is a code, where n = Card(M). Specially, n can be chosen as the finite index of X. A quadratic algorithm for testing of ◊-codes is also established.
3
Content available remote The Krohn-Rhodes Theorem and Local Divisors
Diekert V., Kufleitner M., Steinberg B.
Fundamenta Informaticae
|
2012
|
Vol. 116, nr 1-4
65-77
EN
We give a new proof of the Krohn-Rhodes theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg, avoids induction on the size of the state set, and works exclusively with monoids with the base case of the induction being that of a group.
4
Content available remote Towards a Framework for Modelling Behaviours of Hybrid Systems
Winkowski J.
Prace Instytutu Podstaw Informatyki Polskiej Akademii Nauk
|
2007
|
Nr 1002
1-31
EN
The paper is devoted to characterizing hybrid systems by specifying their possible runs, called processes, where each process is represented by a pomset in an intrinsic, global time independent way and can possibly be obtained by composing seąuentially and in parallel other processes.
PL
Praca dotyczy opisywania systemów hybrydowych poprzez definiowanie przebiegów ich działania zwanych procesami, gdzie procesy są reprezentowane strukturami częściowo uporządkowanymi i mog^ być definiowane przez szeregowe i równoległe składanie wcześniej zdefiniowanych procesów.
5
Content available remote Routes and Products of Monoids
Mateescu A., Freund R.
Fundamenta Informaticae
|
2006
|
Vol. 73, nr 1-2
205-211
EN
We investigate the problem of finding monoids that recognize languages of the form L1\JoinTL2 where T is an arbitrary set of routes. We present a uniform method based on routes to find such monoids. Many classical operations from the theory of formal languages, such as catenation, bi-catenation, simple splicing, shuffle, literal shuffle, and insertion are shown to be just particular instances of the operation T.
6
Content available remote L'equation de translation sur le demi-groupe des elements non negatifs d'un groupe ordonne et archimedien
Mach A., Moszner Z.
Demonstratio Mathematica
|
2006
|
Vol. 39, nr 4
825-836
7
Content available remote Note on logics of idempontents
Katrnoška F.
Demonstratio Mathematica
|
2004
|
Vol. 37, nr 2
267--274
EN
The main result of this paper is the characterization of certain logics of idempotents by Boolean semirings. Moreover some interesting examples are likewise added.
8
Content available remote Prelanguages versus submonoids
Ostravsky J.
Fundamenta Informaticae
|
2001
|
Vol. 46, nr 4
343-348
EN
In [9] submonoids of a commutative monoid are characterized by means of their relations of domination, subgroups of a commutative monoid are characterized by means of their relations of double domination. The main purpose of this paper is to transfer these results to general monoids. The important means will be certain relations, which we shall study in detail.
9
Content available remote Pregrammars versus submonoids
Ostravsky J.
Fundamenta Informaticae
|
1998
|
Vol. 36, nr 4
337-343
EN
Prelanguages and pregrammars introduced present a generalization of languages and pure grammars. Relation of domination and double domination may be easily transferred from languages to prelanguages. In the present paper submonoids of a commutative monoid are characterized by means of their relations of domination: subgroups of a commutative group are characterized by means of their relations of double domination. The submonoid generated by a subset of a commutative monoid is constructed using a suitable pregrammar.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.