Formations of Monoids, Congruences, and Formal Languages
Scientific Annals of Computer Science, 2015 The main goal in this paper is to use a dual equivalence in automata theory started in [RBBCL13] and developed in [BBCLR14] to prove a general version of the Eilenberg-type theorem presented in [BBPSE12].
A. Ballester-Bolinches +3 more
semanticscholar +1 more source
Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study [PDF]
, 2017 Widely used complex code refactoring tools lack a solid reasoning about the correctness of the transformations they implement, whilst interest in proven correct refactoring is ever increasing as only formal verification can provide true confidence in ...
Horpácsi, Dániel +2 more
core +2 more sources
Efficient reduction of nondeterministic automata with application to language inclusion testing [PDF]
Logical Methods in Computer Science, 2019 We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages.
Lorenzo Clemente, Richard Mayr
doaj +1 more source
La equivalencia formal en el lenguaje de las neuronas lógicas de McCulloch y Pitts
Epistemología e Historia de la Ciencia, 2022 In this article we consider the significance of formal equivalence in the language proposed by Warren McCulloch and Walter Pitts in their original “A logical calculus of the ideas immanent in nervous activity”. We study the model from the contributions that it has meant in the history of science: as a computational theory of mind; and as a formalism ...
openaire +3 more sources
Problem Solving of Non-equivalence Problems in English Into Indonesian Text [PDF]
, 2016 In the process of transferring one message of Source Language (SL) to Target Language (TL) in a translation must be careful by a translator, because one word may have more than one meaning.
Ninsiana, W. (Widhiya)
core +2 more sources
A multi-set extended relational algebra: a formal approach to a practical issue [PDF]
, 1993 The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples an a relation. Many database languages and systems do require multi-set semantics though, either because of functional requirements or because of the high costs
de By, R.A. +2 more
core +8 more sources
Modular Composition of Language Features through Extensions of Semantic Language Models [PDF]
, 1999 Today, programming or specification languages are often extended in order to customize them for a particular application domain or to refine the language definition. The extension of a semantic model is often at the centre of such an extension.
Pahl, Claus
core +1 more source
Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space [PDF]
Logical Methods in Computer ScienceWe study the equivalence between eval-readback and eval-apply big-step evaluators in the general setting of the pure lambda calculus. We study `one-step' equivalence (same strategy) and also discuss `big-step' equivalence (same final result).
Pablo Nogueira, Álvaro García-Pérez
doaj +1 more source
Meaningfulness, the unsaid and translatability. Instead of an introduction [PDF]
, 2015 The present paper opens this topical issue on translation techniques by drawing a theoretical basis for the discussion of translational issues in a linguistic perspective.
Keidan, Artemij
core +3 more sources
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically [PDF]
, 2015 Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general semirings, equipped with a rich set of higher-order operators.
De Vink, Erik P +2 more
core +3 more sources