Deterministic and unambiguous two-dimensional languages over one-letter alphabet

@article{Anselmo2009DeterministicAU,
  title={Deterministic and unambiguous two-dimensional languages over one-letter alphabet},
  author={Marcella Anselmo and Maria Madonia},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={1477-1485}
}
The paper focuses on deterministic and unambiguous recognizable two-dimensional languageswith particular attention to the case of a one-letter alphabet. The family DREC(1) of deterministic languages over a one-letter alphabet is characterized as bothL(DOTA)(1), the class of languages accepted by deterministic on-line tessellation acceptors, and L(2AFA)(1), the class of languages recognized by 2-way alternating finite automata. We show that there are inherently ambiguous languages and… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
8 Citations
26 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Dot-depth

  • O. Matz
  • monadic quantifier alternation, and first-order…
  • 2002
Highly Influential
4 Excerpts

Recognizable vs

  • O. Matz
  • regular picture languages, in: S. Bozapalidis, G…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…