Results 1 to 10 of about 222,741 (282)
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.
Flavio D'Alessandro +2 more
semanticscholar +7 more sources
On Equivalence and Containment Problems for Formal Languages [PDF]
Journal of the ACM, 1977 Daniel J. Rosenkrantz, Harry B. Hunt
semanticscholar +4 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
Algebraic Structure of Combined Traces [PDF]
Logical Methods in Computer Science, 2013 Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are able to capture
Lukasz Mikulski
doaj +4 more sources
Translation Strategies and Equivalence in Formal Document Translation: A Study of UNESCO Agreements
Journal of Languages and Language TeachingThis research investigates translation strategies and equivalence in translating Indonesian cultural terms in UNESCO agreements into English. The study aims to explore how translation strategies are adapted to address challenges in formal document ...
Ahmad Syafran +4 more
doaj +2 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 +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
Российский технологический журнал, 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
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