|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
Results
Found 1 publication records. Showing 1 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
42 | E. Allen Emerson, Charanjit S. Jutla |
The Complexity of Tree Automata and Logics of Programs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 328-337, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
PDL-delta, infinite trees, nonemptiness algorithm, computational complexity, satisfiability, tree automata, finite-state automata, branching time logic, propositional dynamic logic, logics of programs, CTL* |
Displaying result #1 - #1 of 1 (100 per page; Change: )
|
|