On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\) (Q1083857): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Shi-hua Chen / rank | |||
Property / author | |||
Property / author: Shi-hua Chen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3750124 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02943272 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002032385 / rank | |||
Normal rank |
Latest revision as of 08:44, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\) |
scientific article |
Statements
On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\) (English)
0 references
1986
0 references
In this paper, we first give a method that for any inverse finite automaton M' with delay \(\tau\), all invertible finite automata with delay \(\tau\), of which M' is an inverse with delay \(\tau\) can be constructed; and a universal nondeterministic finite automaton, for all finite automata of which M' is an inverse with delay \(\tau\), can also be constructed. We then give a method that for any weak inverse finite automaton M' with delay \(\tau\), all weakly invertible finite automata with delay \(\tau\) of which M' is a weak inverse with delay, can be constructed; and a universal nondeterministic finite automaton, for all finite automata of which M' is a weak inverse with delay \(\tau\), can also be constructed.
0 references
inverse finite automaton
0 references
universal nondeterministic finite automaton
0 references
weak inverse
0 references