Complexity and decidability for chain code picture languages
Theoretical Computer Science
Formal languages
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The membership and equivalence problems for picture languages
Theoretical Computer Science
Picture iteration and picture ambiguity
Journal of Computer and System Sciences
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
Retreat bounded picture languages
Theoretical Computer Science
Unambiguous description of chain code picture languages
Information Processing Letters
Undecidability of existential properties in picture languages
Theoretical Computer Science
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Leftmove-bound picture languages
Theoretical Computer Science
Picture Languages: Formal Models for Picture Recognition
Picture Languages: Formal Models for Picture Recognition
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Two Way Finite State Generators
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension.