scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: This work introduces several specialized algorithms that are able to handle subclasses of ML-Rules more efficiently and compared in a performance study on the relation between expressive power and computational complexity of rule-based modeling languages.
Abstract: The domain-specific modeling and simulation language ML-Rules is aimed at facilitating the description of cell biological systems at different levels of organization Model states are chemical solutions that consist of dynamically nested, attributed entities The model dynamics are described by rules that are constrained by arbitrary functions, which can operate on the entities’ attributes, (nested) solutions, and the reaction kinetics Thus, ML-Rules supports an expressive hierarchical, variable structure modeling of cell biological systems The formal syntax and semantics of ML-Rules show that it is firmly rooted in continuous-time Markov chains In addition to a generic stochastic simulation algorithm for ML-Rules, we introduce several specialized algorithms that are able to handle subclasses of ML-Rules more efficiently The algorithms are compared in a performance study, leading to conclusions on the relation between expressive power and computational complexity of rule-based modeling languages

26 citations

Journal ArticleDOI
TL;DR: A fuzzy temporal constraint logic is proposed which provides the formal language which will allow the expression of well-formed formulas related to the temporal events by means of temporal constraints and introduces a valid resolution principle in order to solve the queries in this logic.

26 citations

Journal Article
TL;DR: In this paper, the authors give a necessary and sufficient condition for completeness, which is strictly weaker than the confusion-freedom condition of Micciancio and Warinschi [MW02].
Abstract: A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this direction was taken by Abadi and Rogaway [AR02]. Considering a formal language that treats symmetric encryption, [AR02] show that an associated formal semantics is sound with respect to an associated computational semantics, under a particular, sufficient, condition on the computational encryption scheme. In this paper, we give a necessary and sufficient condition for completeness, tightly characterizing this aspect of the exposition. Our condition involves the ability to distinguish a ciphertext and the key it was encrypted with, from a ciphertext and a random key. It is shown to be strictly weaker than a previously suggested condition for completeness (confusion-freedom of Micciancio and Warinschi [MW02]), and should be of independent interest.

26 citations

Posted Content
TL;DR: In this article, the complexity of determining the satisfiability of a given graded modal logic formula over classes of frames characterized by any combination of reflexivity, seriality, symmetry, transitivity and the Euclidean property is investigated.
Abstract: Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as "It is true at no fewer than 15 accessible worlds that...", or "It is true at no more than 2 accessible worlds that...". We investigate the complexity of satisfiability for this language over some familiar classes of frames. This problem is more challenging than its ordinary modal logic counterpart--especially in the case of transitive frames, where graded modal logic lacks the tree-model property. We obtain tight complexity bounds for the problem of determining the satisfiability of a given graded modal logic formula over the classes of frames characterized by any combination of reflexivity, seriality, symmetry, transitivity and the Euclidean property.

26 citations

Journal ArticleDOI
TL;DR: It turns out that, for a wide class of regular languages L, the maximum number of words of length n in L having the same number of occurrences of a given symbol is of the order of growth λn/√n, for some constant λ>1.

26 citations


Network Information
Related Topics (5)
Data structure
28.1K papers, 608.6K citations
87% related
Time complexity
36K papers, 879.5K citations
86% related
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Semantics
24.9K papers, 653K citations
85% related
Component-based software engineering
24.2K papers, 461.9K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202237
2021113
2020175
2019173
2018142