Results 71 to 80 of about 184 (122)

Non-locality, contextuality and valuation algebras: a general theory of disagreement. [PDF]

Philos Trans A Math Phys Eng Sci, 2019
Abramsky S, Carù G.
europepmc   +1 more source

Existence of constants in regular splicing languages. [PDF]

Inf Comput, 2015
Bonizzoni P, Jonoska N.
europepmc   +1 more source

SYNTACTIC MONOIDS AND LANGUAGES (Algebra, Languages and Computation)

SYNTACTIC MONOIDS AND LANGUAGES (Algebra, Languages and Computation)
openaire  

自由単位半群のbiunitary submonoidのsyntactic monoidについて(2)

自由単位半群のbiunitary submonoidのsyntactic monoidについて(2)
openaire  

On scattered syntactic monoids

, 1993
The main result of this paper is a Myhill-Nerode-like theorem for languages L with the property that the commutative closure of L, com(L), is a regular language. This problem arises in a natural way when one considers the scattered deletion operation and some other related problems.
Alexandru Mateescu
openaire   +2 more sources

WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID

International Journal of Foundations of Computer Science, 2008
DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways.
Kari, Lila, Mahalingam, Kalpana
openaire   +3 more sources