Computing Languages by (Bounded) Local Sets
We introduce the definition of local structures as description of computations to recognize strings and characterize families of Chomsky’s hierarchy in terms of projection of frontiers of local sets of structures. Then we consider particular grid structures we call bounded-grids and study the corresponding family of string languages by proving some closure properties and giving several examples.
Unable to display preview. Download preview PDF.
- 3.S. Eilenberg. Automata, Languages and Machines. Vol. A, Academic Press, 1974.Google Scholar
- 4.M.J. Fischer Two characterizations of the context-sensitive languages. Prc. 10th Annual IEEE Symp. on Switching and Automata Theory, pp. 157–165, 1969.Google Scholar
- 6.D. Giammarresi, A. Restivo. “Two-dimensional languages”. In Handbook of Formal Languages, G. Rosenberg et al., Eds, Vol. III, pp. 215–268. Springer Verlag, 1997.Google Scholar
- 10.M. Latteux, D. Simplot and A. Terlutte. Iterated length-preserving rational trasductions. Proc. MFCS’98, LNCS Vol. 1450, pp. 286–295. Springer-Verlag, 1998.Google Scholar
- 11.R. McNaughton. An insertion into the Chomsky Hierarchy? Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, J. Karhumaki et al., Eds), pp. 204–212. Springer-Verlag, 1999.Google Scholar