Structure of weakly invertible semi-input-memory finite automata with delay 1
type: Item
instance of: scholarly article
title: Structure of weakly invertible semi-input-memory finite automata with delay 1
zbMATH Open document ID: 1012.68104
DOI: 10.1007/BF02943277
published in: Journal of Computer Science and Technology
publication date: 2003-04-23T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1843957
zbMATH Keywords: semi-input-memory finite automata
author: Tao Renji
author: Shi-Hua Chen
MaRDI profile type: Publication
cites work: Q5551177
cites work: Q4138668
cites work: Q4109592
cites work: Q3750124
cites work: Q3706505
cites work: Q3042397
cites work: A necessary condition on invertibility of finite automata
cites work: Constructing finite automata with invertibility by transformation method
cites work: Input-trees of finite automata and application to cryptanalysis
cites work: On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\)
cites work: On the structure of binary feedforward inverses with delay 2
cites work: \(R_ aR_ b\) transformation of compound finite automata over commutative rings
full work available at URL: https://doi.org/10.1007/bf02943277
OpenAlex ID: W2560779797
description: scientific article; zbMATH DE number 1843957