Universal graph powerset

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalizing the powerset construction, coalgebraically

Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behavioral equivalence (∼F) amongst them. Many types of transition systems and their equivalences can be captured by a functor F. For example, for deterministic automata the derived equivalence is language equivalen...

متن کامل

Abstract Counterexample-Based Refinement for Powerset Domains

Counterexample-based Refinement for Powerset Domains R. Manevich, J. Field , T. A. Henzinger, G. Ramalingam, and M. Sagiv 1 Tel Aviv University, {rumster,msagiv}@tau.ac.il 2 IBM T.J. Watson Research Center, [email protected] 3 EPFL, [email protected] 4 Microsoft Research India, [email protected] Abstract. Counterexample-guided abstraction refinement (CEGAR) is a powerful technique to scale auto...

متن کامل

Universal-DB: Towards Representation Independent Graph Analytics

Graph analytics algorithms leverage quantifiable structural properties of the data to predict interesting concepts and relationships. The same information, however, can be represented using many different structures and the structural properties observed over particular representations do not necessarily hold for alternative structures. Because these algorithms tend to be highly effective over ...

متن کامل

A Factor-Graph Approach to Universal Decoding

We consider data communication over a discrete memoryless channel where neither the sender nor the receiver knows the channel law. The setup is universal in the sense that no training sequence is allowed, i.e. no position of the channel code is allowed to be fixed to a certain symbol. We discuss a variety of approaches for solving this problem efficiently. It turns out that it is worthwhile to ...

متن کامل

Graph Homomorphisms and Universal Algebra Course Notes

1 The Basics 3 1.1 Graphs and Digraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Graph Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3 The H-colouring Problem and Variants . . . . . . . . . . . . . . . . . . . . . 8 1.4 Cores . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.5 Polymorphisms . . . . . ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2020

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/1441/1/012173