LEADER 04735nam 22007215 450 001 996465623203316 005 20200705130536.0 010 $a3-540-47042-5 024 7 $a10.1007/3-540-52590-4 035 $a(CKB)1000000000233526 035 $a(SSID)ssj0000321718 035 $a(PQKBManifestationID)11277377 035 $a(PQKBTitleCode)TC0000321718 035 $a(PQKBWorkID)10279803 035 $a(PQKB)10104831 035 $a(DE-He213)978-3-540-47042-7 035 $a(PPN)155211528 035 $a(EXLCZ)991000000000233526 100 $a20121227d1990 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCAAP '90$b[electronic resource] $e15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings /$fedited by Andre Arnold 205 $a1st ed. 1990. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990. 215 $a1 online resource (VI, 288 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v431 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-52590-4 327 $aOn the power of bounded concurrency II: The pushdown automata level -- Trees everywhere -- Combinatory forms for equational programming: Instances, unification and narrowing -- Graphical versus logical specifications -- More efficient bottom-up tree pattern matching -- On the regular structure of prefix rewriting -- A unified approach for showing language containment and equivalence between various types of ?-automata -- Unitary monoid with two generators: An algorithmic point of view -- Coherence of subsumption -- Petri nets as models of linear logic -- Towards the unification of models for concurrency -- A markovian concurrency measure -- Graph matching in operational semantics and typing -- ML typability is dexptime-complete -- Testing for inductiue (co)-reducibility -- Probabilistic analysis of some distributed algorithms -- Infinite values in hierarchical imperative types -- Equivalence of finite-valued bottom-up finite state tree transducers is decidable. 330 $aThis volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application of discrete structures in computer science, including syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of trees and graphs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v431 606 $aAlgebra 606 $aSoftware engineering 606 $aComputer science?Mathematics 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aAlgebra$3https://scigraph.springernature.com/ontologies/product-market-codes/M11000 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aAlgebra. 615 0$aSoftware engineering. 615 0$aComputer science?Mathematics. 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 14$aAlgebra. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aMathematics of Computing. 615 24$aComputation by Abstract Devices. 615 24$aSoftware Engineering. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a511/.5 702 $aArnold$b Andre$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aColloquium on Trees in Algebra and Programming 906 $aBOOK 912 $a996465623203316 996 $aCAAP '90$92831601 997 $aUNISA LEADER 02815oas 2201069 a 450 001 9910147026403321 005 20251105213014.0 011 $a1878-3708 035 $a(DE-599)ZDB2031432-2 035 $a(DE-599)2031432-2 035 $a(OCoLC)39061724 035 $a(CONSER) 2007263147 035 $a(CKB)954926246564 035 $a(EXLCZ)99954926246564 100 $a19980505b19961998 sy 101 0 $aeng 135 $aurmnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aMedical update for psychiatrists 210 $aNew York, NY $cElsevier Science$d©1996-©1998 300 $aRefereed/Peer-reviewed 311 08$a1082-7579 606 $aClinical medicine$vPeriodicals 606 $aPsychotherapy patients$xMedical care$vPeriodicals 606 $aClinical Medicine 606 $aDiagnosis 606 $aTherapeutics 606 $aMe?decine clinique$vPe?riodiques 606 $aPatients en psychothe?rapie$xSoins me?dicaux$vPe?riodiques 606 $aClinical medicine$2fast$3(OCoLC)fst00864361 606 $aMe?decine clinique$2rasuqam 606 $aPsychothe?rapie$2rasuqam 606 $aDiagnostic$2rasuqam 606 $aTraitement$2rasuqam 606 $aSoins me?dicaux$2rasuqam 608 $aPeriodical. 608 $aPeriodicals.$2fast 608 $aPeriodicals.$2lcgft 608 $aRessource Internet (Descripteur de forme)$2rasuqam 608 $aPe?riodique e?lectronique (Descripteur de forme)$2rasuqam 615 0$aClinical medicine 615 0$aPsychotherapy patients$xMedical care 615 2$aClinical Medicine. 615 2$aDiagnosis. 615 2$aTherapeutics. 615 6$aMe?decine clinique 615 6$aPatients en psychothe?rapie$xSoins me?dicaux 615 7$aClinical medicine. 615 7$aMe?decine clinique. 615 7$aPsychothe?rapie. 615 7$aDiagnostic. 615 7$aTraitement. 615 7$aSoins me?dicaux. 801 0$bOH1 801 1$bOH1 801 2$bOCL 801 2$bOCLCQ 801 2$bMUQ 801 2$bI7R 801 2$bTXA 801 2$bUQ1 801 2$bVRC 801 2$bOCLCQ 801 2$bBUF 801 2$bUKWOH 801 2$bUKMGB 801 2$bAUD 801 2$bOCLCQ 801 2$bCOO 801 2$bOCLCO 801 2$bVT2 801 2$bOCLCQ 801 2$bOCLCO 801 2$bOCLCQ 801 2$bOCLCF 801 2$bU3W 801 2$bEZC 801 2$bAU@ 801 2$bOCLCO 801 2$bWYU 801 2$bTKN 801 2$bOCLCO 801 2$bBWN 801 2$bOCLCQ 801 2$bOCLCO 801 2$bOCLCQ 906 $aJOURNAL 912 $a9910147026403321 996 $aMedical update for psychiatrists$91894008 997 $aUNINA