• DocumentCode
    2195217
  • Title

    Tree extension algebras: logics, automata, and query languages

  • Author

    Benedikt, Michael ; Libkin, Leonid

  • Author_Institution
    Bell Labs., Lisle, IL, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    203
  • Lastpage
    212
  • Abstract
    We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation T\n\n\t\t
  • Keywords
    automata theory; computational complexity; query languages; relational algebra; automata; complexity; logics; polynomial hierarchy; query languages; relational calculi; tree extension algebras; tree structures; tree tuples; trees; Algebra; Automata; Computer science; Database languages; Logic functions; Logic programming; Query processing; Transducers; Vocabulary; XML;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on
  • ISSN
    1043-6871
  • Print_ISBN
    0-7695-1483-9
  • Type

    conf

  • DOI
    10.1109/LICS.2002.1029829
  • Filename
    1029829
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2195217