Alternating multihead finite automata
Theoretical Computer Science
An NP-complete language accepted in linear time by a one-tape Turing machine
Theoretical Computer Science
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
Recognizable picture languages and domino tiling
Theoretical Computer Science
Handbook of formal languages, vol. 3
Context-sensitive string languages and recognizable picture languages
Information and Computation
Recognizability of rectangular pictures by Wang systems
Journal of Automata, Languages and Combinatorics
Elements of the Theory of Computation
Elements of the Theory of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Some Recognizable Picture-Languages
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Complexity of solvable cases of the decision problem for the predicate calculus
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Computing languages by (Bounded) local sets
DLT'03 Proceedings of the 7th international conference on Developments in language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
| Hi-index | 0.00 |
Based on the notions of locality and recognizability for n-dimensional languages n-dimensionally colourable 1-dimensional languages are introduced. It is shown: A language L is in NP if and only if L is n-dimensionally colourable for some n. An analogous characterization in terms of deterministic n-dimensional colourability is obtained for P. The addition of one unbounded dimension for colouring leads to a characterization of PSPACE.