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
Proceedings ArticleDOI
01 Jan 2019
TL;DR: A formal language for specifying complex events, called CEL, is proposed that contains the main features used in the literature and has a denotational and compositional semantics and is presented as an efficient and declarative framework for CEP.
Abstract: Complex Event Processing (CEP) has emerged as the unifying field for technologies that require processing and correlating distributed data sources in real-time. CEP finds applications in diverse domains, which has resulted in a large number of proposals for expressing and processing complex events. However, existing CEP languages lack from a clear semantics, making them hard to understand and generalize. Moreover, there are no general techniques for evaluating CEP query languages with clear performance guarantees. In this paper we embark on the task of giving a rigorous and efficient framework to CEP. We propose a formal language for specifying complex events, called CEL, that contains the main features used in the literature and has a denotational and compositional semantics. We also formalize the so-called selection strategies, which had only been presented as by-design extensions to existing frameworks. With a well-defined semantics at hand, we discuss how to efficiently process complex events by evaluating CEL formulas with unary filters. We start by studying the syntactical properties of CEL and propose rewriting optimization techniques for simplifying the evaluation of formulas. Then, we introduce a formal computational model for CEP, called complex event automata (CEA), and study how to compile CEL formulas with unary filters into CEA. Furthermore, we provide efficient algorithms for evaluating CEA over event streams using constant time per event followed by constant-delay enumeration of the results. Finally, we gather the main results of this work to present an efficient and declarative framework for CEP.

29 citations

Journal ArticleDOI
TL;DR: The connections between rational series with coefficients in a semiring and their languages are studied to find out the relationships between these series and the languages they speak.

29 citations

Journal ArticleDOI
TL;DR: If the start condition is of random context type, the effect of different conditions for starting and stopping of the components of the grammar system is studied, and at most all matrix languages and the family of context-sensitive languages are obtained.

29 citations

Journal ArticleDOI
TL;DR: The authors argue that Frege did make very serious use of semantical concepts such as reference and truth in the formal theory of Frege, and that he explicitly committed himself to off-ering a justifi cation that appeals to the notion of reference.
Abstract: In recent work on Frege, one of the most salient issues has been whether he was prepared to make serious use of semantical notions such as reference and truth. I argue here Frege did make very serious use of semantical concepts. I argue, fi rst, that Frege had reason to be interested in the question how the axioms and rules of his formal theory might be justifi ed and, second, that he explicitly commits himself to off ering a justifi cation that appeals to the notion of reference. I then discuss the justifi cations Frege off ered, focusing on his discussion of inferences involving free variables, in section 17 of Grundgesetze, and his argument, in sections 29–32, that every well-formed expression of his formal language has a unique reference.

29 citations

Journal ArticleDOI
TL;DR: It is shown that log-bounded rudimentary reductions (defined and studied by Jones in 1975) characterize Dlogtime-uniform AC 0.

29 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