Back to Results
First PageMeta Content
Formal languages / Automata theory / Tree decomposition / Graph / Tree / Structure / Rewriting / Binary tree / Matching / Mathematics / Graph theory / Theoretical computer science


THE COMPLEXITY OF THE FIRST-ORDER THEORY OF GROUND TREE REWRITE GRAPHS ¨ STEFAN GOLLER AND MARKUS LOHREY Universit¨at Bremen, Germany
Add to Reading List

Document Date: 2014-06-19 07:22:27

Open Document

File Size: 314,18 KB

Share Result on Facebook

Company

Figure 3 / TreesA / /

Currency

USD / /

/

IndustryTerm

main technical tool / infinite state systems / non-elementary algorithm / pushdown systems / /

Person

Rabin / Ai / STEFAN GOLLER / MARKUS LOHREY / /

RadioStation

Am 6 / /

Technology

non-elementary algorithm / weP / /

SocialTag