scientific article
From MaRDI portal
Publication:3409073
zbMath1104.03019MaRDI QIDQ3409073
Publication date: 8 November 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Logic of natural languages (03B65) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Linguistics (91F20)
Related Items (21)
Partial algebras, meaning categories and algebraization ⋮ Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power ⋮ Computation in networks of passively mobile finite-state sensors ⋮ Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars ⋮ A context-free language for binary multinomial processing tree models ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ Inverse images of box formulas in modal logic ⋮ A step towards absolute versions of metamathematical results ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Learning Left-to-Right and Right-to-Left Iterative Languages ⋮ LR parsing for LCFRS ⋮ AGGREGATION AND IDEMPOTENCE ⋮ The failure of the strong pumping lemma for multiple context-free languages ⋮ Geometric representations for minimalist grammars ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ Stack and register complexity of radix conversions ⋮ Reasoning with ambiguity ⋮ Inessential features, ineliminable features, and modal logics for model theoretic syntax ⋮ The Pumping Lemma for Well-Nested Multiple Context-Free Languages ⋮ The Proper Treatment of Linguistic Ambiguity in Ordinary Algebra ⋮ Modal logics that are both monotone and antitone: Makinson's extension results and affinities between logics
This page was built for publication:
