### Abstract

Let D be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in D have unbounded size we show that every automaton is isomorphically simulated by a network of two-state automata with underlying digraph in D. The converse statement holds, too.

Original language | English |
---|---|

Pages (from-to) | 77-82 |

Number of pages | 6 |

Journal | Discrete Applied Mathematics |

Volume | 30 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 7 1991 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

**A note on isomorphic simulation of automata by networks of two-state automata.** / Ésik, Z.

Research output: Contribution to journal › Article

*Discrete Applied Mathematics*, vol. 30, no. 1, pp. 77-82. https://doi.org/10.1016/0166-218X(91)90015-O

}

TY - JOUR

T1 - A note on isomorphic simulation of automata by networks of two-state automata

AU - Ésik, Z.

PY - 1991/1/7

Y1 - 1991/1/7

N2 - Let D be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in D have unbounded size we show that every automaton is isomorphically simulated by a network of two-state automata with underlying digraph in D. The converse statement holds, too.

AB - Let D be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in D have unbounded size we show that every automaton is isomorphically simulated by a network of two-state automata with underlying digraph in D. The converse statement holds, too.

UR - http://www.scopus.com/inward/record.url?scp=0013416234&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0013416234&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(91)90015-O

DO - 10.1016/0166-218X(91)90015-O

M3 - Article

VL - 30

SP - 77

EP - 82

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1

ER -