Equivalence problem for finitely ambiguous finite automata over semigroups
- 1 January 1980
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 15 (4) , 463-467
- https://doi.org/10.1007/bf01068891
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Equivalence problems for finite-automaton mappings into free and commutative semigroupsCybernetics and Systems Analysis, 1979
- Identity problem for the algebra of regular events over semigroupsCybernetics and Systems Analysis, 1977
- Identity problem for quasiregular algebras over commutative semigroups and commutative semigroups of languagesCybernetics and Systems Analysis, 1976
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946