LEADER 05212nam 22005295 450 001 996465634403316 005 20200707022045.0 010 $a3-540-35168-X 024 7 $a10.1007/3-540-09510-1 035 $a(CKB)1000000000229967 035 $a(SSID)ssj0000321507 035 $a(PQKBManifestationID)11246812 035 $a(PQKBTitleCode)TC0000321507 035 $a(PQKBWorkID)10279851 035 $a(PQKB)10737083 035 $a(DE-He213)978-3-540-35168-9 035 $a(PPN)155183613 035 $a(EXLCZ)991000000000229967 100 $a20121227d1979 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages, and Programming$b[electronic resource] $eSixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings /$fedited by H. A. Maurer 205 $a1st ed. 1979. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1979. 215 $a1 online resource (XII, 688 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v71 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-09510-1 327 $aSharing in nondeterminism -- Sur les mots sans carré définis par un morphisme -- A characterization of abstract data as model-theoretic invariants -- Inherent ambiguities in families of grammars extended abstract -- Representing complexity classes by equality sets -- Supercounter machines -- Existential quantifiers in abstract data types -- A generalization of Ginsburg and Rose's characterization of G-S-M mappings -- Strict deterministic languages and controlled rewriting systems -- A string matching algorithm fast on the average -- Functional characterization of some semantic equalities inside ?-calculus -- Arbitration and queueing under limited shared storage requirements -- On the homomorphic characterizations of families of languages -- Two level grammars: CF-grammars with equation schemes -- Proving termination with multiset orderings -- One abstract accepting algorithm for all kinds of parsers -- Studies in abstract/concrete mappings in proving algorithm correctness -- A characterization of a dot-depth two analogue of generalized definite languages -- Partitioned LL(k) grammars -- Recursion schemes and generalized interpretations -- A rational theory of AFLs -- On the succinctness of different representations of languages -- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs -- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons -- A unique termination theorem for a theory with generalised commutative axioms -- Dags and Chomsky hierarchy -- Recent advances in the probabilistic analysis of graph-theoretic algorithms -- On the average stack size of regularly distributed binary trees -- On reductions of parallel programs -- On the height of derivation trees -- The modal logic of programs -- A comparison between two variations of a pebble game on graphs -- LL(k) parsing for attributed grammars -- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space -- Structure preserving transformations on non-left-recursive grammars -- The complexity of restricted minimum spanning tree problems -- A systematic approach to formal language theory through parallel rewriting -- Extending the notion of finite index -- On the complexity of general context-free language parsing and recognition -- Space-time tradeoffs for oblivious integer multiplication -- Investigating programs in terms of partial graphs -- On the power of random access machines -- An axiomatic treatment of ALGOL 68 routines -- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP -- Constructing call-by-value continuation semantics -- A formal semantics for concurrent systems -- On constructing LL(k) parsers -- More on advice on structuring compilers and proving them correct -- Languages of nilpotent and solvable groups (extended abstract) -- Unique fixed points vs. least fixed points -- A modification of the LR(k) method for constructing compact bottom-up parsers -- Optimal decomposition of linear automata -- Bracketed two-level grammars ? A decidable and practical approach to language definitions. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v71 606 $aComputers 606 $aSoftware engineering 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 615 0$aComputers. 615 0$aSoftware engineering. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 676 $a004.0151 702 $aMaurer$b H. A$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465634403316 996 $aAutomata, languages and programming$9339738 997 $aUNISA