Results 11 - 13 of 13

5 NECKS OF AUTOMATA

by Milena Bogdanović, Stojan Bogdanović, Miroslav Ćirić, Tatjana Petković
"... Abstract. Directable automata, known also as synchronizable, cofinal and reset automata, are a significant type of automata with very interesting algebraic properties and important applications in various branches of Computer Science. They have been a subject of interest of many eminent authors sinc ..."
Abstract - Add to MetaCart
Abstract. Directable automata, known also as synchronizable, cofinal and reset automata, are a significant type of automata with very interesting algebraic properties and important applications in various branches of Computer Science. They have been a subject of interest of many eminent authors

Building a Semantic Web Digital Library for the Municipality of Milan

by Michele Barbera, Claudio Cortese, Romeo Zitarosa, Emilia Groppo - RETHINKING ELECTRONIC PUBLISHING: INNOVATION IN COMMUNICATION PARADIGMS AND TECHNOLOGIES - PROC. 13TH INTERNATIONAL CONFERENCE ON ELECTRONIC PUBLISHING , 2009
"... In the second half of 2007 the Municipality of Milan decided to co-finance a one year project proposed by CILEA (Consorzio Interuniversitario Lombardo per l’Elaborazione Automatica) called “Biblioteca Aperta di Milano ” (Milan Open Li-brary) or BAMI, aimed at creating an integrated system to make a ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
In the second half of 2007 the Municipality of Milan decided to co-finance a one year project proposed by CILEA (Consorzio Interuniversitario Lombardo per l’Elaborazione Automatica) called “Biblioteca Aperta di Milano ” (Milan Open Li-brary) or BAMI, aimed at creating an integrated system to make a

Definition

by Artem Chernikov
"... Given a cardinal κ, we define ded κ = sup{|I | : I is a linear order with a dense subset of size ≤ κ}. ◮ In general the supremum may not be attained. ◮ The study of ded κ was initiated by Baumgartner [1]. ◮ In model theory it arises naturally when one wants to count types. Some equivalent ways to co ..."
Abstract - Add to MetaCart
to compute ded κ The following cardinalities are the same: 1. ded κ. 2. sup{λ: ∃ a linear order of size ≤ κ with λ Dedekind cuts} 3. sup{λ: ∃ a regular µ and a linear order of size ≤ κ with λ cuts of cofinality µ on both sides}. (by a theorem of Kramer, Shelah, Tent and Thomas) 4. sup{λ: ∃ a regular µ
Results 11 - 13 of 13