Schlemms-Canal
发表于 2025-3-30 09:36:00
http://reply.papertrans.cn/48/4738/473710/473710_51.png
crumble
发表于 2025-3-30 14:12:21
Words — Monoids — LanguagesWhen we read or write a mathematical text, we employ a certain number of marks and conventions which are more or less well-defined and more or less expressed — if not simply left understood — and which enable mathematicians to understand each other.
annexation
发表于 2025-3-30 17:50:57
http://reply.papertrans.cn/48/4738/473710/473710_53.png
Indicative
发表于 2025-3-30 23:39:40
Combinatorial Systems and Turing Machines; Undecidable ProblemsWe have presented two of the mathematical entities which were specifically created for formalizing the intuitive notion of computability, namely :.and we have also pointed out that the concept of a Turing machine is equivalent to that of a recursive function. We shall now show that it is also equivalent to the concept of a combinatorial system.
CANON
发表于 2025-3-31 02:44:07
Languages Defined by Systems of EquationsIn connection with languages, we defined a certain number of operations, among them:
破裂
发表于 2025-3-31 06:26:36
http://reply.papertrans.cn/48/4738/473710/473710_56.png
整体
发表于 2025-3-31 11:25:07
Homomorphisms of MonoidsThis chapter sets forth some concepts of algebra which will be used frequently in what follows.
类人猿
发表于 2025-3-31 15:23:04
More about Kleene LanguagesLet V. be a terminal alphabet. We define a language K. by the following conditions:
BUDGE
发表于 2025-3-31 20:22:13
More about Context-Free LanguagesLet ? = {a, b,...} and ?’ = {a’, b’,...} be two finite, disjunct alphabets of the same cardinality whose letters are coupled two-by-two: a with a’, etc. We set ? = ? ∪ ?’.
胆汁
发表于 2025-3-31 21:56:07
Algebraic LanguagesIn Chapter 11 the concept of a formal power series whose terms are associative but not commutative monomials was introduced from a heuristic point of view. We then indicated (somewhat intuitively) some of the applications that could be made of power series to the CF-languages.