LEADER 04968nam  22006495  450 
001 996465727003316
005 20200702021420.0
010   $a3-540-48203-2
024 7 $a10.1007/BFb0015922
035   $a(CKB)1000000000233435
035   $a(SSID)ssj0000324593
035   $a(PQKBManifestationID)11268434
035   $a(PQKBTitleCode)TC0000324593
035   $a(PQKBWorkID)10314287
035   $a(PQKB)11478315
035   $a(DE-He213)978-3-540-48203-1
035   $a(PPN)155184660
035   $a(EXLCZ)991000000000233435
100   $a20121227d1989      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aMachines, Languages, and Complexity$b[electronic resource] $e5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988. Selected Contributions /$fedited by Jürgen Dassow, Jozef Kelemen
205   $a1st ed. 1989.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1989.
215   $a1 online resource (VIII, 248 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v381
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-51516-X 
327   $aQuestions of decidability for context-free chain code picture languages -- Chomsky hierarchy and communication complexity -- Complexity theory and formal languages -- Rational cones and commutations -- A remark on some classifications of Indian parallel languages -- An extension of the Krohn-Rhodes decomposition of automata -- A survey of two-dimensional automata theory -- The simulation of two-dimensional one-marker automata by three-way turing machines -- Some properties of space-bounded synchronized alternating turing machines with only universal states -- The virtual floating grid file -- A partially persistent data structure for the set-union problem with backtracking -- A note on the computational complexity of bracketing and related problems -- Postorder hierarchy for path compressions and set union -- The convex hull problem on grids computational and combinatorial aspects -- The riches of rectangles -- The limitations of partial evaluation -- Algorithmic learning from incomplete information: Principles and problems -- A cryptosystem based on propositional logic -- Tutorial: Cryptography and data security.
330   $aThe volume contains selected contributions from the scientific programme of the 5th International Meeting of Young Computer Scientists (IMYCS '88) held at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions dealing with problems of decidability, hierarchy, and complexity. Papers concerning different types and problems of automata theory form the second chapter. The contributions in the third chapter cover the large field of algorithmics from the study of program complexity to the domain of computational geometry. The two contributions of the fourth chapter are devoted to logic programming and inductive inference. The final chapter deals with problems of cryptography and contains the text of the IMYCS '88 tutorial on cryptography and data security delivered by A. Salomaa. The book will be a useful source for orientation in contemporary theoretical computer science and related fields such as software engineering and artificial intelligence for researchers and graduate students.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v381
606   $aComputer engineering
606   $aComputers
606   $aMathematical logic
606   $aArtificial intelligence
606   $aComputer Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I27000
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
615  0$aComputer engineering.
615  0$aComputers.
615  0$aMathematical logic.
615  0$aArtificial intelligence.
615 14$aComputer Engineering.
615 24$aComputation by Abstract Devices.
615 24$aMathematical Logic and Formal Languages.
615 24$aArtificial Intelligence.
676   $a621.39
702   $aDassow$b Jürgen$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKelemen$b Jozef$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465727003316
996   $aMachines Languages, and Complexity$9382921
997   $aUNISA