Equivalence problems for finite-automaton mappings into free and commutative semigroups
- 1 January 1979
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 14 (3) , 321-327
- https://doi.org/10.1007/bf01074660
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Identity problem for the algebra of regular events over semigroupsCybernetics and Systems Analysis, 1977
- Generalized finite generators and identity problems in definitive algebras of regular eventsCybernetics and Systems Analysis, 1976
- Identity problem for quasiregular algebras over commutative semigroups and commutative semigroups of languagesCybernetics and Systems Analysis, 1976
- A Remark on Code Sets and Context-Free LanguagesIEEE Transactions on Computers, 1975
- Algebra and Language TheoryBulletin of the London Mathematical Society, 1975
- Languages over free groupsLecture Notes in Computer Science, 1975
- The equivalence problem for deterministic two-tape automataJournal of Computer and System Sciences, 1973
- Decision problems for graph schemata with commutable operators. Part IICybernetics and Systems Analysis, 1971
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machinesJournal of the ACM, 1968
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961