论文信息 - On Piecewise Testable, Starfree, and Recognizable Picture Languages

On Piecewise Testable, Starfree, and Recognizable Picture Languages

We isolate a technique for showing that a picture language (i.e. a“two-dimensional language/rd) is not recognizable. Then we prove the non-recognizability of a picture language that is both starfree (i.e., definable by means of union, concatenation, and complement) and piecewise testable (i.e., definable by means of allowed subpictures), solving an open question in [GR96].

Oliver Matz

[1] Antonio Restivo,et al. Two-Dimensional Languages , 1997, Handbook of Formal Languages.

[2] Antonio Restivo,et al. Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems , 1996, Inf. Comput..

[3] Wolfgang Thomasemail. The Monadic Quantiier Alternation Hierarchy over Graphs Is Innnite , 1998 .

[4] Jeffrey Shallit,et al. A Lower Bound Technique for the Size of Nondeterministic Finite Automata , 1996, Inf. Process. Lett..

[5] Jean-Camille Birget. The State Complexity of \Sigma * L and its Connection with Temporal Logic , 1996, Inf. Process. Lett..

[6] Thomas Wilke,et al. Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic , 1997, ICALP.

[7] Wolfgang Thomas,et al. The monadic quantifier alternation hierarchy over graphs is infinite , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[8] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[9] Oliver Matz,et al. Regular Expressions and Context-Free Grammars for Picture Languages , 1997, STACS.