The membership problem for context-free chain code picture languages

2005 ◽  
pp. 329-336 ◽  
Author(s):  
Friedhelm Hinz
Keyword(s):  
Membership Problem ◽  
Chain Code ◽  
Picture Languages ◽  
Context Free

WHEN CHURCH-ROSSER BECOMES CONTEXT FREE

2007 ◽  
Vol 18 (06) ◽  
pp. 1293-1302 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER
Keyword(s):  
Linear Time ◽  
Membership Problem ◽  
Closure Properties ◽  
Context Free Language ◽  
Arithmetic Hierarchy ◽  
Context Free ◽  
Free Language

We investigate the intersection of Church-Rosser languages and (strongly) context-free languages. The intersection is still a proper superset of the deterministic context-free languages as well as of their reversals, while its membership problem is solvable in linear time. For the problem whether a given Church-Rosser or context-free language belongs to the intersection we show completeness for the second level of the arithmetic hierarchy. The equivalence of Church-Rosser and context-free languages is Π1-complete. It is proved that all considered intersections are pairwise incomparable. Finally, closure properties under several operations are investigated.

A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages

2014 ◽  
pp. 123-133 ◽  
Author(s):  
Zbyněk Křivka ◽  
Carlos Martín-Vide ◽  
Alexander Meduna ◽  
K. G. Subramanian
Keyword(s):  
Two Dimensional ◽  
Picture Languages ◽  
Context Free ◽  
Context Free Grammars

PUZZLE GRAMMARS AND CONTEXT-FREE ARRAY GRAMMARS

1991 ◽  
Vol 05 (05) ◽  
pp. 663-676 ◽  
Author(s):  
M. NIVAT ◽  
A. SAOUDI ◽  
K. G. SUBRAMANIAN ◽  
R. SIROMONEY ◽  
V. R. DARE
Keyword(s):  
Membership Problem ◽  
Generative Power ◽  
New Model ◽  
Regular Control ◽  
Emptiness Problem ◽  
Np Complete ◽  
Context Free ◽  
Rewriting Rules

We introduce a new model for generating finite, digitized, connected pictures called puzzle grammars and study its generative power by comparison with array grammars. We note how this model generalizes the classical Chomskian grammars and study the effect of direction-independent rewriting rules. We prove that regular control does not increase the power of basic puzzle grammars. We show that for basic and context-free puzzle grammars, the membership problem is NP-complete and the emptiness problem is undecidable.

scholarly journals Complexity and decidability for chain code picture languages

1985 ◽  
Vol 36 ◽  
pp. 173-202 ◽  
Author(s):  
I.H. Sudborough ◽  
E. Welzl
Keyword(s):  
Chain Code ◽  
Picture Languages

P systems and context-free 2D picture languages

2009 ◽  
Author(s):  
K.G. Subramanian ◽  
Linqiang Pan ◽  
See Keong Lee ◽  
Atulya K. Nagar
Keyword(s):  
P Systems ◽  
Picture Languages ◽  
Context Free

Membership problem for head languages and multiple context-free languages

1989 ◽  
Vol 20 (6) ◽  
pp. 43-51
Author(s):  
Tadao Kasami ◽  
Hiroyuki Seki ◽  
Mamoru Fujii
Keyword(s):  
Membership Problem ◽  
Multiple Context ◽  
Context Free

scholarly journals Two undecidability results for chain code picture languages

2002 ◽  
Vol 270 (1-2) ◽  
pp. 969-976
Author(s):  
Changwook Kim
Keyword(s):  
Chain Code ◽  
Picture Languages
Sign in / Sign up

Export Citation Format

Share Document