Search results

{{short description|Programming language with strong abstraction from details of hardware}} ...journal=[[Zeitschrift für Angewandte Mathematik und Mechanik]] |volume=31 |page=255 |date=1951 |doi=10.1002/zamm.19510310820}}</ref> ...

{{Short description|Abstract language theory concept}}{{Use American English|date=January 2019} ==Description== ...

{{Short description|Type of a context-free grammar}} ...and of <math>w_2 w_3</math> agree.<ref>{{harvtxt|Rosenkrantz|Stearns|1970|page=227}}. Def.1. The authors do not consider the case ''k''=0.</ref> ...

{{Short description|Online Judge System}} ...to problems can be submitted in over 40 programming [[programming language|languages]], including esoteric ones, via the Sphere Engine. It is run by the Polish ...

...ar=2010|publisher=Springer Science & Business Media|isbn=978-3-642-14846-0|page=37}} citing Bertsch, Nederhof (2001)<ref>{{cite conference | chapter-url=ht ==Description== ...

{{Short description|Theorem about fixed points of multiple variables}} ...first1=Cliff B. |editor-first1=C. B |editor-last1=Jones |title=Programming Languages and Their Definition |date=1984 |volume=177 |doi=10.1007/BFb0048933 |chapte ...

{{Short description|Mathematical structure}} ...r, Rabin, Streett, and parity tree automata recognize the same set of tree languages, and thus have the same expressive power. ...

Let <math>L</math> be the set of words over the [[Alphabet (formal languages)|alphabet]] {''a'',''b''} whose ''n''th last letter is an <math>a</math>. T Let ''A'' and ''B'' be two UFAs. Let ''L''(''A'') and ''L''(''B'') be the languages accepted by those automata. Then ''L''(''A'')⊆''L''(''B'') if and only if ' ...

{{Short description|Connectivity measure in graph theory}} ===Star height of regular languages=== ...

{{Short description|Structure of a formal language}} {{Formal languages}} ...

{{Short description|Theoretical computer model}} ...t=Thielecke|first=Hayo|date=December 9, 2015|title=Implementing functional languages with abstract machines|url=https://www.cs.bham.ac.uk/~hxt/2015/compilers/co ...

==Description== ...ume? -->=20? |pages=135–139 |postscript=;}} {{cite journal |title=Computer Languages |author-first=Charles Leonard |author-last=Hamblin |author-link=Charles Leo ...

{{Short description|Algorithm to transform a regular expression into a finite automaton}} ...url-access=registration |url=https://archive.org/details/compilers00alfr_0/page/159 }}</ref> is a method of transforming a [[regular expression]] into an e ...

{{Short description|Form of typed lambda calculus}} ...= 2004 | isbn = 1-4020-2334-0 | chapter = Section 4c: Pure type systems | page = 116 }}</ref> In fact, Barendregt (1991) framed his cube in this setting.< ...

...ning another expression. The let-expression is present in some functional languages in two forms; let or "let rec". Let rec is an extension of the simple let e ...guage introduced the let expression, which has appeared in most functional languages since that time. ...

{{Short description|Branch of applied mathematics}} ...ighted graphs]] are used to model the lexical similarity between different languages (after computing lexicostatistics): ...

{{Short description|Concept in theoretical computer science}} Given an [[Alphabet (formal languages)|alphabet]] ''A'', a timed word is a sequence, finite or infinite <math>w=( ...

{{Short description|Chuukic language}} |fam2=[[Malayo-Polynesian languages|Malayo-Polynesian]] ...

...title=Succinctness of Description of Context-Free, Regular and Unambiguous Languages |publisher=Cornell University}}</ref> was smaller. | title = On the complexity of regular languages in terms of finite automata ...

{{Short description|Russian nuclear physicist (1928–2022)}} * [[Moscow State Linguistic University|Moscow Institute of Foreign Languages]] for two years ...