### Abstract

Original language | English |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 13 |

Publication status | Published - 1976 |

### Publication series

Name | Memorandum / Department of Applied Mathematics |
---|---|

Publisher | Department of Applied Mathematics, University of Twente |

No. | 129 |

ISSN (Print) | 0169-2690 |

### Fingerprint

### Keywords

- HMI-SLT: Speech and Language Technology

### Cite this

*A Characterization of ET0L and EDT0L Languages*. (Memorandum / Department of Applied Mathematics; No. 129). Enschede: University of Twente, Department of Applied Mathematics.

}

*A Characterization of ET0L and EDT0L Languages*. Memorandum / Department of Applied Mathematics, no. 129, University of Twente, Department of Applied Mathematics, Enschede.

**A Characterization of ET0L and EDT0L Languages.** / Asveld, Peter R.J.

Research output: Book/Report › Report › Other research output

TY - BOOK

T1 - A Characterization of ET0L and EDT0L Languages

AU - Asveld, Peter R.J.

N1 - Research supported by Netherlands Organization for the Advancement of Pure Research (ZWO). [N.B. The original typescript of this report had 13 pages; the more recent LaTeX version reduced this number to 10.]

PY - 1976

Y1 - 1976

N2 - There exists a PT0L language $L_0$ such that the following holds. A language $L$ is an ET0L language if and only if there exists a mapping $T$ induced by an a-NGSM (nondeterministic generalized sequential machine with accepting states) such that $L = T(L_0)$. There exists an infinite collection of EPDT0L languages $D_{mn}\subseteq\Sigma_{mn}^\star$ ($n\geq m\geq 1$) such that the family EDT0L is characterized in the following way. A language $L$ is an EDT0L language if and only if there exists $n\geq m\geq 1$, a homomorphism $h$ and a regular language $R \subseteq \Sigma_{mn}^\star$ such that $L = h(D_{mn} \cap R)$.

AB - There exists a PT0L language $L_0$ such that the following holds. A language $L$ is an ET0L language if and only if there exists a mapping $T$ induced by an a-NGSM (nondeterministic generalized sequential machine with accepting states) such that $L = T(L_0)$. There exists an infinite collection of EPDT0L languages $D_{mn}\subseteq\Sigma_{mn}^\star$ ($n\geq m\geq 1$) such that the family EDT0L is characterized in the following way. A language $L$ is an EDT0L language if and only if there exists $n\geq m\geq 1$, a homomorphism $h$ and a regular language $R \subseteq \Sigma_{mn}^\star$ such that $L = h(D_{mn} \cap R)$.

KW - HMI-SLT: Speech and Language Technology

M3 - Report

T3 - Memorandum / Department of Applied Mathematics

BT - A Characterization of ET0L and EDT0L Languages

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -