TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA

R EHRICH R, Sik-Sang Yau

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this paper a device called a 2-way sequential transducer is defined. Such a device is a natural generalization of the wellknown 1-way sequential transducer, though its behavior is much more complex. Many of the properties of this transducer are derived, and it is shown, for example, that such a transducer maps regular sets and context free languages into the context sensitive languages. The intimate relationship between the class of 1-way stack automata and the 2-way sequential transducer isshown by presenting a new grammar which generates exactly the 1-way stack languages in a perfectly natural way, and it is indicated how several of the properties of 1-way stack languages are obtained from its grammars.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
Pages475-479
Number of pages5
StatePublished - 1969
Externally publishedYes
EventProc 3rd Annu Princeton Conf on Information Sciences and Systems, Dep of Elec Eng - Princeton, NJ, USA
Duration: Mar 27 1969Mar 28 1969

Other

OtherProc 3rd Annu Princeton Conf on Information Sciences and Systems, Dep of Elec Eng
CityPrinceton, NJ, USA
Period3/27/693/28/69

Fingerprint

Transducers
Context sensitive languages
Context free languages

ASJC Scopus subject areas

  • Engineering(all)

Cite this

EHRICH R, R., & Yau, S-S. (1969). TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA. In Unknown Host Publication Title (pp. 475-479)

TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA. / EHRICH R, R; Yau, Sik-Sang.

Unknown Host Publication Title. 1969. p. 475-479.

Research output: Chapter in Book/Report/Conference proceedingChapter

EHRICH R, R & Yau, S-S 1969, TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA. in Unknown Host Publication Title. pp. 475-479, Proc 3rd Annu Princeton Conf on Information Sciences and Systems, Dep of Elec Eng, Princeton, NJ, USA, 3/27/69.
EHRICH R R, Yau S-S. TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA. In Unknown Host Publication Title. 1969. p. 475-479
EHRICH R, R ; Yau, Sik-Sang. / TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA. Unknown Host Publication Title. 1969. pp. 475-479
@inbook{ccafbfe2749a47e0963a14d336422572,
title = "TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA",
abstract = "In this paper a device called a 2-way sequential transducer is defined. Such a device is a natural generalization of the wellknown 1-way sequential transducer, though its behavior is much more complex. Many of the properties of this transducer are derived, and it is shown, for example, that such a transducer maps regular sets and context free languages into the context sensitive languages. The intimate relationship between the class of 1-way stack automata and the 2-way sequential transducer isshown by presenting a new grammar which generates exactly the 1-way stack languages in a perfectly natural way, and it is indicated how several of the properties of 1-way stack languages are obtained from its grammars.",
author = "{EHRICH R}, R and Sik-Sang Yau",
year = "1969",
language = "English (US)",
pages = "475--479",
booktitle = "Unknown Host Publication Title",

}

TY - CHAP

T1 - TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA

AU - EHRICH R, R

AU - Yau, Sik-Sang

PY - 1969

Y1 - 1969

N2 - In this paper a device called a 2-way sequential transducer is defined. Such a device is a natural generalization of the wellknown 1-way sequential transducer, though its behavior is much more complex. Many of the properties of this transducer are derived, and it is shown, for example, that such a transducer maps regular sets and context free languages into the context sensitive languages. The intimate relationship between the class of 1-way stack automata and the 2-way sequential transducer isshown by presenting a new grammar which generates exactly the 1-way stack languages in a perfectly natural way, and it is indicated how several of the properties of 1-way stack languages are obtained from its grammars.

AB - In this paper a device called a 2-way sequential transducer is defined. Such a device is a natural generalization of the wellknown 1-way sequential transducer, though its behavior is much more complex. Many of the properties of this transducer are derived, and it is shown, for example, that such a transducer maps regular sets and context free languages into the context sensitive languages. The intimate relationship between the class of 1-way stack automata and the 2-way sequential transducer isshown by presenting a new grammar which generates exactly the 1-way stack languages in a perfectly natural way, and it is indicated how several of the properties of 1-way stack languages are obtained from its grammars.

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

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

M3 - Chapter

AN - SCOPUS:0014627341

SP - 475

EP - 479

BT - Unknown Host Publication Title

ER -