Some Results on the set of congruence relations in a finite, strongly connected automation.
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Βιβλίο |
| Γλώσσα: | Αγγλικά |
| Έκδοση: |
München
1966
|
| Σειρά: | Technische Universität München. Bericht
AM, 6609 |
| Διαθέσιμο Online: | matching Alma Some Results on the set of congruence relations in a finite, strongly connected automation. (author 0.0%, title 100.0%, shelfmark 100.0%, overall 65.0%) |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
| Order eBook: |
|
| Order Book: | Login to order |
Παρόμοια τεκμήρια: Some Results on the set of congruence relations in a finite, strongly connected automation.
- Some Remarks on a class of partition congruences.
- Some Congruences modulo 13 involving the partition function.
- Automation and some implications for the handicapped
- Automation and some implications for the handicapped
- Automation and some implications for the handicapped
- On the Definition of congruence by recursion.