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 – 13 of 13

Order by Relevance | Title | Year of publication

The syntactic monoid of a hypercode.

G. Thierrin — 1974

Semigroup forum

Regular prefix-codes and right power-bounded languages.

Semigroup forum

Décomposition des langages réguliers

G. Thierrin — 1969

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Finiteness conditions for finitely generated monoids.

G. Thierrin — 1972

Semigroup forum

A mode of decomposition of regular languages.

G. Thierrin — 1975

Semigroup forum

Semigroups with each element disjunctive.

G. Thierrin; H. Jürgensen — 1980

Semigroup forum

On semigroups in which every Rees one-sided congruence is a congruence.

G.R. Baird; G. Thierrin — 1972

Semigroup forum

.....-simple reflective semigroups.

G. Thierrin; G. Thomas — 1977

Semigroup forum

Strong endomorphisms of TT-connected automata

G. Thierrin; A. Paradis — 1980

Semigroup forum

Right k-dense languages.

G. Thierrin; M. Ito; S.S. Yu — 1994

Semigroup forum

Relatively f-disjunctive languages.

G. Thierrin; C.M. Reis; Y.Q. Guo — 1988

Semigroup forum

Codes, languages and MOL schemes

H. J. Shyr; G. Thierrin — 1977

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Disjunctive languages and compatible orders

M. Ito; H. J. Shyr; G. Thierrin — 1989

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Page 1

Download Results (CSV)