Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

نتائج البحث

Display Settings
النتائج لكل صفحة: 10
Sort By: Relevance
Filter
  • 1-10 ل  106 نتائج ل ""[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]""

فلترة النتائج

Subject : [info.info-fl]computer science [cs]/formal languages and automata theory [cs.fl]
إعادة تعيين خيارات الفبترة
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Report

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages

Subjects: Visibly Pushdown Languages; Circuit Complexity; AC0

  • Source: https://hal.science/hal-04005294 ; 2023.

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Regular Matching and Inclusion on Compressed Tree Patterns with Constrained Context Variables

Subjects: tree patterns; tree automata; computational complexity

  • Source: ISSN: 0890-5401.

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Academic Journal

The complexity gap in the static analysis of cache accesses grows if procedure calls are added

Subjects: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]; [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]; [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR]

  • Source: ISSN: 0925-9856.

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Tameness and the power of programs over monoids in DA

Subjects: Programs over monoids; Tameness; DA

  • Source: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.science/hal-03114304 ; Logical Methods

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Dissertation/ Thesis

Mathematical Informatics ; Mathematical Informatics: Outline of a mathematical theory of computer science

Subjects: Mathematical Informatics; Dynamical systems; Complexity theory

  • Source: https://theses.hal.science/tel-04616661 ; Discrete Mathematics [cs.DM]. Université Sorbonne Paris Nord, 2024.

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Conference

Symbolic model checking for probabilistic dynamic epistemic logic ; Vérification symbolique de modèles pour la logique épistémique dynamique probabiliste

Subjects: Planification; Kripke structures; PDELBordeaux; France

  • Source: Journées Francophones Planification, Décision et Apprentissage (PFIA) 2021 ; https://hal.science/hal-03664513 ; Journées Francophones Planification, Décision et

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Conference

Linear high-order deterministic tree transducers with regular look-ahead

Subjects: Tree lanuages; λ-calculus; TransducersPrague; Czech Republic

  • Source: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)MFCS 2020 : The 45th International Symposium

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Conference

The Power of Programs over Monoids in J

Subjects: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]; [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Milan; Italy

  • Source: LATA 2020 - 14th International Conference on Language and Automata Theory and Applications ; https://hal.archives-ouvertes.fr/hal-02414771 ; LATA 2020 - 14th International Conference on Language and

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Regular Matching and Inclusion on Compressed Tree Patterns with Constrained Context Variables

Subjects: grammar compression; Xml; streams

  • Source: ISSN: 0890-5401.

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
Conference

Evaluating the complexity of deriving adaptive homing, synchronizing and distinguishing sequences for nondeterministic FSMs

Subjects: Nondeterministic Finite State Machine (FSM); Adaptive homing sequence; Adaptive synchronizing sequenceParis; France

  • Source: Lecture Notes in Computer Science ; ICTSS 2019: 31st IFIP International Conference on Testing Software and Systems ; https://hal.

تفاصيل العنوان

اقرأ أكثر حفظ في قائمتي
×
  • 1-10 ل  106 نتائج ل ""[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]""