Results 1 to 10 of about 147,861 (260)
On Equivalence and Containment Problems for Formal Languages
Journal of the ACM, 1977 Daniel Rosenkrantz, Harry B Hunt
exaly +4 more sources
On the Commutative Equivalence of Algebraic Formal Series and Languages [PDF]
International Journal of Foundations of Computer Science, 2021 The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.
Carpi A., D'Alessandro F.
openaire +5 more sources
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
Logical Methods in Computer Science, 2023 A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +3 more sources
Complexity, 2021 Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean functions, is often desired when reliable and correct hardware components are required.
Wilayat Khan +3 more
doaj +2 more sources
On the semantic equivalence of language syntax formalisms [PDF]
Theoretical Computer Science, 2020 There are various approaches to describing the syntax of a language [\textit{E. Visser}, Syntax definition for language prototyping. Amsterdam: Univ. Amsterdam (1997; Zbl 0900.68290)]. Formal grammar [\textit{N. Chomsky}, Three models for the description of language. IRE Trans. Inf. Theory 2, No. 3, 113-124 (1956; Zbl 0156.25401)], [\textit{J. Earley},
Samuele Buro, Isabella Mastroeni
openaire +4 more sources
Российский технологический журнал, 2022 Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme is understood as a program model wherein abstraction from contensive values of operators and ...
Y. P. Korablin
doaj +1 more source
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics [PDF]
Logical Methods in Computer Science, 2023 The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive
Jos C. M. Baeten +2 more
doaj +1 more source
RUDN Journal of Language Studies, Semiotics and Semantics, 2021 The article is devoted to the issue of word-formation motivation, which does not lose its relevance and plays a role not only in disclosing formal-semantic relations between words of one language and has not only theoretical, but also applied ...
Raheem A. Al-Foadi +2 more
doaj +1 more source
Proc. ACM Program. Lang., 2022 Metareasoning can be achieved in probabilistic programming languages (PPLs) using agent models that recursively nest inference queries inside inference queries.
Yizhou Zhang, Nada Amin
semanticscholar +1 more source
Półrocznik Językoznawczy Tertium, 2020 The aim of this article is to analyse the scope of formal and dynamic equivalence in three press releases published by the European Commission in April 2020. The discussed press releases refer to the issue of the coronavirus pandemic and various measures
Marcelina Pietryga
doaj +1 more source