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

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'TWO-WAY SEQUENTIAL TRANSDUCERS AND STACK AUTOMATA'. Together they form a unique fingerprint.

  • Cite this

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