Complexity and decidability for chain code picture languages

Authors:
I. H. Sudborough;E. Welzl
Affiliations:
Northwestern Univ., Evanston, IL;Technical Univ. of Graz and Austrian Computer Society, Graz, Austria
Venue:
Theoretical Computer Science
Year:
1985

Citing 0
Cited 8

Two undecidability results for chain code picture languages

Theoretical Computer Science
On regular drawn symbolic picture languages

Information and Computation
Adding symbolic information to picture models: definitions and properties

Theoretical Computer Science
On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems

Fundamenta Informaticae
The finiteness of synchronous, tabled picture languages is decidable

Theoretical Computer Science
A method for deciding the finiteness of deterministic tabled picture languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems

Fundamenta Informaticae
On Watson-Crick automata

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Quantified Score

Hi-index	5.23

Visualization

Abstract