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
01 May 1997
TL;DR: Syntax from Concrete Syntax as discussed by the authors ] is a syntax from concrete syntax (SCTS) based approach for syntactically annotated concrete syntactic expressions. But
Abstract: Syntax from Concrete Syntax
77 citations
TL;DR: An algebraic approach to the theory of regular languages of finite and infinite words (∞-languages) is presented and a variety theorem is proved: there is a one-to-one correspondence between varieties of ∞-Languages and pseudovarieties of right binoids.
Abstract: An algebraic approach to the theory of regular languages of finite and infinite words (∞-languages) is presented. It extends the algebraic theory of regular languages of finite words, which is based on finite semigroups. Their role is taken over by a structure called right binoid. A variety theorem is proved: there is a one-to-one correspondence between varieties of ∞-languages and pseudovarieties of right binoids. The class of locally threshold testable languages and several natural subclasses (such as the class of locally testable languages) as well as classes of the Borel hierarchy over the Cantor space (restricted to regular languages) are investigated as examples for varieties of ∞-languages. The corresponding pseudovarieties of right binoids are characterized and in some cases defining equations are derived. The connections with the algebraic description and classification of regular languages of infinite words in terms of finite semigroups are pointed out.
76 citations
22 Mar 1999
TL;DR: It is shown that Lr is decidable, and it is explained how Lr relates to two previously defined structuredescription formalisms by showing how an arbitrary shape descriptor from each of these formalisms can be translated into an Lr formula.
Abstract: This paper aims to provide a better formalism for describing properties of linked data structures (e.g., lists, trees, graphs), as well as the intermediate states that arise when such structures are destructively updated. The paper defines a new logic that is suitable for these purposes (called Lr, for "logic of reachability expressions"). We show that Lr is decidable, and explain how Lr relates to two previously defined structuredescription formalisms ("path matrices" and "static shape graphs") by showing how an arbitrary shape descriptor from each of these formalisms can be translated into an Lr formula.
76 citations
TL;DR: A general set of conditions is given under which a property is undecidable for a family of languages.
Abstract: A general set of conditions is given under which a property is undecidable for a family of languages. Examples are given of the application of this result to wellknown families of languages.
76 citations
TL;DR: A formal framework is set up to describe transition system specifications in the style of Plotkin that has the power to express many-sortedness, general binding mechanisms, and substitutions, among other notions such as negative hypotheses and unary predicates on terms.
Abstract: We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechanisms, and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework is used to present a conservativity format in operational semantics, which states sufficient criteria to ensure that the extension of a transition system specification with new transition rules does not affect the semantics of the original terms.
76 citations