LEADER 01161nam 2200385 450 001 990000460460203316 035 $a0046046 035 $aUSA010046046 035 $a(ALEPH)000046046USA01 035 $a0046046 100 $a20010522d1983----km-y0itay0103----ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $aMatematica per le scienze economiche e statistiche$fGiulio Cesare Barozzi, Corrado Corradi 210 $aBologna$cIl mulino$d1983 215 $a736 p.$cill.$d21 cm 225 2 $aStrumenti$iEconomia 410 $12001$aStrumenti$iEconomia 461 1$1001-------$12001 610 0 $aEconomia matematica 610 0 $aStatistica Metodi matematici 676 $a330.01 702 1$aBAROZZI,$bGiulio Cesare 702 1$aCORRADI,$bCorrado 801 0$aIT$bsalbc$gISBD 912 $a990000460460203316 951 $a330.01 BAR$b19219 SM$c330.01$d00107211 959 $aBK 969 $aSCI 979 $aPATTY$b90$c20010522$lUSA01$h1003 979 $c20020403$lUSA01$h1654 979 $aPATRY$b90$c20040406$lUSA01$h1632 996 $aMatematica per le scienze economiche e statistiche$9889271 997 $aUNISA LEADER 05022nam 22007455 450 001 996204727703316 005 20230330030300.0 010 $a3-319-21500-0 024 7 $a10.1007/978-3-319-21500-6 035 $a(CKB)3710000000454196 035 $a(SSID)ssj0001558493 035 $a(PQKBManifestationID)16182674 035 $a(PQKBTitleCode)TC0001558493 035 $a(PQKBWorkID)14819336 035 $a(PQKB)11291744 035 $a(DE-He213)978-3-319-21500-6 035 $a(MiAaPQ)EBC6283881 035 $a(MiAaPQ)EBC5596187 035 $a(Au-PeEL)EBL5596187 035 $a(OCoLC)914300481 035 $a(PPN)18768880X 035 $a(EXLCZ)993710000000454196 100 $a20150717d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. /$fedited by Igor Potapov 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XXI, 440 p. 71 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9168 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-21499-3 327 $aRecognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation. 330 $aThis book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9168 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004 702 $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996204727703316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA LEADER 03341nam 2200745 a 450 001 9910965025303321 005 20230126205530.0 010 $a9786613676269 010 $a9781118233955 010 $a1118233956 010 $a9781280699283 010 $a1280699280 010 $a9781118220276 010 $a1118220277 035 $a(CKB)2670000000205425 035 $a(EBL)832570 035 $a(OCoLC)784448834 035 $a(SSID)ssj0000662280 035 $a(PQKBManifestationID)11400547 035 $a(PQKBTitleCode)TC0000662280 035 $a(PQKBWorkID)10713950 035 $a(PQKB)11747112 035 $a(MiAaPQ)EBC832570 035 $a(DLC) 2012014387 035 $a(Au-PeEL)EBL832570 035 $a(CaPaEBR)ebr10580269 035 $a(CaONFJC)MIL367626 035 $a(Perlego)1000180 035 $a(EXLCZ)992670000000205425 100 $a20120405d2012 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aFirst-generation college students $eunderstanding and improving the experience from recruitment to commencement /$fLee Ward, Michael J. Siegel, Zebulun Davenport ; foreword by John N. Gardner 205 $a1st ed. 210 $aSan Francisco $cJossey-Bass$d2012 215 $a1 online resource (178 p.) 225 1 $aJossey-Bass higher and adult education series 300 $aDescription based upon print version of record. 311 08$a9780470474440 311 08$a0470474440 320 $aIncludes bibliographical references and index. 327 $aMachine generated contents note: Foreword (John N. Gardner)PrefaceAcknowledgmentsAbout the Authors1. Who Are First-Generation Students?2. Transition into College3. Transition Through College4. Class, Culture, Race, and Ethnicity5. Transforming How We Work with First-Generation Students6. A Holistic Approach to Student SuccessReferencesIndex. 330 $a"As more and more of the college-going population is made up of those who are the first in their families to attend college, institutions need to find ways to help these students succeed if they expect to maintain enrollments. This groundbreaking resource explores the challenges and barriers to first-generation students and offers a wealth of helpful recommendations for helping these students succeed in their academic careers. This book helps leaders in academic and student affairs to understand these special challenges and how best to meet them"--$cProvided by publisher. 410 0$aJossey-Bass higher and adult education series. 606 $aFirst-generation college students$zUnited States 606 $aPeople with social disabilities$xEducation (Higher)$zUnited States 606 $aCollege student orientation$zUnited States 615 0$aFirst-generation college students 615 0$aPeople with social disabilities$xEducation (Higher) 615 0$aCollege student orientation 676 $a378.1/982694 686 $aEDU015000$2bisacsh 700 $aWard$b Lee$cDr.$01531730 701 $aSiegel$b Michael J$01804451 701 $aDavenport$b Zebulun$01804452 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910965025303321 996 $aFirst-generation college students$94352477 997 $aUNINA