Location of Repository

Solution of tau -completeness problem for automata

By Buevich Vacheslav Alexandrovich

Abstract

The subject of inquiry: automata, automatic mapping. The aim of the paper: for any k less than or equal to 2, tau less than or equal to 1 in terms of relation preservation the explicit description of the set of all ==-beforecompleteness classes must be given. So the ==-completeness problem for automata can be solved. Suitable tools for investigation and construction of relation sets, preservation classes of which form tau -criterion systems for tau -completeness automata recognition have been worked out. For the first time the completeness problem, just the tau -completeness problem, concerning with automata with arbitrary finite alphabet, which can map words with given length tau , has been studied. This problem has been solved completelyAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio

Topics: 12B - Statistics, operations research, CYBERNETICS
Year: 1992
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10068/35... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.