Indexed grammar

Results: 29



#Item
1m-multiple context-free grammars  The Pumping Lemma for Well-Nested Multiple Context-Free Languages

m-multiple context-free grammars The Pumping Lemma for Well-Nested Multiple Context-Free Languages

Add to Reading List

Source URL: research.nii.ac.jp

Language: English - Date: 2010-06-08 00:59:33
2C:/Users/Giorgio/Documents/VERIFY_SVN/GAP_PDS/PDA-gap-order/main.dvi

C:/Users/Giorgio/Documents/VERIFY_SVN/GAP_PDS/PDA-gap-order/main.dvi

Add to Reading List

Source URL: www.disi.unige.it

Language: English - Date: 2012-11-14 06:01:07
31  Chomsky Hierarchy Grammars for each task

1 Chomsky Hierarchy Grammars for each task

Add to Reading List

Source URL: courses.engr.illinois.edu

Language: English - Date: 2013-03-26 15:21:23
4Towards more complex grammar systems Some basic formal language theory

Towards more complex grammar systems Some basic formal language theory

Add to Reading List

Source URL: cl.indiana.edu

Language: English - Date: 2016-04-13 21:34:30
5CONVERGENCE OF A TIME DISCRETIZATION FOR A CLASS OF NON-NEWTONIAN FLUID FLOW ETIENNE EMMRICH∗ Abstract. The equation describing the non-stationary flow of an incompressible non-Newtonian fluid is approximated by the fu

CONVERGENCE OF A TIME DISCRETIZATION FOR A CLASS OF NON-NEWTONIAN FLUID FLOW ETIENNE EMMRICH∗ Abstract. The equation describing the non-stationary flow of an incompressible non-Newtonian fluid is approximated by the fu

Add to Reading List

Source URL: www.math.tu-berlin.de

Language: English - Date: 2012-02-06 05:31:18
6Second-Order Abstract Categorial Grammars Makoto Kanazawa July 28,

Second-Order Abstract Categorial Grammars Makoto Kanazawa July 28,

Add to Reading List

Source URL: research.nii.ac.jp

Language: English - Date: 2010-06-08 00:58:52
7CS 150 Lecture Slides  Motivation • Automata = abstract computing devices • Turing studied Turing Machines (= computers) before there were any real computers • We will also look at simpler devices than

CS 150 Lecture Slides Motivation • Automata = abstract computing devices • Turing studied Turing Machines (= computers) before there were any real computers • We will also look at simpler devices than

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2015-01-28 19:20:52
8LNCSOn the <TEX>{�hape l}</TEX>-Ary GCD-Algorithm in Rings of Integers

LNCSOn the <TEX>{hape l}</TEX>-Ary GCD-Algorithm in Rings of Integers

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2012-05-30 08:47:23
9Agreeing on efficient emissions reduction: Online appendix∗ Olivier Bos† B´eatrice Roussillon‡

Agreeing on efficient emissions reduction: Online appendix∗ Olivier Bos† B´eatrice Roussillon‡

Add to Reading List

Source URL: bos.u-paris2.fr

Language: English - Date: 2015-08-03 09:53:56
1071  Documenta Math. Hermitian Lattices and Bounds in K -Theory of Algebraic Integers

71 Documenta Math. Hermitian Lattices and Bounds in K -Theory of Algebraic Integers

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2015-07-20 04:49:27