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
TL;DR: An algebraic model of object orientation is presented that defines how object oriented concepts can be represented algebraically using an object oriented algebraic specification language O-SLANG.
Abstract: Formal software specification has long been touted as a way to increase the quality and reliability of software; however, it remains an intricate, manually intensive activity. An alternative to using formal specifications directly is to translate graphically based, semiformal specifications into formal specifications. However, before this translation can take place, a formal definition of basic object oriented concepts must be found. The paper presents an algebraic model of object orientation that defines how object oriented concepts can be represented algebraically using an object oriented algebraic specification language O-SLANG. O-SLANG combines basic algebraic specification constructs with category theory operations to capture internal object class structure, as well as relationships between classes.
34 citations
Book•
01 Jan 1992
TL;DR: This-thesis presents a new computational model of phonology that is faithful to standard autosegmental theory, that has clearly adequate expressive power, and that is suitable as the basis for a tool for phonological analysis.
Abstract: Phonology may be briefly defined as the study of sound patterns in spoken language. One of the most well-known computational models of phonology, Koskenniemi's two-level phonology, is based on an underlying linguistic theory that has been superseded by autosegmental phonology, which began with the work of Goldsmith. There is a need for computational models that are faithful to this more recent theory. Such a model can form the basis of a computational tool that can quickly and accurately check the validity of a phonological analysis on a large amount of phonetic data, freeing the linguist from the tedious and enor-prone task of doing this by hand. This-thesis presents a new computational model of phonology that is faithful to standard autosegmental theory, that has clearly adequate expressive power, and that is suitable as the basis for a tool for phonological analysis. It follows on very recent efforts by Kornai and Bird & Ellison to model autosegmental phonology. The model is based on a view of phonology that sees phonological representations as data and phonological rules as procedures that manipulate them. It models rules using multi-tape state-labelled finite transducers (MSFTs), a natural extension of finite state transducers obtained by adding multiple input and output tapes. MSFTs are shown to be powerful enough to express a wide range of autosegmental rules. We also investigate the class of formal languages accepted by multi-tape state-labelled finite automata (MSFAs) when their input tapes are considered to encode a single word in parallel. This class is quite large, including some languages that are not context free. Given that our model is faithful to autosegmental theory, this gives an upper bound on the computational power required to model autosegmental phonological rules.
34 citations
Book•
01 Apr 1997TL;DR: This second volume of the Handbook of Formal Languages contains the most fundamental applications of language theory, including aspects of linguistics and parsing, both natural and programming languages, symbolic manipulation, and pattern matching.
Abstract: This second volume of the Handbook of Formal Languages contains the most fundamental applications of language theory. Various aspects of linguistics and parsing, both natural and programming languages, symbolic manipulation, and pattern matching are discussed. A special feature is the recently very active field of DNA computing.
34 citations
01 Nov 1997
TL;DR: Flavor as mentioned in this paper is an extension of C++ and Java in which the typing system is extended to incorporate bitstream representation semantics, allowing to describe in a single place both the in-memory representation of data as well as their bitstream-level representation as well.
Abstract: We present the design and implementation of a new programming language for media-intensive applications called Flavor (Formal Language for Audio-Visual Object Representation). It is an extension of C++ and Java in which the typing system is extended to incorporate bitstream representation semantics. This allows to describe in a single place both the in-memory representation of data as well as their bitstream-level (compressed) representation as well. We have developed software tools (www.ee. columbia.edu/flavor) that automatically generate standard C++ and Java code from the Flavor source code, so that direct access to compressed multimedia information by application developers can be achieved with essentially zero programming.
34 citations
TL;DR: A set of definitions is proposed which places a dynamic model of growth and stabilization in biological systems in a formal language framework and shows that if every string is considered to be a possible initial string in development, then the class of languages defined is properly included in theclass of regular languages.
Abstract: A set of definitions is proposed which places a dynamic model of growth and stabilization in biological systems in a formal language framework. The language of stable adult strings achievable in a system without cellular interactions is studied. It is shown that o if every string is considered to be a possible initial string in development, then the class of languages defined is properly included in the class of regular languages. However if, as is biologically reasonable, development can only start from strings drawn from a finite initial set, then the class of languages defined is exactly the class of context free languages.
33 citations