「formal」の共起表現一覧(1語右が「language」)
該当件数 : 48件
In some | formal language studies, (e.g. |
In | formal language theory, an unrestricted grammar is a |
A related concept is the empty language ∅, a | formal language that contains no strings. |
use | formal language specifications to syntactically and s |
A | formal language is a set of finite sequences of symbo |
As | formal language is extremely important in diplomacy, |
In computer science and | formal language theory, the empty string (or null str |
For instance, in | Formal language theory, the Kuroda normal form for co |
The essential feature of a | formal language is that its syntax can be defined wit |
he very first application of cycle rank was in | formal language theory, for studying the star height |
"…programs to manipulate in a suitable | formal language (most likely a part of the predicate |
The calculus of constructions (CoC) is a | formal language in which both computer programs and m |
gned to transform some input text in a certain | formal language into a modified output text that meet |
edicate may have additional domains beyond the | formal language domain, if that is what is required t |
of Karl Friedrich Schinkel, Lucae favored the | formal language of the Italian Renaissance. |
In | formal language theory, and in particular the theory |
A recursive | formal language is a recursive subset in the set of a |
atics, logic and computer science is a type of | formal language which is also called decidable or Tur |
es which strictly speaking are not part of the | formal language we are defining. |
WSML or Web Service Modeling Language is a | formal language that provides a syntax and semantics |
Attributional calculus provides a | formal language for natural induction, an inductive l |
A | formal language consists of a fixed collection of sen |
In | formal language theory, a picture language is a set o |
ion ordering on its family of feasible sets, a | formal language, and the corresponding path poset. |
ter science, a context-sensitive language is a | formal language that can be defined by a context-sens |
For example, in automata theory and | formal language theory it is convenient to consider l |
A recursively enumerable | formal language is a recursively enumerable subset in |
A recursively enumerable language is a | formal language for which there exists a Turing machi |
s like "papa" or "WikiWiki", called squares in | formal language theory. |
The star height problem in | formal language theory is the question whether all re |
The generalized star-height problem in | formal language theory is the open question whether a |
Automath (automating mathematics) was a | formal language, devised by Nicolaas Govert de Bruijn |
onal complexity theory, a sparse language is a | formal language (a set of strings) such that the numb |
A recursive language is a | formal language for which there exists a Turing machi |
s a controlled natural language -- a kind of a | formal language for expressing information that is de |
reviously known as Common Query Language, is a | formal language for representing queries to informati |
ise Privacy Authorization Language (EPAL) is a | formal language for writing enterprise privacy polici |
In computer science and | formal language theory, a context-free grammar is in |
This means that every | formal language that can be decided by such a machine |
order logic is an example of fully interpreted | formal language; all its sentences have meanings that |
of a graphical formalism, or a graph-theoretic | formal language, designed to be interpreted for logic |
A | formal language is an organized set of symbols the es |
cal computer science, the Bach language is the | formal language over an alphabet of three distinct sy |
s a set of weighted rules and facts of a given | formal language F. Notice that we are allowed to use |
l X is Y" first must be reworded into the more | formal language of the propositional calculus: " 'It |
onoids, and thus, one can apply both algebraic | formal language tools, as well as tools from graph th |
ed in compilers as ad hoc code attached to the | formal language parser. |
こんにちは ゲスト さん
![]() ログイン |
Weblio会員(無料)になると
![]() |
こんにちは ゲスト さん
![]() ログイン |
Weblio会員(無料)になると
![]() |