04437nam 22005415 450 99646566140331620200707021954.03-540-37305-510.1007/3-540-08342-1(CKB)1000000000229844(SSID)ssj0000321515(PQKBManifestationID)11227084(PQKBTitleCode)TC0000321515(PQKBWorkID)10279583(PQKB)10909017(DE-He213)978-3-540-37305-6(PPN)155234722(EXLCZ)99100000000022984420121227d1977 u| 0engurnn|008mamaatxtccrAutomata, Languages and Programming[electronic resource] Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 /edited by A. Salomaa, M. Steinby1st ed. 1977.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1977.1 online resource (XII, 572 p.)Lecture Notes in Computer Science,0302-9743 ;52Bibliographic Level Mode of Issuance: Monograph3-540-08342-1 How hard is compiler code generation? -- "Natural" complexity measures and time versus memory: Some definitional proposals -- Semantics and proof theory of pascal procedures -- On the structure of combinatorial problems and structure preserving reductions -- Factor graphs, failure functions and Bi-Trees -- Parallel decomposition of LR(k) parsers -- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata -- Termination tests inside ?-calculus -- On the computational power of reversal-bounded machines -- The contextsensitivity bounds of contextsensitive grammars and languages -- Serial composition of 2-way finite-state transducers and simple programs on strings -- The sequence equivalence problem for dol systems is decidable -- Languages defined by higher type program schemes -- Parsing and syntactic error recovery for context-free grammars by means of coarse structures -- On three types of unambiguity of context-free language -- The mathematics of record handling -- Macro grammars, lindenmayer systems and other copying devices -- On the time and tape complexity of hyper(1)-AFL's -- Renaming and erasing in szilard languages -- Some matching problems -- Complexite des demi — Groupes de matrices -- On the proper treatment or referencing, dereferencing and assignment -- Complexity of some problems concerning L systems -- Left-fitting translations -- Dynamic binary search -- About the derivation languages of grammars and machines -- Simple chain grammars -- Time-space trade-offs in a pebble game -- Non-deterministic polynomial optimization problems and their approximation -- Simple programs and their decision problems -- Theory of data structures by relational and graph grammars -- On backtracking and greatest fixpoints -- L systems of finite index -- The safety of a coroutine system -- Linear time simulation of multihead turing machines with head — To-head jumps -- Data types as objects -- On the difference between one and many -- On defining error recovery in context-free parsing -- LL(k) languages are closed under union with finite languages -- The time and tape complexity of developmental languages -- Rational relations of binary trees -- Structural equivalence of context-free grammar forms is decidable -- On the definition of classes of interpretations.Lecture Notes in Computer Science,0302-9743 ;52ComputersProgramming languages (Electronic computers)Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Computers.Programming languages (Electronic computers).Theory of Computation.Programming Languages, Compilers, Interpreters.004.0151Salomaa Aedthttp://id.loc.gov/vocabulary/relators/edtSteinby Medthttp://id.loc.gov/vocabulary/relators/edtBOOK996465661403316Automata, languages and programming339738UNISA