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

Znaleziono wyników: 5

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
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.
2
Content available remote On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Csuhaj-Varju E., Mateescu A.
Fundamenta Informaticae
|
2006
|
Vol. 73, nr 1-2
37-50
EN
In this paper we discuss some relationships between cooperating distributed (CD) grammar systems and the basic process algebra (BPA) calculus. We associate different types of process graphs from this calculus to CD grammar systems which describe the behavior of the components of the system under cooperation. We prove that these process graphs form a subalgebra of the graph model of BPA. It is also shown that for certain restricted variants of CD grammar systems and for certain types of these process graphs the bisimilarity of two process graphs is decidable.
3
Content available remote On the Injectivity of the Parikh Matrix Mapping
Atanasiu A., Martin-Vide C., Mateescu A.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 4
289-299
EN
In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as ``palindromic amiable'', such that two such words are palindromic amiable if and only if they have the same image by the Parikh matrix mapping. Some other related problems are discussed, too.
4
Content available remote Arto Salomaa : publications by Arto Salomaa
Karhumäki J., Mateescu A., Rozenberg G.
Fundamenta Informaticae
|
1999
|
Vol. 38, Nr 1,2
11-11
5
Content available remote Algebraic, linear and rational languages defined by mix operation
Kudlek M., Mateescu A.
Fundamenta Informaticae
|
1998
|
Vol. 33, nr 3
249-264
EN
We consider operations between languages, based on splitting the underlying alphabet into two disjoint sets, one of them having some priority. Such operations are generalizations of the classical catenation or shuffle operation, with which rational, linear and algebraic languages can be defined similar to the classical case. The basic properties of the corresponding language families are investigated too.
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ć.