Results 1 to 10 of about 101,493 (254)
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 +6 more sources
Translating Latin legalese: between dynamic equivalence and formal correspondence. A comparative study case of Latin legal terms and maxims in English, Italian and Polish language [PDF]
, 2021 The aim of this article is to outline some theoretical problems related to the incompatibility of formal use of several Latin expressions present in English, Italian and Polish lexis as well as to propose solutions for facing practical cases of translation troubles based on the experience of the author gathered as academic, court translator and lay ...
Łukasz Jan Berezowski
openaire +6 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
On Equivalence and Containment Problems for Formal Languages [PDF]
Journal of the ACM, 1977 Hunt, Harry B. III +1 more
openaire +3 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
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
Formal Analysis of Quantum Systems using Process Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Quantum communication and cryptographic protocols are well on the way to becoming an important practical technology. Although a large amount of successful research has been done on proving their correctness, most of this work does not make use of ...
Timothy A.S. Davidson +2 more
doaj +1 more source