Complexity and decidability for chain code picture languages
Theoretical Computer Science
Formal languages
The membership and equivalence problems for picture languages
Theoretical Computer Science
Picture iteration and picture ambiguity
Journal of Computer and System Sciences
Questions of decidability for context-free chain code picture languages
Selected contributions of the fifth international meeting of Young Computer Scientists on Machines, language, and complexity
Complexity and decidability for restricted classes of picture languages
Theoretical Computer Science
Easy multiplications. II. extensions of rational semigroups
Information and Computation
On reversal-bounded picture languages
Theoretical Computer Science
Decision problems and regular chain code picture languages
Discrete Applied Mathematics
Retreat bounded picture languages
Theoretical Computer Science
Undecidability of existential properties in picture languages
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Two Way Finite State Generators
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Directed figure codes with weak equality
IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Directed figure codes: decidability frontier
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Plane-filling properties of directed figures
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Hi-index | 5.23 |
In the paper we propose extensions of some picture models, such as colored, drawn and pixel pictures. Such extensions are conceived by observing that a picture may embed more information than the shape, such as colors, labels, etc., which can be represented by a symbol from an alphabet and can be associated to segments, points or pixels. New interesting issues derived from the introduction of symbols will be investigated together with some complexity and decidability questions for the proposed extensions.