Search results
From MaRDI portal
- space; algorithmic metatheorems; Courcelle's theorem; tree depth; circuit classes Mathematics Subject Classification ID 68Q25: Analysis of algorithms and...15 bytes (92 words) - 07:42, 1 February 2024
- calculational logic; calculational approach to logic; formal development of algorithms; metatheorem Witness; treating undefined terms Mathematics Subject Classification...15 bytes (45 words) - 00:40, 7 February 2024
- in computer science 68P05: Data structures Related Items Unnamed Item, Algorithmic uses of the Feferman-Vaught theorem, Characterization and complexity of...15 bytes (156 words) - 14:35, 5 February 2024
- tree-depth; neighborhood diversity; metatheorems; fair problems Mathematics Subject Classification ID 68W05: Nonnumerical algorithms 68R10: Graph theory (including...15 bytes (83 words) - 15:14, 2 May 2024
- complexity; neighborhood diversity; metatheorem; MSO extensions Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 68R10:...15 bytes (79 words) - 14:48, 2 May 2024
- Complexity-class-encoding sets, Complexity metatheorems for context-free grammar problems, Some applications of the McCreight-Meyer algorithm in abstract complexity theory...15 bytes (313 words) - 05:08, 7 March 2024
- Publication date: 1975 Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 68Q45: Formal languages and automata Related Items...15 bytes (68 words) - 10:19, 6 February 2024
- Publication date: 1976 Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 68Q45: Formal languages and automata 68N01: General...15 bytes (72 words) - 10:39, 6 February 2024
- Recursively indefinite databases, Metatheorems for decision problems on hyperedge replacement graph languages, Algorithms for graph problems on BNLC structured...15 bytes (103 words) - 14:50, 5 February 2024
- of graph enumeration problems definable in monadic second-order logic, Algorithmic uses of the Feferman-Vaught theorem, The monadic second-order logic of...15 bytes (471 words) - 04:30, 8 February 2024
- (digraphs), tournaments Related Items Metatheorems for decision problems on hyperedge replacement graph languages, Algorithms for graph problems on BNLC structured...15 bytes (64 words) - 15:46, 13 March 2024
- covering problems for the regular and context-free languages, Complexity metatheorems for context-free grammar problems, Decidability of trajectory-based equations...15 bytes (103 words) - 11:22, 6 February 2024
- LR(k) testing, Concerning bounded-right-context grammars, Complexity metatheorems for context-free grammar problems, On a method for optimizing LR parsers...15 bytes (140 words) - 06:43, 6 February 2024
- problem for LL- and LR-regular grammars, LL-regular grammars, Complexity metatheorems for context-free grammar problems, On tree transducers for partial functions...15 bytes (265 words) - 07:05, 3 February 2024
- disconnecting or a basic root of the difficulty in graph grammar parsing, Metatheorems for decision problems on hyperedge replacement graph languages, Power...15 bytes (197 words) - 05:48, 31 January 2024
- parsers The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency Complexity metatheorems for context-free grammar...15 bytes (152 words) - 04:14, 8 February 2024
- Brave) zbMATH Keywords parsing; regular context-free grammars; top-down algorithm Mathematics Subject Classification ID 68Q45: Formal languages and automata...15 bytes (124 words) - 10:19, 31 January 2024
- grammars, Metatheorems for decision problems on hyperedge replacement graph languages, Algorithms for graph problems on BNLC structured garphs, Algorithms for...15 bytes (164 words) - 14:28, 5 February 2024
- definition of context-free rewriting and its application to NLC graph grammars Metatheorems for decision problems on hyperedge replacement graph languages On the...15 bytes (239 words) - 14:00, 31 January 2024
- framework for producing compact deterministic parsers. II, Complexity metatheorems for context-free grammar problems, A definition of measures over language...15 bytes (668 words) - 05:12, 7 March 2024
