Cover Image
Read Now

The Mathematics of Language 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers

Bibliographic Details
Other Authors: Ebert, Christian (Editor), Jäger, Gerhard (Editor), Michaelis, Jens (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010, 2010
Edition:1st ed. 2010
Series:Lecture Notes in Artificial Intelligence
Subjects:
Compilers (computer Programs)
Compilers And Interpreters
Symbolic And Algebraic Manipulation
Programming Techniques
Computer Science
Computer Science / Mathematics
Computer Programming
Discrete Mathematics In Computer Science
Formal Languages And Automata Theory
Machine Theory
Discrete Mathematics
Theory Of Computation
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02885nmm a2200409 u 4500
001 EB000384842
003 EBX01000000000000000237894
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783642143229 
100 1 |a Ebert, Christian  |e [editor] 
245 0 0 |a The Mathematics of Language  |h Elektronische Ressource  |b 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers  |c edited by Christian Ebert, Gerhard Jäger, Jens Michaelis 
250 |a 1st ed. 2010 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010, 2010 
300 |a VIII, 297 p. 55 illus  |b online resource 
505 0 |a Dependency Structures Derived from Minimalist Grammars -- Deforesting Logical Form -- On the Probability Distribution of Typological Frequencies -- A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus -- LC Graphs for the Lambek Calculus with Product -- Proof-Theoretic Semantics for a Natural Language Fragment -- Some Interdefinability Results for Syntactic Constraint Classes -- Sortal Equivalence of Bare Grammars -- Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian Semantics -- On Monadic Second-Order Theories of Multidominance Structures -- The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars -- A Formal Foundation for A and A-bar Movement -- Without Remnant Movement, MGs Are Context-Free -- The Algebra of Lexical Semantics -- Phonological Interpretation into Preordered Algebras -- Relational Semantics for the Lambek-Grishin Calculus -- Intersecting Adjectives in Syllogistic Logic -- Creation Myths of GenerativeGrammar and the Mathematics of Syntactic Structures -- On Languages Piecewise Testable in the Strict Sense -- A Note on the Complexity of Abstract Categorial Grammars -- Almost All Complex Quantifiers Are Simple -- Constituent Structure Sets I. 
653 |a Compilers (Computer programs) 
653 |a Compilers and Interpreters 
653 |a Symbolic and Algebraic Manipulation 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Computer science / Mathematics 
653 |a Computer programming 
653 |a Discrete Mathematics in Computer Science 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Discrete mathematics 
653 |a Theory of Computation 
700 1 |a Jäger, Gerhard  |e [editor] 
700 1 |a Michaelis, Jens  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Lecture Notes in Artificial Intelligence 
028 5 0 |a 10.1007/978-3-642-14322-9 
856 4 0 |u https://doi.org/10.1007/978-3-642-14322-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.45 

Similar Items