Search Results - "ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation"
-
1
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-03911564 ; 2023.
Subject Terms: ACM: C.: Computer Systems Organization/C.1: PROCESSOR ARCHITECTURES/C.1.3: Other Architecture Styles/C.1.3.7: Neural nets, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.4: Self-modifying machines (e.g., neural networks), ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.6: Learning, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, ACM: I.: Computing Methodologies/I.6: SIMULATION AND MODELING/I.6.5: Model Development, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing
-
2
Authors:
Contributors:
Source: https://hal.science/hal-03939545 ; 2023.
Subject Terms: Complexity Classes, Completeness, Polynomial Time, Reduction, Logarithmic Space, Computational Algorithm, 68Q15, 68Q17, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.2: Reducibility and completeness, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.3: Relations among complexity classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: hal-03939545; https://hal.science/hal-03939545; https://hal.science/hal-03939545v11/document; https://hal.science/hal-03939545v11/file/micopam2023%28NP%29.pdf
-
3
Authors: et al.
Contributors: et al.
Source: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.science/hal-03114304 ; Logical Methods in Computer Science, 2022, 18 (3), pp.14:1-14:34. ⟨10.46298/lmcs-18(3:14)2022⟩ ; https://lmcs.episciences.org/9882
Subject Terms: Programs over monoids, Tameness, DA, Lower bounds, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.0: Algebraic language theory, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2101.07495; hal-03114304; https://hal.science/hal-03114304; https://hal.science/hal-03114304v3/document; https://hal.science/hal-03114304v3/file/Tameness_and_power_programs_over_DA-Published_version.pdf; ARXIV: 2101.07495
-
4
Authors:
Contributors:
Source: https://hal.science/hal-02977750 ; 2022.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, Realizability semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; ARXIV: 2012.04752
-
5
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-03911564 ; 2022.
Subject Terms: ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.6: Learning, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.4: Self-modifying machines (e.g., neural networks), ACM: C.: Computer Systems Organization/C.1: PROCESSOR ARCHITECTURES/C.1.3: Other Architecture Styles/C.1.3.7: Neural nets, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: I.: Computing Methodologies/I.6: SIMULATION AND MODELING/I.6.5: Model Development, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing
Relation: hal-03911564; https://hal.archives-ouvertes.fr/hal-03911564; https://hal.archives-ouvertes.fr/hal-03911564/document; https://hal.archives-ouvertes.fr/hal-03911564/file/AliBERT_For_Submission.pdf
-
6
Authors: et al.
Contributors: et al.
Source: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands
Subject Terms: reachability, FIFO, termination, Infinite state systems, complexity, flat systems, counters, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Subject Geographic: AMSTERDAM, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1908.07282; ARXIV: 1908.07282
-
7
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Design Automation of Electronic Systems. 22:1-25
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Scheduling, Latency, Dataflow graphs, 0202 electrical engineering, electronic engineering, information engineering, Symbolic analysis, 02 engineering and technology, Throughput, ACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]
-
8
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/hal-03495883 ; [Research Report] RR-9439, Inria Grenoble Rhône-Alpes, Université de Grenoble. 2021.
Subject Terms: Models of computation, Synchronous dataflow, Reconfigurable systems, Graph rewriting, Static analyses, Boundedness, Liveness, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.5: Program analysis, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming/D.1.3.1: Parallel programming, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
-
9
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02895111 ; 2021.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2007.16077; ARXIV: 2007.16077
-
10
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02487667 ; 2021.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.3: Relations among complexity classes, ACM: G.: Mathematics of Computing, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.10888; ARXIV: 2002.10888
-
11
Authors:
Contributors:
Source: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, Realizability semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750v6/document; https://hal.archives-ouvertes.fr/hal-02977750v6/file/main.pdf; ARXIV: 2012.04752
-
12
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-03114304 ; 2021.
Subject Terms: Programs over monoids, Tameness, Lower bounds, DA, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.0: Algebraic language theory, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2101.07495; hal-03114304; https://hal.archives-ouvertes.fr/hal-03114304; https://hal.archives-ouvertes.fr/hal-03114304/document; https://hal.archives-ouvertes.fr/hal-03114304/file/Tameness_and_power_programs_over_DA-Published_version.pdf; ARXIV: 2101.07495
-
13
Authors:
Contributors:
Source: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750v4/document; https://hal.archives-ouvertes.fr/hal-02977750v4/file/main.pdf; ARXIV: 2012.04752
-
14
Authors: et al.
Contributors: et al.
Source: ISAAC 2018 - 29th International Symposium on Algorithms and Computation ; https://hal.science/hal-01998850 ; ISAAC 2018 - 29th International Symposium on Algorithms and Computation, Dec 2018, Jiaoxi, Taiwan. ⟨10.4230/LIPIcs.ISAAC.2018.23⟩
Subject Terms: Turing Universality, Molecular folding, Tag System, DNA Computing, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
-
15
Authors: et al.
Contributors: et al.
Source: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.science/hal-01593160 ; Logical Methods in Computer Science, 2019, ⟨10.23638/LMCS-15(2:9)2019⟩
Subject Terms: automatic topology, finer topologies, Cantor space, infinite words, logic in computer science, Automata and formal languages, space of infinite labelled binary trees, Muller tree automaton, Polish topology, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1710.04002; ARXIV: 1710.04002
-
16
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-02487667 ; 2020.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.3: Relations among complexity classes, ACM: G.: Mathematics of Computing, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.10888; hal-02487667; https://hal.archives-ouvertes.fr/hal-02487667; https://hal.archives-ouvertes.fr/hal-02487667/document; https://hal.archives-ouvertes.fr/hal-02487667/file/versionHAL.pdf; ARXIV: 2002.10888
-
17
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-02895111 ; 2020.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2007.16077; hal-02895111; https://hal.archives-ouvertes.fr/hal-02895111; https://hal.archives-ouvertes.fr/hal-02895111v2/document; https://hal.archives-ouvertes.fr/hal-02895111v2/file/main-HAL.pdf; ARXIV: 2007.16077
-
18
Authors:
Contributors:
Source: https://hal.archives-ouvertes.fr/hal-02977750 ; 2020.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750v2/document; https://hal.archives-ouvertes.fr/hal-02977750v2/file/main.pdf
-
19
Authors: et al.
Contributors: et al.
Source: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
https://hal.science/hal-02303526
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. pp.2:1-2:20, ⟨10.4230/LIPIcs.MFCS.2017.2⟩Subject Terms: lower-bounds, DA, Programs over monoids, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
-
20
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics (LIPIcs) ; The 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)) ; https://hal.science/hal-01587616 ; The 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)), 2017, Varsovie, Poland. ⟨10.4230/LIPIcs.ICALP.2017.117⟩
Subject Terms: separability problem, Parikh automata, integer vector addition systems, visible one counter automata, decidability, undecidability, ACM: D.: Software, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.2: Design Tools and Techniques, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Nájsť tento článok vo Web of Science 
Full Text Finder