"System Sci"

Key Phrases: New York, System Sci, Principles of Programming Languages, Principles of Database Systems, Academic Press, Theory of Computing, additional bibliographic comments, database scheme design, monomorphic specification, correctness proof method, local verification conditions, fair parallel programs (see more)

Key Phrases: New York, System Sci, Principles of Programming Languages, Principles of Database Systems, Academic Press, Theory of Computing, Basic Lemma, Englewood Cliffs, Elsevier Science Publishers, Los Altos, Symbolic Comput, Principles of Distributed Computing, Cambridge Univ, Systems Theory, Aee Env, Critical Pair Lemma, Handbook of Mathematical Logic, Research Report, Chapel Hill, Computing Research, Formal Description of Programming Concepts, Logic Colloquium, Databases Systems, Morgan Kaufmann, Prentice Hall, additional bibliographic comments, database scheme design, monomorphic specification, correctness proof method, local verification conditions, fair parallel programs, weak universal relation assumption, universal relation data models, signed binary numerals, reachable extension, automaton sal, recursive number algebra, iterative pair, nonfaulty processes, equational proof system, locally testable sets, finite failure set, global snapshot algorithm, minimum model semantics, unrestricted databases, abstract data type declarations, extensional applicative structure, program boundedness, function calculi, terminal congruence (see less)

Key Phrases: Lecture Notes, System Sci, Soviet Math, Kraft Inequality, Boston University, Barzdins's Lemma, unit integrable, recursive semimeasure, prefix machine, universal enumerable semimeasure, diagonal halting set, complete routing scheme (see more)

Key Phrases: Lecture Notes, System Sci, Soviet Math, Kraft Inequality, Boston University, Barzdins's Lemma, Theory Probab, Problems Inform, Theory Comput, Law of the Iterated Logarithm, Systems Theory, Fundamental Inequality, Academic Press, Aspects Comput, Machine Learning, New York, Occam's Razor Theorem, Scientific American, Algorithmic Information Theory, Cambridge Univ, Comments Hint, World Scientific, Bell System Tech, Elements of Information Theory, Basic Problems, unit integrable, recursive semimeasure, prefix machine, universal enumerable semimeasure, diagonal halting set, complete routing scheme, enumerable semimeasures, randomness deficiency, universal sequential test, incompressibility method, uniform measure one, universal prior probability, prefix complexity, recursive time bound, enumerable functions, incompressibility arguments, local routing function, random infinite sequences, logarithmic additive term, monotone machines, perfect decision tree, quadruple format, nth prediction, recursive measure, universal partial recursive function (see less)

Key Phrases: New York, Van Loan, Englewood Cliffs, System Sci, International Conference, Software Engrg, Academic Press, Las Vegas, Monte Carlo, Morgan Kaufmann, Linear Algebra Appl, San Mateo (see more)

Key Phrases: New York, Van Loan, Englewood Cliffs, System Sci, International Conference, Software Engrg, Academic Press, Las Vegas, Monte Carlo, Morgan Kaufmann, Linear Algebra Appl, San Mateo, Operating Syst, Elsevier Science Publishers, Apple Macintosh, Lecture Notes, Computer Soc, Silver Spring, Technical Report, Tuple Space, Van Nostrand Reinhold, Very Large Data Bases, Acta Inform, Management of Data, Microsoft Windows (see less)

Key Phrases: Lecture Notes, New York, Academic Press, Semigroup Forum, System Sci, Notes Comput, finite rnonoids, jump pda, controlled parallel insertion, iterated parallel insertion, ordered sernigroups, finite senrigroups (see more)

Key Phrases: Lecture Notes, New York, Academic Press, Semigroup Forum, System Sci, Notes Comput, World Scientific, Discrete Math, Discrete Appl, Pure Appl, Acta Informatica, Hilbert's Basis Theorem, London Math, Critical Factorization Theorem, Axel Thue, Journal of Algebra, Prentice Hall, Theorem of Kleene, University of Turku, Algebra Comput, Automata-Theoretic Aspects of Formal Power Series, Church's Thesis, Computer Math, Cornerstones of Undecidability, Englewood Cliffs, finite rnonoids, jump pda, controlled parallel insertion, iterated parallel insertion, ordered sernigroups, finite senrigroups, linguistical families, maximal dense intervals, grammatical families, homophonic codes, controlled parallel deletion, internal accepting configurations, parenthetic languages, positive boolean algebra, weakly permutable, equivalent finite subsystem, generalized equality set, generated sernigroup, combinatorial rank, finite sernigroups, finite prefix codes, matricial composition, nonernpty word, pointed monoid, abstract storage type (see less)