Browse Research and Tech Reports - Computer Science by Author "Ohsaki, Hitoshi"

  • Hendrix, Joe; Ohsaki, Hitoshi (2008-02)
    In this paper, we study combining equational tree automata in two different senses: (1) whether decidability results about equational tree automata over disjoint theories imply similar decidability results in the combined ...

    application/pdf

    application/pdfPDF (463kB)
  • Hendrix, Joe; Ohsaki, Hitoshi; Viswanathan, Mahesh (2006-02)
    In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates ...

    application/pdf

    application/pdfPDF (307kB)
  • Hendrix, Joe; Ohsaki, Hitoshi; Meseguer, José (2005-09)
    Sufficient completeness means that enough equations have been specified, so that the functions of an equational specification are fully defined on all relevant data. This is important for both debugging and formal reasoning. ...

    application/pdf

    application/pdfPDF (337kB)