Results 291 to 300 of about 2,322,283 (342)

Applying the B formal method to the Bossa domain-specific language

open access: green, 2005
Jean-Paul Bodeveix   +3 more
openalex   +1 more source

A class of formal languages [PDF]

open access: possibleAlgebra and Logic, 1998
The authors deal with languages \(L\) that are classes of fully invariant congruences on free semigroups \(A^+\) of finite rank over a finite alphabet \(A\). The question is posed as to whether a given fully invariant congruence coincides with a syntactic congruence of the language in question. For a two-letter alphabet \(A=\{a,b\}\), suppose \(TM\) is
Arseny M. Shur, E. V. Sukhanov
openaire   +2 more sources

Home - About - Disclaimer - Privacy