- derivable string
- выводимая цепочка (символов)
Большой англо-русский и русско-английский словарь. 2001.
derivable string
Смотреть что такое "derivable string" в других словарях:
Greibach normal form — In computer science, to say that a context free grammar is in Greibach normal form (GNF) means that all production rules are of the form::A o alpha X or:S o lambdawhere A is a nonterminal symbol, α is a terminal symbol, X is a (possibly empty)… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Formal interpretation — A formal interpretation [http://books.google.com/books?id=weKqT3ka5g0C pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
Diatonic and chromatic — Chromatic redirects here. For other uses, see Chromatic (disambiguation). Melodies may be based on a diatonic scale and maintain its tonal characteristics but contain many accidentals up to all twelve tones of the chromatic scale, such as the… … Wikipedia
Kemenche — Infobox Instrument name=Karadeniz kemençesi names=ç’ilili(ჭილილი), Pontic kemenche classification= *Bowed string instrument range= related= * Rebec * igil * Byzaanchy * Shichepshin * Huqin * Cretan liraA kemenche (Turkish: kemençe, Laz: Ç… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Brouwer-Hilbert controversy — A foundational controversy in twentieth century history of mathematics opposed L. E. J. Brouwer, a supporter of intuitionism, and David Hilbert, the founder of formalism.BackgroundThe background for the controversy was set with David Hilbert s… … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Formal system — In formal logic, a formal system (also called a logical system,Audi, Robert (Editor). The Cambridge Dictionary of Philosophy . Second edition, Cambridge University Press, 1999. ISBN 978 0521631365 (hardcover) and ISBN 978 0521637220 (paperback).] … Wikipedia
