UN algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
- 31 October 1977
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 5 (2) , 183-204
- https://doi.org/10.1016/0304-3975(77)90006-8
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On finite semigroups of matricesTheoretical Computer Science, 1977
- The Burnside problem for semigroupsJournal of Algebra, 1975
- Algebraic decision procedures for local testabilityTheory of Computing Systems, 1974
- Characterizations of locally testable eventsDiscrete Mathematics, 1973
- Solvability of the problem of occurrence in finitely generated soluble groups of matrices over the field of algebraic numbersAlgebra and Logic, 1968
- The Burnside problemJournal of Algebra, 1966
- On finite monoids having only trivial subgroupsInformation and Control, 1965
- On a Theorem of R. JungenProceedings of the American Mathematical Society, 1962
- Finite counting automataInformation and Control, 1962
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930