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 language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Pages | 475-479 |
| Number of pages | 5 |
| State | Published - 1969 |
| Externally published | Yes |
| Event | Proc 3rd Annu Princeton Conf on Information Sciences and Systems, Dep of Elec Eng - Princeton, NJ, USA Duration: Mar 27 1969 → Mar 28 1969 |
Other
| Other | Proc 3rd Annu Princeton Conf on Information Sciences and Systems, Dep of Elec Eng |
|---|---|
| City | Princeton, NJ, USA |
| Period | 3/27/69 → 3/28/69 |
ASJC Scopus subject areas
- Engineering(all)