Topic
Formal language
About: Formal language is a research topic. Over the lifetime, 5763 publications have been published within this topic receiving 154114 citations.
Papers published on a yearly basis
Papers
More filters
•
30 Jul 2013
TL;DR: Different methods of evaluating and formalizing simulation models are explored, enabling computer and industrial engineers, mathematicians, and students working with computer simulations to thoroughly understand the progression from simulation to product, improving the overall effectiveness of modeling systems.
Abstract: Models and simulations are an important first step in developing computer applications to solve real-world problems. However, in order to be truly effective, computer programmers must use formal modeling languages to evaluate these simulations. Formal Languages for Computer Simulation: Transdisciplinary Models and Applications investigates a variety of programming languages used in validating and verifying models in order to assist in their eventual implementation. This book will explore different methods of evaluating and formalizing simulation models, enabling computer and industrial engineers, mathematicians, and students working with computer simulations to thoroughly understand the progression from simulation to product, improving the overall effectiveness of modeling systems.
26 citations
••
TL;DR: The generator has been used to generate environments for PASCAL, MODULA-2 and the formal language definition language itself, and the experiences with formal language definitions are discussed from the language definer's point of view as well as from the programmer's view using the generated environments.
Abstract: The programming system generator developed at the Technical University of Darmstadt generates sophisticated interactive programming environments from formal language definitions. From a formal, entirely non-procedural definition of the language's syntax, context conditions and denotational semantics, it produces a hybrid editor, an interpreter and a library system. The editor allows both structure editing and text editing, guaranteeing immediate recognition of syntactic and semantic errors. The generator has been used to generate environments for PASCAL, MODULA-2 and the formal language definition language itself. A brief description of the generated environments and the definition language is given, and our experiences with formal language definitions are discussed from the language definer's point of view as well as from the programmer's point of view using the generated environments.
26 citations
••
TL;DR: This paper solves the famous open problem of Kanellakis showing that uniform boundedness is undecidable for single rule programs (called also sirups).
Abstract: DATALOG is the language of logic programs without function symbols. It is considered to be the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is bounded. Since bounded programs can be executed in parallel constant time, the possibility of automatized boundedness detecting is believed to be an important issue and has been studied in many papers. Boundedness was proved to be undecidable for different kinds of semantical assumptions and syntactical restrictions. Many different proof techniques were used.
In this paper we propose a uniform proof method based on the discovery of, as we call it, the Achilles--Turtle machine, and make strong improvements on most of the known undecidability results. In particular we solve the famous open problem of Kanellakis showing that uniform boundedness is undecidable for single rule programs (called also sirups).
This paper is the full version of [J. Marcinkowski, Proc. 13th STACS, Lecture Notes in Computer Science 1046, pp. 427--438], and [J. Marcinkowski, 11th IEEE Symposium on Logic in Computer Science, pp. 13--24].
26 citations
••
TL;DR: It is shown that this problem remains undecidable even if the Thue systems under consideration contain only length-reducing rules plus a single length-preserving rule, which is a commutation rule of the form ( ab, ba ), where a and b are distinct letters.
26 citations
••
15 Nov 1997
TL;DR: Relations between various models for massively parallel computers are investigated, making comparisons in terms of their capabilities to time-construct and time-compute functions.
Abstract: Relations between various models for massively parallel computers are investigated. These are arrays of finite-state machines — eventually augmented by pushdown storage — operating synchronously. The architectures differ mainly in how the input is supplied and how the single nodes are interconnected. The comparisons are made in terms of their capabilities to time-construct and time-compute functions. That means that given an constant input of length n a distinguished cell has to enter distinguished states after F (1),…, F ( n ) respectively F ( n ) time steps.
26 citations