The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.

/pdf/languages-automata-and-logic-418xw4tas7.pdf

Languages, automata, and logic

Communication Complexity: Basics

Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E=DTIME(2/sup linear/) and E/sub 2/=DTIME(2/sup polynomial/) are surveyed. The measure structure of these classes is seen to interact in informative ways with bi-immunity, complexity cores, /sub >

https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1126&context=cs_techreports

The quantitative structure of exponential time

Efficient DNA sequencing of the genomes of individual species and organisms is a critical task for the advancement of biological sciences, medicine and agriculture. Advances in modern sequencing methods are needed to meet the challenge of sequencing such megabase to gigabase quantities of DNA. Two possible strategies for DNA sequencing exist: direct methods, in which each base position in the DNA chain is determined individually (e.g., gel sequencing or pyrosequencing), and indirect methods, in which the DNA sequence is assembled based on experimental determination of oligonucleotide content of the DNA chain. One promising indirect method is sequencing by hybridization (SBH), in which sets of oligonucleotides are hybridized under conditions that allow detection of complementary sequences in the target nucleic acid. The unprecedented sequence search parallelism of the SBH method has allowed development of high-throughput, low-cost, miniaturized sequencing processes on arrays of DNA samples or probes. Newly developed SBH methods use DNA ligation to combine relatively small sets of short probes to score potentially tens of millions of longer oligonucleotide sequences in a target DNA. Such combinatorial approaches allow analysis of DNA samples of up to several kilobases (several times longer than allowed by current direct methods) for a variety of DNA sequence analysis applications, including de novo sequencing, resequencing, mutation/SNP discovery and genotyping, and expression monitoring. Future advances in biochemistry and implementation of detection methods that allow single-molecule sensitivity may provide the necessary miniaturization, specificity, and multiplexing efficiency to allow routine whole genome analysis in a single solution-based hybridization experiment.

Sequencing by hybridization (SBH): advantages, achievements, and opportunities.

In this paper we propose a formal language for writing electronic contracts, based on the deontic notions of obligation, permission, and prohibition. We take an ought-to-do approach, where deontic operators are applied to actions instead of state-of-affairs. We propose an extension of the µ-calculus in order to capture the intuitive meaning of the deontic notions and to express concurrent actions. We provide a translation of the contract language into the logic, the semantics of which faithfully captures the meaning of obligation, permission and prohibition. We also show how our language captures most of the intuitive desirable properties of electronic contracts, as well as how it avoids most of the classical paradoxes of deontic logic. We finally show its applicability on a contract example.

/pdf/a-formal-language-for-electronic-contracts-smfouck5my.pdf

A formal language for electronic contracts

Data Types in Computer Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 James H. Davenport What Do We Learn from Experimental Algorithmics? . . . . . . . . . . . . . . . . . . 36 Camil Demetrescu and Giuseppe F. Italiano And/Or Hierarchies and Round Abstraction . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 Radu Grosu Computational Politics: Electoral Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 Edith Hemaspaandra and Lane A. Hemaspaandra 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey . . . . . 84 Phokion G. Kolaitis and Moshe Y. Vardi On Algorithms and Interaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99 Jan van Leeuwen and Jiř́ı Wiedermann On the Use of Duality and Geometry in Layouts for ATM Networks . . . . . . 114 Shmuel Zaks

Mathematical Foundations of Computer Science 2000

Recently, Lutz [14, 151 introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [ 11, 13-18,201) used this concept to investigate the quantitative structure of Exponential Time (E = DTIME(2”“)). Previously, Ambos-Spies et al. [2,3] introduced polynomial time bounded genericity concepts and used them for the investigation of structural properties of NP (under appropriate assumptions) and E. Here we relate these concepts to each other. We show that, for any c 3 1, the class of n’-generic sets has p-measure 1. This allows us to simplify and extend certain p-measure l-results. To illustrate the power of generic sets we take the Small Span Theorem of Juedes and Lutz [ 111 as an example and prove a generalization for bounded query reductions.

Branislav Rovan

Papers

Mathematical Foundations of Computer Science 2000

Genericity and measure for exponential time

Mathematical Foundations of Computer Science 2012

Mathematical Foundations of Computer Science 1990

Deterministic versus nondeterministic space in terms of synchronized alternating machines