| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNIBAS000004119 |
|
|
Titolo |
6: The Grammar of Causative Constructions / edited by Masayoshi Shibatani |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
2. |
Record Nr. |
UNISA996466713603316 |
|
|
Titolo |
Broken Symmetries [[electronic resource] ] : Proceedings of the 37. Internationale Universitätswochen für Kern- und Teilchenphysik, Schladming, Austria, February 28–March 7, 1998 / / edited by Leopold Mathelitsch, Willibald Plessas |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1999.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VII, 304 p. 10 illus.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Physics, , 0075-8450 ; ; 521 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematical physics |
Nuclear physics |
Theoretical, Mathematical and Computational Physics |
Particle and Nuclear Physics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Discrete and global symmetries in particle physics -- CP violation -- CP violation: Experimental status and prospects -- Spontaneously broken symmetries -- Chiral symmetry -- Quark mass hierarchies, flavor mixing and maximal CP-violation -- Duality in quantum field theory (and string theory) -- Supersymmetry, strings and unification -- Abstracts of the seminars. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Symmetries and the breaking of symmetries play an important role in particle physics. Several experts in the field give overviews of different symmetry aspects in subatomic physics. Topics like CP violation, chiral symmetry, supersymmetry and spontaneous symmetry breaking are addressed. The articles are the written accounts of lectures given at the 1998 Schladming Winter School and address in particular graduate students. The material is dealt with in a comprehensive and detailed manner and is at the same time pedagogically well devised. |
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNISA996465763803316 |
|
|
Titolo |
Automata, Languages and Programming [[electronic resource] ] : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings / / edited by J. W. de Bakker, J. van Leeuwen |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1980 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1980.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 671 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 85 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Computers |
Mathematical logic |
Programming Techniques |
Computation by Abstract Devices |
Mathematical Logic and Formal Languages |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
|
|
|
|
Nota di contenuto |
|
How to get rid of pseudoterminals -- Test sets for homomorphism equivalence on context free languages -- Languages with homomorphic replacements -- Functions equivalent to integer multiplication -- Languages with reducing reflexive types -- Semantics of unbounded nondeterminism -- A shifting algorithm for min-max tree partitioning -- A characterisation of computable data types by means of a finite equational specification method -- A note on sweeping automata -- Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms -- Derivations et reductions dans les grammaires algebrioues -- Semantic analysis of communicating sequential processes -- Dos systems and languages -- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness -- Parameterized data types in algebraic specification languages -- Characterizing correctness properties of parallel programs using fixpoints -- Formal properties of one-visit and multi-pass attribute grammars (extended abstract) -- Cryptocomplexity and NP-completeness -- On the analysis of tree-matching algorithms -- Generating and searching sets induced by networks -- The complexity of the inequivalence problem for regular expressions with intersection -- An almost linear time algorithm for computing a dependency basis in a relational data base -- Bipolar synchronization systems -- Testing of properties of finite algebras -- A transaction model -- On observing nondeterminism and concurrency -- Terminal algebra semantics and retractions for abstract data types -- The complexity of semilinear sets -- A theory of nondeterminism -- A representation theorem for models of *-free PDL -- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions -- Symmertric space-bounded computation (extended abstract) -- On some properties of local testability -- Semantics :Algebras,fixed points,axioms -- Measuring the expressive power of dynamic logics: An application of abstract model theory -- Pebbling mountain ranges and its application to DCFL-recognition -- Space-restricted attribute grammars -- A constructive approach to compiler correctness -- A worst-case analysis of nearest neighbor searching by projection -- Proprietes syntactiques du produit non ambigu -- On the optimal assignment of attributes to passes in multi-pass attribute evaluators -- Optimal unbounded search strategies -- A "fast implementation" of a multidimensional storage into a tree storage -- Grammatical families -- Partitioned chain grammars -- An improved program for constructing open hash tables -- On the power of commutativity in cryptography -- Characterizations of the LL(k) property -- Computability in categories -- On the size complexity of monotone formulas -- Reversible computing -- The use of metasystem transition in theorem proving and program optimization -- On the power of real-time turing machines under varying specifications. |
|
|
|
|
|
|
|
| |