1977
DOI: 10.24033/msmf.225
|View full text |Cite
|
Sign up to set email alerts
|

Utilisation d'APL pour calculer des monoïdes finis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2003
2003
2003
2003

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…We shall assume that this finite automation has six states, the transitions between which, under zero and unity at the finite automaton's input, are determined by juxtaposing the first sequence to the sequence ABCDEF and by juxtaposing the second sequence to the sequence ABCDEF, respectively. Here the finite automation is defined in the form of Perrot [13].…”
Section: Duration Under Cyclingmentioning
confidence: 99%
“…We shall assume that this finite automation has six states, the transitions between which, under zero and unity at the finite automaton's input, are determined by juxtaposing the first sequence to the sequence ABCDEF and by juxtaposing the second sequence to the sequence ABCDEF, respectively. Here the finite automation is defined in the form of Perrot [13].…”
Section: Duration Under Cyclingmentioning
confidence: 99%