Sur les automates qui reconnaissent une famille de langages.
Semigroup forum (1989)
- Volume: 39, Issue: 3, page 323-334
- ISSN: 0037-1912; 1432-2137/e
Access Full Article
topHow to cite
topSpehner, J.C.. "Sur les automates qui reconnaissent une famille de langages.." Semigroup forum 39.3 (1989): 323-334. <http://eudml.org/doc/134994>.
@article{Spehner1989,
author = {Spehner, J.C.},
journal = {Semigroup forum},
keywords = {finite automata; state sets; regular languages; syntactic monoid; finite monoid},
number = {3},
pages = {323-334},
title = {Sur les automates qui reconnaissent une famille de langages.},
url = {http://eudml.org/doc/134994},
volume = {39},
year = {1989},
}
TY - JOUR
AU - Spehner, J.C.
TI - Sur les automates qui reconnaissent une famille de langages.
JO - Semigroup forum
PY - 1989
VL - 39
IS - 3
SP - 323
EP - 334
KW - finite automata; state sets; regular languages; syntactic monoid; finite monoid
UR - http://eudml.org/doc/134994
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.