finite state grammar

автоматная грамматика;
конечно-автоматная грамматика;
грамматика с конечным числом состояний

Большой англо-русский и русско-английский словарь. 2001.

Смотреть что такое "finite state grammar" в других словарях:

  • Finite state grammar —   [ faɪnaɪt steɪt ɡræmə; englisch »Grammatik mit endlich vielen Zuständen«], Sprachwissenschaft: Modell von Grammatiken, die eine unendliche Menge von Sätzen mithilfe einer endlichen Menge von rekursiven Regeln über einem endlichen Wortschatz… …   Universal-Lexikon

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

  • Adaptive grammar — An adaptive grammar is a formal grammar that explicitly provides mechanisms within the formalism to allow its own production rules to be manipulated. Contents 1 Overview 1.1 Early history 1.2 Collaborative efforts …   Wikipedia

  • Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… …   Wikipedia

  • Regular grammar — Strictly regular grammars = In computer science, a right regular grammar (also called right linear grammar) is a formal grammar ( N , Σ, P , S ) such that all the production rules in P are of one of the following forms: # A → a where A is a non… …   Wikipedia

  • English grammar — is a body of rules (grammar) specifying how phrases and sentences are constructed in the English language. Accounts of English grammar tend to fall into two groups: the descriptivist , which describes the grammatical system of English; and the… …   Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

  • Portuguese grammar — Portuguese grammar, the morphology and syntax of the Portuguese language, is similar to the grammar of most other Romance languages especially Galician and the other languages of Iberian Peninsula. It is a synthetic, fusional language. Nouns,… …   Wikipedia

  • Interlingua grammar — This article is an informal outline of the grammar of Interlingua, an international auxiliary language first publicized by IALA. It follows the usage of the original grammar text (Gode Blair, 1951), which is accepted today but regarded as… …   Wikipedia

Книги

Другие книги по запросу «finite state grammar» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.