Two-dimensional finite state recognizability
Fundamenta Informaticae - Special issue on formal language theory
Handbook of formal languages, vol. 3
Context-sensitive string languages and recognizable picture languages
Information and Computation
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Insertion into the Chomsky Hierarchy?
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Iterated Length-Preserving Rational Transductions
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Two characterizations of the context-sensitive languages
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Formal language characterizations of P, NP, and Pspace
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
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.