Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 9 of 9

Order by Relevance | Title | Year of publication

Binary sequences without $0 {\underset{︸}{11 \dots 11}}_{k - 1} 0$ for fixed $k$ .

Doroslovački, Rade — 1994

Matematichki Vesnik

Binary $n$ -words without the subword 1010. . . 10.

Doroslovački, Rade; Marković, Olivera — 1998

Novi Sad Journal of Mathematics

$n$ -words over any alphabet with forbidden any 3-subwords.

Doroslovački, Rade; Marković, Olivera — 2000

Novi Sad Journal of Mathematics

$n$ -words over any alphabet without subword $a \underset{k - 1}{\underset{︸}{b \dots b}} a$ for fixed $a$ , $b$ and $k$ .

Doroslovački, Rade; Marković, Olivera — 2000

Novi Sad Journal of Mathematics

Note on intersections of maximal clones.

Doroslovački, Rade; Pantović, Jovanka; Vojvodić, Gradimir — 1999

Novi Sad Journal of Mathematics

Completeness, functional completeness and relative completeness.

Doroslovački, Rade; Pantović, Jovanka; Tošić, Ratko; Vojvodić, Gradimir — 1999

Novi Sad Journal of Mathematics

O inverznim trigonometrijskim funkcijama - na drugi način

Rade Doroslovački — 1993

Nastava Matematike

One interval in the lattice of partial hyperclones

Rade Doroslovački; Jovanka Pantović; Gradimir Vojvodić — 2005

Czechoslovak Mathematical Journal

In this paper the structure of the interval $[O_{A}, H p_{A}]$ in the lattice of partial hyperclones is determined, where $O_{A}$ is the clone of all total operations and $H p_{A}$ is the clone of all partial hyperoperations on $A$ .

Classification of Maps by Their Membership in Maximal Clones That Contain Minimum and Complement

Rade Doroslovački; Jovanka Pantović; Gradimir Vojvodić — 1999

Matematički Vesnik

Page 1

Download Results (CSV)