Currently displaying 1 – 12 of 12

Showing per page

Order by Relevance | Title | Year of publication

On graph products of automatic monoids

A. Veloso Da Costa — 2001

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

The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.

On graph products of automatic monoids

A. Veloso da Costa — 2010

RAIRO - Theoretical Informatics and Applications

The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.

A note on paracomplete logic

Newton C. A. da CostaDiego Marconi — 1986

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

In questa nota gli Autori descrivono nuovi sistemi di logica (detta «paracompleta») connessi con la logica della vaghezza («fuzzy logic») e con le logiche paraconsistenti.

A note on paracomplete logic

Newton C. A. da CostaDiego Marconi — 1986

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

In questa nota gli Autori descrivono nuovi sistemi di logica (detta «paracompleta») connessi con la logica della vaghezza («fuzzy logic») e con le logiche paraconsistenti.

Page 1

Download Results (CSV)