Structure of weakly invertible semi-input-memory finite automata with delay 1

Authors:
Tao Renji;Chen Shihua
Affiliations:
Laboratory for Computer Science, Institute of Software The Chinese Academy of Sciences, Beijing 100080, P.R. China;Laboratory for Computer Science, Institute of Software The Chinese Academy of Sciences, Beijing 100080, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 2
Cited 2

Knowledge-Based Assistance for the Development of Drugs

IEEE Expert: Intelligent Systems and Their Applications
Invertibility of Linear Finite Automata Over a Ring

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming

Structure of weakly invertible semi-input-memory finite automata with delay 2

Journal of Computer Science and Technology
Decomposing a kind of weakly invertible finite automata with delay 2

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semi-input-memory finite automata, a kind of finite automata introduced by the first author of this paper for studying error propagation, are a generalization of input-memory finite automata by appending an autonomous finite automaton component. In this paper, we give a characterization of the structure of weakly invertible semi-input-memory finite automata with delay 1, in which the state graph of each autonomous finite automaton is a cycle. From a result on mutual invertibility of finite automata obtained by the authors recently, it leads to a characterization of the structure of feedforward inverse finite automata with delay 1.