Decidable properties of monadic recursive schemas with a depth parameter |
| |
Authors: | Jakob Gonczarowski |
| |
Affiliation: | (1) Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel |
| |
Abstract: | Summary Monadic table counter schemas (MTCS) are defined as extensions of recursive monadic schemas by incorporating a depth-of-recursion counter. The family of languages generated by free MTCS under Herbrand interpretation is shown to be the family of ETOL languages. It is proven that the halting and divergence problems are decidable for free MTCS and that the freedom problem is decidable. Most of these results are obtained using results on regular control sequences from L system theory. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |