Automata decomposition and synthesis with PLAM

S. Baranov; L. Bregman

doi:10.1016/0165-6074(93)90223-8

Automata decomposition and synthesis with PLAM

S. Baranov, L. Bregman

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

A precise method is presented for automaton decomposition with given restrictions on the complexity of component automata - on the number of their input and output variables and states. In this decomposition there are no practical limitations to the complexity of the decomposed automaton, to the number of component automata and to the mode of their connection.

Original language	English
Pages (from-to)	759-766
Number of pages	8
Journal	Microprocessing and Microprogramming
Volume	38
Issue number	1-5
DOIs	https://doi.org/10.1016/0165-6074(93)90223-8
State	Published - Sep 1993
Externally published	Yes

Access to Document

10.1016/0165-6074(93)90223-8

Cite this

@article{bb3d70d396fe4a70aa1fac27d413159c,

title = "Automata decomposition and synthesis with PLAM",

abstract = "A precise method is presented for automaton decomposition with given restrictions on the complexity of component automata - on the number of their input and output variables and states. In this decomposition there are no practical limitations to the complexity of the decomposed automaton, to the number of component automata and to the mode of their connection.",

author = "S. Baranov and L. Bregman",

year = "1993",

month = sep,

doi = "10.1016/0165-6074(93)90223-8",

language = "אנגלית",

volume = "38",

pages = "759--766",

journal = "Microprocessing and Microprogramming",

issn = "0165-6074",

publisher = "Elsevier B.V.",

number = "1-5",

}

TY - JOUR

T1 - Automata decomposition and synthesis with PLAM

AU - Baranov, S.

AU - Bregman, L.

PY - 1993/9

Y1 - 1993/9

N2 - A precise method is presented for automaton decomposition with given restrictions on the complexity of component automata - on the number of their input and output variables and states. In this decomposition there are no practical limitations to the complexity of the decomposed automaton, to the number of component automata and to the mode of their connection.

AB - A precise method is presented for automaton decomposition with given restrictions on the complexity of component automata - on the number of their input and output variables and states. In this decomposition there are no practical limitations to the complexity of the decomposed automaton, to the number of component automata and to the mode of their connection.

UR - https://www.scopus.com/pages/publications/0027656345

U2 - 10.1016/0165-6074(93)90223-8

DO - 10.1016/0165-6074(93)90223-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0027656345

SN - 0165-6074

VL - 38

SP - 759

EP - 766

JO - Microprocessing and Microprogramming

JF - Microprocessing and Microprogramming

IS - 1-5

ER -

Automata decomposition and synthesis with PLAM

Abstract

Access to Document

Other files and links

Fingerprint

Cite this