01139nam0-2200361---450-99001001204040332120151105110733.0978-88-97216-58-2001001204FED01001001204(Aleph)001001204FED0100100120420151105d2014----km-y0itay50------baitaIT--------001yy<<Il >>conservatorio delle verginelle di Tarantomodelli assistenziali femminili nel Mezzogiorno modernoSimona De PaceTarantoedit@2014119 p.ill.21 cmStudi e approfondimenti scientificia cura di Fabio Pierri PepeMusicaEducazioneAspetti socialiSec. 19.Conservatorio delle VerginelleTarantoAdolescenzaAssistenzaTarantoSec. 19.305.23522ita362.722ita372.8722itaDe Pace,SimonaITUNINARICAUNIMARCBK990010012040403321305.235 DEP 11802BFSBFSUNINA05269nam 22005775 450 99646571020331620200630184552.03-540-39859-710.1007/3-540-16761-7(CKB)1000000000230536(SSID)ssj0000321509(PQKBManifestationID)11283931(PQKBTitleCode)TC0000321509(PQKBWorkID)10279852(PQKB)10487821(DE-He213)978-3-540-39859-2(PPN)155165976(EXLCZ)99100000000023053620121227d1986 u| 0engurnn|008mamaatxtccrAutomata, Languages and Programming[electronic resource] 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings /edited by Laurent Kott1st ed. 1986.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1986.1 online resource (XII, 476 p.)Lecture Notes in Computer Science,0302-9743 ;226Bibliographic Level Mode of Issuance: Monograph3-540-16761-7 Characterizations of PUNC and precomputation -- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach -- A new duality result concerning Voronoi diagrams -- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial -- On exponential lowness -- A tradeoff between search and update time for the implicit dictionary problem -- Intersections of some families of languages -- Correspondence between ternary simulation and binary race analysis in gate networks -- Counting with rational functions -- Finite biprefix sets of paths in a Graph -- Parallel RAMs with owned global memory and deterministic context-free language recognition -- A Strong restriction of the inductive completion procedure -- On discerning words by automata -- Complexity classes without machines: On complete languages for UP -- Containment, separation, complete sets, and immunity of complexity classes -- On nontermination of Knuth-Bendix algorithm -- Tradeoffs for language recognition on parallel computing models -- Rational equivalence relations -- Some further results on digital search trees -- Knowledge, belief and time -- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication -- Decompositions of nondeterministic reductions -- Hierarchical planarity testing algorithms -- Synthesis and equivalence of concurrent systems -- The set union problem with backtracking -- Torsion matrix semigroups and recognizable transductions -- On recognizable subsets of free partially commutative monoids -- Min Cut is NP-complete for edge weighted trees -- Alternating automata, the weak monadic theory of the tree, and its complexity -- Subpolynomial complexity classes of real functions and real numbers -- Etude syntaxique des parties reconnaissables de mots infinis -- Refusal testing -- A timed model for communicating sequential processes -- A uniform reduction theorem extending a result of J. Grollmann and A. Selman -- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs -- A new approach to detection of locally indicative stability -- A more efficient algorithm for lattice basis reduction -- Lower bounds by recursion theoretic arguments -- An improved algorithm for transitive closure on acyclic digraphs -- Un algorithme determinant les melanges de deux mots -- A very fast, practical algorithm for finding a negative cycle in a digraph -- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language -- Semigroups and languages of dot-depth 2 -- A parallel vertex insertion algorithm for minimum spanning trees -- More complicated questions about maxima and minima, and some closures of NP -- Lower bounds for dynamic range query problems that permit subtraction (extended abstract) -- E-unification algorithms for a class of confluent term rewriting systems -- On fixed-point clones.Lecture Notes in Computer Science,0302-9743 ;226Computer logicMathematical logicComputersLogics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Computer logic.Mathematical logic.Computers.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.Computation by Abstract Devices.005.1015113Kott Laurentedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465710203316Automata, languages and programming339738UNISA01805nam 2200421Ka 450 991069689860332120240812223814.0(CKB)5470000002381891(OCoLC)234308449(EXLCZ)99547000000238189120080721d2007 ua 0engtxtrdacontentcrdamediacrrdacarrierUser's guide to securing external devices for telework and remote access recommendations of the National Institute of Standards and Technology /Karen Scarfone, Murugiah SouppayaVersion 2., Draft.Gaithersburg, MD :U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology,[2007]44 unnumbered pages digital, PDF fileNIST special publication ;800-46.Computer securityTitle from title screen (viewed on July 17, 2008)."May 2007."User's guide to securing external devices for telework and remote accessComputer networksRemote accessSecurity measuresStandardsUnited StatesTelecommutingGovernment policyUnited StatesComputer securityStandardsUnited StatesComputer networksRemote accessSecurity measuresStandardsTelecommutingGovernment policyComputer securityStandardsScarfone Karen1764277Murugiah Souppaya1386652National Institute of Standards and Technology (U.S.)GPOGPOBOOK9910696898603321User's guide to securing external devices for telework and remote access4205745UNINA