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
Book•
29 Apr 2010TL;DR: In this article, the Continuum Problem and Forcing were studied in the context of formal languages and computable sets, and they were shown to be computable and provenable.
Abstract: PROVABILITY.- to Formal Languages.- Truth and Deducibility.- The Continuum Problem and Forcing.- The Continuum Problem and Constructible Sets.- COMPUTABILITY.- Recursive Functions and Church#x2019 s Thesis.- Diophantine Sets and Algorithmic Undecidability.- PROVABILITY AND COMPUTABILITY.- G#x00F6 del#x2019 s Incompleteness Theorem.- Recursive Groups.- Constructive Universe and Computation.- MODEL THEORY.- Model Theory.
67 citations
TL;DR: It is seen that prefix-closed languages are relatively hard to learn compared to arbitrary regular languages and an optimized version of this algorithm is implemented and analyzed, showing positive results.
67 citations
08 Apr 2002
TL;DR: A tool that supports authoring of informal and formal software requirements specifications simultaneously and from a single source is described, based on the Grammatical Framework, a generic tool that combines linguistic and logical methods.
Abstract: We describe foundations and design principles of a tool that supports authoring of informal and formal software requirements specifications simultaneously and from a single source. The tool is an attempt to bridge the gap between completely informal requirements specifications (as found in practice) and formal ones (as needed in formal methods). The user is supported by an interactive syntax-directed editor, parsers and linearizers. As a formal specification language we realize the Object Constraint Language, a substandard of the UML, on the informal side a fragment of English. The implementation is based on the Grammatical Framework, a generic tool that combines linguistic and logical methods.
67 citations
26 Jun 2005
TL;DR: The main results are that the variant of probabilistic Buchi automata (PBA) is more expressive than non-deterministic /spl omega/-automata, but a certain subclass of PBA has exactly the power of /spl Omega/-regular languages.
Abstract: Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for /spl omega/-regular languages. Our main results are that our variant of probabilistic Buchi automata (PBA) is more expressive than non-deterministic /spl omega/-automata, but a certain subclass of PBA, called uniform PBA, has exactly the power of /spl omega/-regular languages. This also holds for probabilistic /spl omega/-automata with Streett or Rabin acceptance. We show that certain /spl omega/-regular languages have uniform PBA of linear size, while any nondeterministic Streett automaton is of exponential size, and vice versa. Finally, we discuss the emptiness problem for uniform PBA and the use of PBA for the verification of Markov chains against qualitative linear-time properties.
67 citations
TL;DR: It is shown that there exist algorithms for deciding whether or not an arbitrary regular language has a Ω-representation over an arbitrary class C of regular languages for any subset Ω of T.
67 citations