Angebote zu "Formale" (690 Treffer)

Einführung in die Theoretische Informatik - For...
24,95 € *
ggf. zzgl. Versand

Die Immobilienökonomie befasst sich zum einen mit den Immobilien selbst, und zwar mit allen Phasen des Lebenszyklus von Gewerbe-, Wohn- und Sonderimmobilien - von der Projektentwicklung über das Bau-Projektmanagement bis zum Facilities Management. Ein Schwerpunkt liegt in den funktionalen Aspekten Immobilieninvestition und -finanzierung, Immobilienanalyse- und -bewertung sowie Immobilienmarketing. Zum anderen ist das Management von Immobilienunternehmen (Planung, Organisation, Kontrolle) Gegenstand des Fachgebiets; insofern handelt es sich um eine branchenbezogene Betriebswirtschaftslehre. Dieses Buch richtet sich primär an (angehende) Immobilien-Professionals. Ziel ist, ihnen Einblick in die Komplexität der betriebschaftlichen Zusammenhänge zu geben.

Anbieter: ciando eBooks
Stand: 05.09.2016
Zum Angebot
Angewandte Informatik und Formale Beschreibungs...
49,95 € *
ggf. zzgl. Versand
(49,95 € / in stock)

Angewandte Informatik und Formale Beschreibungsverfahren:Festschrift zum 60. Geburtstag von Wolffried Stucky Teubner Texte zur Informatik. 1999. Auflage

Anbieter: Hugendubel.de
Stand: 14.06.2017
Zum Angebot
Great Formal Machinery Works
29,99 € *
ggf. zzgl. Versand
Anbieter: buecher.de
Stand: 14.06.2017
Zum Angebot
Formal Aspects of Component Software
53,50 € *
ggf. zzgl. Versand

This book constitutes the thoroughly revised selected papers from the 13th International Conference on Formal Aspects of Component Software, FACS 2016, held in Besançon, France, in October 2016. The 11 full papers presented together with one tool paper and 3 invited papers were carefully reviewed and selected from 27 submissions. FACS 2016 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification.

Anbieter: buecher.de
Stand: 28.05.2017
Zum Angebot
Formal Methods Applied to Complex Systems
165,99 € *
ggf. zzgl. Versand

A presentation of real examples of industrial uses for formal methods such as SCADE, the B-Method, ControlBuild, Matelo, etc. in various fields, such as railways, aeronautics, and the automotive industry, the purpose of this book is to present a summary of experience on the use of these “formal methods” (such as proof and model-checking) in industrial examples of complex systems. It is based on the experience of people who are currently involved in the creation and evaluation of safety critical system software. The involvement of people from within the industry allows us to avoid the usual problems of confidentiality which could arise and thus enables us to supply new useful information (photos, architecture plans, real examples, etc.).

Anbieter: ciando eBooks
Stand: 13.12.2016
Zum Angebot
Formal Methods Applied to Complex Systems
165,99 € *
ggf. zzgl. Versand

A presentation of real examples of industrial uses for formal methods such as SCADE, the B-Method, ControlBuild, Matelo, etc. in various fields, such as railways, aeronautics, and the automotive industry, the purpose of this book is to present a summary of experience on the use of these “formal methods” (such as proof and model-checking) in industrial examples of complex systems. It is based on the experience of people who are currently involved in the creation and evaluation of safety critical system software. The involvement of people from within the industry allows us to avoid the usual problems of confidentiality which could arise and thus enables us to supply new useful information (photos, architecture plans, real examples, etc.).

Anbieter: ciando eBooks
Stand: 13.12.2016
Zum Angebot
Formal Languages, Automata and Numeration Systems
129,99 € *
ggf. zzgl. Versand

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory. Contents to include: • algebraic structures, homomorphisms, relations, free monoid • finite words, prefixes, suffixes, factors, palindromes • periodicity and Fine–Wilf theorem • infinite words are sequences over a finite alphabet • properties of an ultrametric distance, example of the p-adic norm • topology of the set of infinite words • converging sequences of infinite and finite words, compactness argument • iterated morphism, coding, substitutive or morphic words • the typical example of the Thue–Morse word • the Fibonacci word, the Mex operator, the n-bonacci words • wordscomingfromnumbertheory(baseexpansions,continuedfractions,...) • the taxonomy of Lindenmayer systems • S-adic sequences, Kolakoski word • repetition in words, avoiding repetition, repetition threshold • (complete) de Bruijn graphs • concepts from computability theory and decidability issues • Post correspondence problem and application to mortality of matrices • origins of combinatorics on words • bibliographic notes • languages of finite words, regular languages • factorial, prefix/suffix closed languages, trees and codes • unambiguous and deterministic automata, Kleene’s theorem • growth function of regular languages • non-deterministic automata and determinization • radix order, first word of each length and decimation of a regular language • the theory of the minimal automata • an introduction to algebraic automata theory, the syntactic monoid and the syntactic complexity • star-free languages and a theorem of Schu ̈tzenberger • rational formal series and weighted automata • context-free languages, pushdown automata and grammars • growth function of context-free languages, Parikh’s theorem • some decidable and undecidable problems in formal language theory • bibliographic notes • factor complexity, Morse–Hedlund theorem • arithmetic complexity, Van Der Waerden theorem, pattern complexity • recurrence, uniform recurrence, return words • Sturmian words, coding of rotations, Kronecker’s theorem • frequencies of letters, factors and primitive morphism • critical exponent • factor complexity of automatic sequences • factor complexity of purely morphic sequences • primitive words, conjugacy, Lyndon word • abelianisation and abelian complexity • bibliographic notes • automatic sequences, equivalent definitions • a theorem of Cobham, equivalence of automatic sequences with constant length morphic sequences • a few examples of well-known automatic sequences • about Derksen’s theorem • some morphic sequences are not automatic • abstract numeration system and S-automatic sequences • k − ∞-automatic sequences • bibliographic notes • numeration systems, greedy algorithm • positional numeration systems, recognizable sets of integers • divisibility criterion and recognizability of N • properties of k-recognizable sets of integers, ratio and difference of consec- utive elements: syndeticity • integer base and Cobham’s theorem on the base dependence of the recog- nizability • non-standard numeration systems based on sequence of integers • linear recurrent sequences, Loraud and Hollander results • Frougny’s normalization result and addition • morphic numeration systems/sets of integers whose characteristic

Anbieter: ciando eBooks
Stand: 13.12.2016
Zum Angebot
Formal Languages, Automata and Numeration Systems
129,99 € *
ggf. zzgl. Versand

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory. Contents to include: • algebraic structures, homomorphisms, relations, free monoid • finite words, prefixes, suffixes, factors, palindromes • periodicity and Fine–Wilf theorem • infinite words are sequences over a finite alphabet • properties of an ultrametric distance, example of the p-adic norm • topology of the set of infinite words • converging sequences of infinite and finite words, compactness argument • iterated morphism, coding, substitutive or morphic words • the typical example of the Thue–Morse word • the Fibonacci word, the Mex operator, the n-bonacci words • wordscomingfromnumbertheory(baseexpansions,continuedfractions,...) • the taxonomy of Lindenmayer systems • S-adic sequences, Kolakoski word • repetition in words, avoiding repetition, repetition threshold • (complete) de Bruijn graphs • concepts from computability theory and decidability issues • Post correspondence problem and application to mortality of matrices • origins of combinatorics on words • bibliographic notes • languages of finite words, regular languages • factorial, prefix/suffix closed languages, trees and codes • unambiguous and deterministic automata, Kleene’s theorem • growth function of regular languages • non-deterministic automata and determinization • radix order, first word of each length and decimation of a regular language • the theory of the minimal automata • an introduction to algebraic automata theory, the syntactic monoid and the syntactic complexity • star-free languages and a theorem of Schu ̈tzenberger • rational formal series and weighted automata • context-free languages, pushdown automata and grammars • growth function of context-free languages, Parikh’s theorem • some decidable and undecidable problems in formal language theory • bibliographic notes • factor complexity, Morse–Hedlund theorem • arithmetic complexity, Van Der Waerden theorem, pattern complexity • recurrence, uniform recurrence, return words • Sturmian words, coding of rotations, Kronecker’s theorem • frequencies of letters, factors and primitive morphism • critical exponent • factor complexity of automatic sequences • factor complexity of purely morphic sequences • primitive words, conjugacy, Lyndon word • abelianisation and abelian complexity • bibliographic notes • automatic sequences, equivalent definitions • a theorem of Cobham, equivalence of automatic sequences with constant length morphic sequences • a few examples of well-known automatic sequences • about Derksen’s theorem • some morphic sequences are not automatic • abstract numeration system and S-automatic sequences • k − ∞-automatic sequences • bibliographic notes • numeration systems, greedy algorithm • positional numeration systems, recognizable sets of integers • divisibility criterion and recognizability of N • properties of k-recognizable sets of integers, ratio and difference of consec- utive elements: syndeticity • integer base and Cobham’s theorem on the base dependence of the recog- nizability • non-standard numeration systems based on sequence of integers • linear recurrent sequences, Loraud and Hollander results • Frougny’s normalization result and addition • morphic numeration systems/sets of integers whose characteristic

Anbieter: ciando eBooks
Stand: 13.12.2016
Zum Angebot
Eirund, Helmut: Formale Beschreibungsverfahren ...
24,95 € *
ggf. zzgl. Versand

Formale Beschreibungsverfahren der InformatikEin Arbeitsbuch fuer die PraxisTaschenbuchvon Helmut EirundEAN: 9783519026433Einband: Kartoniert / BroschiertSprache: DeutschSeiten: 124Abbildungen: Mit Abb. und Tab.Masse: 229 x 161 x 9 mmAutor: Helmut Eirund, B

Anbieter: RAKUTEN: Ihr Mark...
Stand: 18.06.2017
Zum Angebot
Angewandte Informatik und Formale Beschreibungs...
49,95 € *
ggf. zzgl. Versand

Festschrift zum 60. Geburtstag von Wolffried Stucky Teubner Texte zur Informatik. 1999. Auflage

Anbieter: eBook.de
Stand: 18.12.2016
Zum Angebot