Formal language

About: Formal language is a research topic. Over the lifetime, 5763 publications have been published within this topic receiving 154114 citations.

Models of Computation and Formal Languages

Abstract: Preface Chapter 0 - Mathematical Preliminaries Part I: Models of Computation Chapter 1 - Turning Machines Chapter 2 - Additional Varieties of Turning Machines Chapter 3 - An Introduction to Recursion Theory Chapter 4 - Markov Algorithms Chapter 5 - Register Machines Chapter 6 - Post Systems (Optional) Chapter 7 - The Vector Machine Model of Parallel Computation (Optional) Chapter 8 - The Bounds of Computability Part II: A Hierarchy of Automata and Formal Languages Chapter 9 - Regular Languages and Finite-State Automata Chapter 10 - Context-Free Languages and Pushdown-Stock Automata Chapter 11 - Context-Free Languages and Compiler Design Theory (Optional) Chapter 12 - Context-Sensitive Languages and Linear Bounded Automata Chapter 13 - Generative Grammars an the Chomsky Hierarchy Epilogue

An axiomatic basis of trust in distributed systems

Abstract: He introduces basic notions about developing a logic or a theory, and shows that modal logics of belief, with their Kripe-style possible-worlds semantics, are appropriate for basing a theory of trust on. He reviews a modal logic of belief, and constructs a model of the distributed system so that the logic is sound and complete with respect to the model. Any sentences in the logic may then be added to the logic as axioms, and these axiomatic sentences are considered as trust specifications. He presents methods to map a formal trust specification on to mechanisms for its implementation in the distributed system. Trust and security are closely related in distributed systems. It is shown how security specification and verification methods can be integrated into the presented theory of trust. The author analyzes the trusts required in public-key-based secure communication. >

Syntactic characterization of machine parts shapes

Abstract: In the paper a general purpose parts description language is presented. This language seems to be particularly adequate for the automatic processing of the CAD/CAM system. The description method of machine parts, developed in the paper, is associated not only with individual parts but also with their classes. Each of these classes is created by parts of “similar shapes.” This similarity is determined by the “structure” (configuration) of primitives in contours describing machine parts. This structure is defined in a syntactic manner by means of a formal language generated by the extended context-free grammar (ECFg for short). The right hand sides of the production rules of ECFg are regular expressions over the terminal and non-terminal symbols. It appears quite natural to assume that ECFg generating contours (which uniquely determine machine parts) is in the so-called chain form. ECFGg in the chain form is a modification of the simple chain grammar which has been introduced and investigated by Ni...

The Insufficiency of Formal Design Methods " The Necessity of an Experimental Approach - for the Understanding and Control of Complex MAS

Abstract: We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given formal specification; or checking that a program meets a specification. We exhibit a simple MAS which has all the power of a Turing machine. We argue that any pure design methodology will face insurmountable difficulties in today's open and complex MAS. We recommend instead a methodology based on experimental method - scientific foundations for MAS construction and control.

A logic modeling language for automated model construction

Abstract: This paper describes PM ∗ (read PM-star) a first-order logic based language, that is the basis of a knowledge based system designed to help non-expert users construct Linear Programming models in the Production, Distribution and Inventory planning domain. Problems specified in PM ∗ define a logic model which is used to generate problem-specific inferences and inferences required to automate model construction. PM ∗ extends previous work on the PM language (Krishnan, 1988) through the integration of problem representation and model construction within a uniform predicate logic frame.