On a representation of tree automata

Z. Ésik, Ferenc Gécseg

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Sequential compositions of tree automata, called selective products, are introduced as a connection of processors computing functions. Decidability results are established for the unary case. These results are related to classical automata theory.

Original languageEnglish
Pages (from-to)243-255
Number of pages13
JournalTheoretical Computer Science
Volume53
Issue number2-3
DOIs
Publication statusPublished - 1987

Fingerprint

Automata theory
Computability and decidability
Tree Automata
Automata Theory
Unary
Decidability
Chemical analysis
Computing

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On a representation of tree automata. / Ésik, Z.; Gécseg, Ferenc.

In: Theoretical Computer Science, Vol. 53, No. 2-3, 1987, p. 243-255.

Research output: Contribution to journalArticle

Ésik, Z. ; Gécseg, Ferenc. / On a representation of tree automata. In: Theoretical Computer Science. 1987 ; Vol. 53, No. 2-3. pp. 243-255.
@article{fabccecbba5142178ecfff4ba2d5819e,
title = "On a representation of tree automata",
abstract = "Sequential compositions of tree automata, called selective products, are introduced as a connection of processors computing functions. Decidability results are established for the unary case. These results are related to classical automata theory.",
author = "Z. {\'E}sik and Ferenc G{\'e}cseg",
year = "1987",
doi = "10.1016/0304-3975(87)90066-1",
language = "English",
volume = "53",
pages = "243--255",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2-3",

}

TY - JOUR

T1 - On a representation of tree automata

AU - Ésik, Z.

AU - Gécseg, Ferenc

PY - 1987

Y1 - 1987

N2 - Sequential compositions of tree automata, called selective products, are introduced as a connection of processors computing functions. Decidability results are established for the unary case. These results are related to classical automata theory.

AB - Sequential compositions of tree automata, called selective products, are introduced as a connection of processors computing functions. Decidability results are established for the unary case. These results are related to classical automata theory.

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

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

U2 - 10.1016/0304-3975(87)90066-1

DO - 10.1016/0304-3975(87)90066-1

M3 - Article

VL - 53

SP - 243

EP - 255

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2-3

ER -