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

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)77-82
Number of pages6
JournalDiscrete Applied Mathematics
Volume30
Issue number1
DOIs
Publication statusPublished - Jan 7 1991

Fingerprint

Digraph
Automata
Isomorphic
Simulation
Converse
Subgraph
Class

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.

In: Discrete Applied Mathematics, Vol. 30, No. 1, 07.01.1991, p. 77-82.

Research output: Contribution to journalArticle

@article{9558b2a14a044acba987704c034358ce,
title = "A note on isomorphic simulation of automata by networks of two-state automata",
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.",
author = "Z. {\'E}sik",
year = "1991",
month = "1",
day = "7",
doi = "10.1016/0166-218X(91)90015-O",
language = "English",
volume = "30",
pages = "77--82",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1",

}

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 -