theoretical computer science, in particular in formal language theory, Greibach's theorem states that certain properties of formal language classes are undecidable...
8 KB (852 words) - 16:25, 13 April 2025
family of acceptors Greibach's theorem Sheila Greibach at the Mathematics Genealogy Project "Sheila Greibach". Sheila Greibach's Faculty page at UCLA...
11 KB (1,353 words) - 00:43, 18 March 2025
p. 303)). Rice's theorem: a generalized formulation of Turing's second theorem (cf Hopcroft and Ullman p. 185ff) Greibach's theorem: undecidability in...
29 KB (3,915 words) - 08:17, 2 August 2024
form Chomsky normal form Kuroda normal form Greibach, Sheila (January 1965). "A New Normal-Form Theorem for Context-Free Phrase Structure Grammars"....
3 KB (406 words) - 11:39, 1 May 2025
L(G_{2})} is a subset of L ( G 1 ) {\displaystyle L(G_{1})} . Using Greibach's theorem, it can be shown that the two following problems are undecidable:...
46 KB (6,143 words) - 21:09, 21 April 2025
grammars Aho's one-way nested stack automata Fischer's macro grammars Greibach's automata with stacks of stacks Maibaum's algebraic characterization Hayashi...
6 KB (695 words) - 17:08, 2 January 2024
that is ε-free can be transformed into an equivalent LL(k) grammar in Greibach normal form (which by definition does not have rules with left recursion)...
14 KB (1,997 words) - 10:49, 7 December 2023
family of languages Ginsburg & Greibach (1967) Nivat (1968) cf. Mateescu & Salomaa (1997) Ginsburg, Seymour; Greibach, Sheila (1967). "Abstract Families...
5 KB (725 words) - 12:28, 10 May 2023
of inherently ambiguous context-free languages was proven with Parikh's theorem in 1961 by Rohit Parikh in an MIT research report. The language { x | x...
15 KB (1,804 words) - 15:04, 9 March 2025
automata both acceptance conditions define the same family of languages. Theorem. For each pushdown automaton M {\displaystyle M} one may construct a pushdown...
25 KB (4,141 words) - 21:31, 7 May 2025
pioneered and named The Internet of Things at M.I.T. Sanjeev Arora – PCP theorem Winifred "Tim" Alice Asprey – established the computer science curriculum...
55 KB (5,230 words) - 04:23, 7 April 2025
(2). IEEE: 67–76. doi:10.1109/PGEC.1963.263416. Greibach, Sheila (1965). "A new normal-form theorem for context-free phrase structure grammars". Journal...
12 KB (1,654 words) - 22:41, 7 June 2024
Deconstruction Dedekind cut Deduction Deduction and induction Deduction theorem Deductive Deductive-nomological model Deductive closure Deductive closure...
73 KB (7,033 words) - 08:19, 21 April 2025
to the classification theorem for compact surfaces, MR3026641. Wood, Bill (2014), Review of A Guide to the Classification Theorem for Compact Surfaces...
8 KB (473 words) - 09:41, 19 August 2024
the first meta-circular evaluator, contributed the structured program theorem Grady Booch, developer of Unified Modeling Language (UML) Kathleen Booth...
58 KB (5,835 words) - 18:27, 25 December 2024
grammars, viz. Aho's one-way nested stack automata Fischer's macro grammars Greibach's automata with stacks of stacks Maibaum's algebraic characterization Hayashi...
22 KB (2,718 words) - 06:48, 30 January 2023
183–196. ISBN 3-540-20907-7. Zbl 1088.68117. Droste & Kuich (2009), p. 15, Theorem 3.4 Conway, J.H. (1971). Regular algebra and finite machines. London: Chapman...
52 KB (8,021 words) - 14:35, 11 April 2025