Results 31 to 40 of about 184 (122)
The Lattice‐Valued Turing Machines and the Lattice‐Valued Type 0 Grammars
Purpose. The purpose of this paper is to study a class of the natural languages called the lattice‐valued phrase structure languages, which can be generated by the lattice‐valued type 0 grammars and recognized by the lattice‐valued Turing machines. Design/Methodology/Approach.
Juan Tang +3 more
wiley +1 more source
Counting Closed Orbits for the Dyck Shift
The prime orbit theorem and Mertens’ theorem are proved for a shift dynamical system of infinite type called the Dyck shift. Different and more direct methods are used in the proof without any complicated theoretical discussion.
Fahad Alsharari +3 more
wiley +1 more source
Applying Algebraic Approaches for Modeling Workflows and their Transformations in Mobile Networks
In emergency scenarios we can obtain a more effective coordination among team members, each of them equipped with hand‐held devices, through the use of workflow management software. Team members constitute a Mobile Ad‐hoc NETwork (MANET), whose topology both influences and is influenced by the workflow.
Paolo Bottoni +3 more
wiley +1 more source
Case Study on Algebraic Software Methodologies for Scientific Computing
The use of domain specific languages and appropriate software architectures are currently seen as the way to enhance reusability and improve software productivity. Here we outline a use of algebraic software methodologies and advanced program constructors to improve the abstraction level of software for scientific computing.
Magne Haveraaen
wiley +1 more source
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goode, Elizabeth, Pixton, Dennis
openaire +1 more source
The syntactic monoid of a hypercode
This paper gives a characterization of the syntactic monoid of a hypercode H over a finite alphabet X, a hupercode being a non empty set of non empty words over X, which are pairwise incomparable relatively to the embedding partial order of X.
openaire +1 more source
Recognizability in Stochastic Monoids
Stochastic monoids and stochastic congruences are introduced and the syntactic stochastic monoid M L associated to a subset L of a stochastic monoid M is constructed.
A. Kalampakas +2 more
doaj
What is category theory to cognitive science? Compositional representation and comparison. [PDF]
Phillips S.
europepmc +1 more source
Graph Partitions in Chemistry. [PDF]
Michos I, Raptis V.
europepmc +1 more source
Automatic differentiation of uncertainties: an interval computational differentiation for first and higher derivatives with implementation. [PDF]
Dawood H, Megahed N.
europepmc +1 more source

