On Piecewise Testable, Starfree, and Recognizable Picture Languages

@inproceedings{Matz1998OnPT,
  title={On Piecewise Testable, Starfree, and Recognizable Picture Languages},
  author={Oliver Matz},
  booktitle={FoSSaCS},
  year={1998}
}
We isolate a technique for showing that a picture language (i.e. a \two-dimensional language") is not recognizable. Then we prove the non-recognizability of a picture language that is both starfree (i.e., deenable by means of union, concatenation, and complement) and piece-wise testable (i.e., deenable by means of allowed subpictures), solving an open question in GR96]. We also deene local, locally testable, and locally threshold testable picture languages and summarize known inclusion results… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Star-free picture expressions are strictly weaker than rstorder logic

  • Thomas Wil, Wilke
  • Automata, Languages and Programming
  • 1997

Klassiizierung von Bildsprachen mit rationalen Ausdr ucken, Grammatiken und Logik-Formeln. Diploma thesis, Christian-Albrechts-Universitt at Kiel

  • Oliver Mat, Matz
  • Klassiizierung von Bildsprachen mit rationalen…
  • 1995

Similar Papers

Loading similar papers…