A grammatical characterization of alternating pushdown automata

Etsuro Moriya

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

The notion of an alternating context-free grammar is introduced and it is shown that the class of alternating context-free languages is equal to the class of languages accepted by alternating pushdown automata. Some properties on alternating context-free languages are also studied.

Original languageEnglish
Pages (from-to)75-85
Number of pages11
JournalTheoretical Computer Science
Volume67
Issue number1
DOIs
Publication statusPublished - 1989 Sep 5
Externally publishedYes

Fingerprint

Context free languages
Pushdown Automata
Context-free Languages
Context free grammars
Context-free Grammar
Class
Language

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A grammatical characterization of alternating pushdown automata. / Moriya, Etsuro.

In: Theoretical Computer Science, Vol. 67, No. 1, 05.09.1989, p. 75-85.

Research output: Contribution to journalArticle

@article{3227098c85224eacb13dfb1c4143636d,
title = "A grammatical characterization of alternating pushdown automata",
abstract = "The notion of an alternating context-free grammar is introduced and it is shown that the class of alternating context-free languages is equal to the class of languages accepted by alternating pushdown automata. Some properties on alternating context-free languages are also studied.",
author = "Etsuro Moriya",
year = "1989",
month = "9",
day = "5",
doi = "10.1016/0304-3975(89)90023-6",
language = "English",
volume = "67",
pages = "75--85",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - A grammatical characterization of alternating pushdown automata

AU - Moriya, Etsuro

PY - 1989/9/5

Y1 - 1989/9/5

N2 - The notion of an alternating context-free grammar is introduced and it is shown that the class of alternating context-free languages is equal to the class of languages accepted by alternating pushdown automata. Some properties on alternating context-free languages are also studied.

AB - The notion of an alternating context-free grammar is introduced and it is shown that the class of alternating context-free languages is equal to the class of languages accepted by alternating pushdown automata. Some properties on alternating context-free languages are also studied.

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

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

U2 - 10.1016/0304-3975(89)90023-6

DO - 10.1016/0304-3975(89)90023-6

M3 - Article

AN - SCOPUS:0024962437

VL - 67

SP - 75

EP - 85

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -