Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Paper Parallel RAMs with owned global memory and deterministic context-free language recognition 2003-06-25 Paper https://portal.mardi4nfdi.de/entity/Q4536961...
    10 bytes (18 words) - 02:16, 9 December 2023
  • Counting is easy 1988-01-01 Paper A simplified lower bound for context-free-language recognition 1986-01-01 Paper Time-space-optimal string matching 1983-01-01...
    10 bytes (18 words) - 22:07, 12 December 2023
  • Type Parallel RAMs with owned global memory and deterministic context-free language recognition 2003-06-25 Paper https://portal.mardi4nfdi.de/entity/Q2728891...
    10 bytes (19 words) - 11:08, 24 September 2023
  • de/entity/Q5536282 1967-01-01 Paper On Memory Requirements for Context-Free Language Recognition 1967-01-01 Paper https://portal.mardi4nfdi.de/entity/Q5583856...
    10 bytes (17 words) - 11:01, 12 December 2023
  • Unsolvability of the Recognition of Linear Context-Free Languages 1966-01-01 Paper A New Normal-Form Theorem for Context-Free Phrase Structure Grammars 1965-01-01...
    10 bytes (18 words) - 22:56, 12 December 2023
  • Natural language parsing 2021-11-12 Paper A derivational model of discontinuous parsing 2021-07-21 Paper Non-self-embedding linear context-free tree grammars...
    10 bytes (19 words) - 14:33, 8 December 2023
  • permutations by context-free grammars in Chomsky normal form 2006-04-28 Paper Fuzzy context-free languages. I: Generalized fuzzy context-free grammars 2005-12-29...
    10 bytes (20 words) - 07:52, 7 October 2023
  • 1975-01-01 Paper Reduction of context-free grammars 1970-01-01 Paper A note on computing time for the recognition of context-free languages by a single-tape Turing...
    10 bytes (16 words) - 10:58, 13 December 2023
  • de/entity/Q4028106 1993-03-28 Paper It is decidable whether a regular language is pure context-free 1983-01-01 Paper On form-equivalence of deterministic pure grammar...
    10 bytes (16 words) - 17:11, 12 December 2023
  • programming and context-free recognition 2022-08-18 Paper Speeding up two string-matching algorithms 2022-08-18 Paper Parallel recognition and ranking of...
    10 bytes (17 words) - 18:22, 9 December 2023
  • systems 1990-01-01 Paper Hierarchy of k-context-free languages part 1 1989-01-01 Paper Hierarchy ofk-context-free languages 1989-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (18 words) - 21:30, 9 December 2023
  • possessing a complete set 2022-11-09 Paper Parallel recognition and ranking of context-free languages 2022-08-18 Paper Parallel complexity of iterated morphisms...
    10 bytes (18 words) - 16:17, 9 December 2023
  • of non-context-free languages 1992-09-27 Paper An efficient all-parses systolic algorithm for general context-free parsing 1990-01-01 Paper An Optimal Linear-Time...
    10 bytes (18 words) - 10:32, 6 October 2023
  • lengthening: language theoretic and algorithmic results 2016-01-28 Paper A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages 2015-04-17...
    10 bytes (19 words) - 12:20, 9 December 2023
  • a symbol in words of regular languages. 2003-08-17 Paper Random Generation for Finitely Ambiguous Context-free Languages 2002-09-18 Paper https://portal...
    10 bytes (16 words) - 22:33, 10 December 2023
  • 1973-01-01 Paper Context-sensitive immediate constituent analysis: Context-free languages revisited 1973-01-01 Paper Language recognition by marking automata...
    10 bytes (18 words) - 09:22, 25 September 2023
  • subgroups of direct products of surface groups. 2002-09-18 Paper Context-free languages of sub-exponential growth 2002-08-04 Paper Length functions, curvature...
    10 bytes (19 words) - 17:37, 7 December 2023
  • Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages 1977-01-01 Paper Theory of \(\omega\)-languages. II: A study of various...
    10 bytes (18 words) - 09:55, 13 December 2023
  • picture languages 2019-10-18 Paper Some computational limits of trellis automata 2018-03-08 Paper Recognition of poly-slender context-free languages by trellis...
    10 bytes (16 words) - 12:17, 6 October 2023
  • Linear Conjunctive Languages to Subfamilies of the Context-Free Languages 2011-02-15 Paper A simple P-complete problem and its language-theoretic representations...
    10 bytes (17 words) - 09:17, 25 September 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)