A note on the emptiness problem for alternating finite-memory automata

Daniel Genkin; Michael Kaminski; Liat Peterfreund

doi:10.1016/j.tcs.2014.01.020

A note on the emptiness problem for alternating finite-memory automata

Daniel Genkin^*
, Michael Kaminski
, Liat Peterfreund

^*Corresponding author for this work

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

3 Scopus citations

Abstract

We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata.

Original language	English
Pages (from-to)	97-107
Number of pages	11
Journal	Theoretical Computer Science
Volume	526
DOIs	https://doi.org/10.1016/j.tcs.2014.01.020
State	Published - 20 Mar 2014
Externally published	Yes

Keywords

Alternating finite-memory automata
Alternating finite-memory tree automata
Emptiness problem
Infinite alphabets

Access to Document

10.1016/j.tcs.2014.01.020

Cite this

@article{aeaf690eec654977b431dc1b2f34f106,

title = "A note on the emptiness problem for alternating finite-memory automata",

abstract = "We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata.",

keywords = "Alternating finite-memory automata, Alternating finite-memory tree automata, Emptiness problem, Infinite alphabets",

author = "Daniel Genkin and Michael Kaminski and Liat Peterfreund",

year = "2014",

month = mar,

day = "20",

doi = "10.1016/j.tcs.2014.01.020",

language = "אנגלית",

volume = "526",

pages = "97--107",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A note on the emptiness problem for alternating finite-memory automata

AU - Genkin, Daniel

AU - Kaminski, Michael

AU - Peterfreund, Liat

PY - 2014/3/20

Y1 - 2014/3/20

N2 - We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata.

AB - We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata.

KW - Alternating finite-memory automata

KW - Alternating finite-memory tree automata

KW - Emptiness problem

KW - Infinite alphabets

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

U2 - 10.1016/j.tcs.2014.01.020

DO - 10.1016/j.tcs.2014.01.020

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

AN - SCOPUS:84895926582

SN - 0304-3975

VL - 526

SP - 97

EP - 107

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

A note on the emptiness problem for alternating finite-memory automata

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this