المؤلفون: Adsul, Bharat, Gastin, Paul, Kulkarni, Shantanu, Weil, Pascal

المصدر: In LICS'24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, ACM, 2024, Article No.: 2, Pages 1-13

مصطلحات موضوعية: Computer Science - Formal Languages and Automata Theory, Computer Science - Logic in Computer Science, 68Q10, 68Q45, 68Q70, F.1.1, F.4.1, F.4.3

URL الوصول: http://arxiv.org/abs/2405.11308

المؤلفون: Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal

مصطلحات موضوعية: Mathematics - Group Theory, Mathematics - Combinatorics, 20E07, 20F69, 05A15, 05E16, 05C30

URL الوصول: http://arxiv.org/abs/2311.08021

المؤلفون: Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal

مصطلحات موضوعية: Mathematics - Group Theory, Mathematics - Combinatorics, 20E07, 20F69, 05A15, 05E16, 05C30

URL الوصول: http://arxiv.org/abs/2310.18923

المؤلفون: Roy, Mallika, Ventura, Enric, Weil, Pascal

المصدر: Journal of Group Theory 27:5, 2024, 1059--1089

مصطلحات موضوعية: Mathematics - Group Theory, Computer Science - Computational Complexity, 20E05, 20F10, 68Q17

URL الوصول: http://arxiv.org/abs/2303.14697

المؤلفون: Adsul, Bharat, Gastin, Paul, Sarkar, Saptarshi, Weil, Pascal

المصدر: Logical Methods in Computer Science, Volume 18, Issue 2 (June 28, 2022) lmcs:7504

مصطلحات موضوعية: Computer Science - Formal Languages and Automata Theory

URL الوصول: http://arxiv.org/abs/2105.10897

المؤلفون: Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal

مصطلحات موضوعية: Mathematics - Group Theory, 20E07, 20F69, 05A16, 05E15

URL الوصول: http://arxiv.org/abs/2011.09179

المؤلفون: Adsul, Bharat, Gastin, Paul, Sarkar, Saptarshi, Weil, Pascal

مصطلحات موضوعية: Computer Science - Formal Languages and Automata Theory

URL الوصول: http://arxiv.org/abs/2007.07940

المؤلفون: Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal

المصدر: International Journal of Algebra and Computation, 31:08 (2021), pages 1691-1751

مصطلحات موضوعية: Mathematics - Group Theory, Mathematics - Combinatorics, 20E07, 05A16, 05E15

URL الوصول: http://arxiv.org/abs/2004.00437

المؤلفون: Kharlampovich, Olga, Weil, Pascal

المصدر: In Fields of Logic and Computation III -- Essays dedicated to Yuri Gurevich on the occasion of his 80th birthday, Lecture Notes in Computer Science 12180, Springer, 2020

مصطلحات موضوعية: Mathematics - Group Theory, 20F65

URL الوصول: http://arxiv.org/abs/1908.03525

المؤلفون: Place, Thomas, Ramanathan, Varun, Weil, Pascal

المصدر: Logical Methods in Computer Science, Volume 15, Issue 2 (May 8, 2019) lmcs:4501

مصطلحات موضوعية: Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory

URL الوصول: http://arxiv.org/abs/1804.08883

المؤلفون: Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal

المصدر: Chapter 2 In Complexity and Randomness in Group Theory - GAGTA Book 1, de Gruyter, 2020

مصطلحات موضوعية: Mathematics - Group Theory

URL الوصول: http://arxiv.org/abs/1702.01942

المؤلفون: Adsul, Bharat, Gastin, Paul, Sarkar, Saptarshi, Weil, Pascal

المساهمون: Indian Institute of Technology Bombay (IIT Bombay), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Research Lab in Computer Science (ReLaX), Institute of Mathematical Sciences Chennai (IMSc)-Chennai Mathematical Institute Inde -Université de Bordeaux (UB)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)

المصدر: 33rd International Conference on Concurrency Theory, {CONCUR} 2022, LIPIcs
33rd International Conference on Concurrency Theory (CONCUR 2022)
https://hal.science/hal-03770358
33rd International Conference on Concurrency Theory (CONCUR 2022), Sep 2022, Warszawa, Poland. pp.28:1-28:19, ⟨10.4230/LIPIcs.CONCUR.2022.28⟩

مصطلحات موضوعية: 2012 ACM Subject Classification Theory of computation → Concurrency, Theory of computation → Modal and temporal logics, Theory of computation → Algebraic language theory phrases Mazurkiewicz traces, propositional dynamic logic, regular trace languages, asynchronous automata, cascade product, Krohn Rhodes theorem, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

جغرافية الموضوع: Warszawa, Poland

Relation: hal-03770358; https://hal.science/hal-03770358; https://hal.science/hal-03770358/document; https://hal.science/hal-03770358/file/2022-09%20CONCUR.pdf

الاتاحة: https://hal.science/hal-03770358
https://hal.science/hal-03770358/document
https://hal.science/hal-03770358/file/2022-09%20CONCUR.pdf
https://doi.org/10.4230/LIPIcs.CONCUR.2022.28

المؤلفون: Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal

المصدر: Contemporary Mathematics 677 (2016) 1-44

مصطلحات موضوعية: Mathematics - Group Theory, Computer Science - Discrete Mathematics, Mathematics - Combinatorics

URL الوصول: http://arxiv.org/abs/1507.01088

المؤلفون: Roy, Mallika, Ventura, Enric, Weil, Pascal

المصدر: Journal of Group Theory; Sep2024, Vol. 27 Issue 5, p1059-1089, 31p

مصطلحات موضوعية: ALGORITHMS, TREES

المؤلفون: Delgado Rodríguez, Jordi, Ventura Capell, Enric, Weil, Pascal

المساهمون: Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

مصطلحات موضوعية: Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups, Group theory, Grups, Teoria de

وصف الملف: 1107 p.; application/pdf

Relation: Delgado, J.; Ventura, E.; Weil, P. Stallings automata and applications : BGSMath graduate course. 2023. DOI 10.13140/RG.2.2.31871.69281/1.; https://enric-ventura.staff.upc.edu/ventura/files/BGSMath-1-2-23.pdf; http://hdl.handle.net/2117/395113

الاتاحة: http://hdl.handle.net/2117/395113
https://enric-ventura.staff.upc.edu/ventura/files/BGSMath-1-2-23.pdf
https://doi.org/10.13140/RG.2.2.31871.69281/1

المؤلفون: Straubing, Howard, Weil, Pascal

المصدر: Chapter 16 in Handbook of Automata Theory (Jean-Eric Pin ed.), EMS Publishing, 2021

مصطلحات موضوعية: Computer Science - Formal Languages and Automata Theory, 68Q70, 20M07, F.4.3

URL الوصول: http://arxiv.org/abs/1502.03951

المؤلفون: Kharlampovich, Olga, Miasnikov, Alexei, Weil, Pascal

المصدر: Journal of Algebra 488 (2017) 442-483

مصطلحات موضوعية: Mathematics - Group Theory, 20E07, 20F10, 20F67

URL الوصول: http://arxiv.org/abs/1408.1917

المؤلفون: Weil, Pascal

مصطلحات موضوعية: Computer Science - Formal Languages and Automata Theory, Computer Science - Logic in Computer Science

URL الوصول: http://arxiv.org/abs/1406.1035

المؤلفون: Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics, Roy, Mallika, Ventura Capell, Enric, Weil, Pascal

مصطلحات الفهرس: Àrees temàtiques de la UPC::Matemàtiques i estadística, Classificació AMS::68 Computer science::68W Algorithms, Article

URL: http://hdl.handle.net/2117/410020
https://www.degruyter.com/document/doi/10.1515/jgth-2023-0050/html
https://www.degruyter.com/document/doi/10.1515/jgth-2023-0050/html

المؤلفون: Adsul, Bharat, Gastin, Paul, Sarkar, Saptarshi, Weil, Pascal

المساهمون: Indian Institute of Technology Bombay (IIT Bombay), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Research Lab in Computer Science (ReLaX), Institute of Mathematical Sciences Chennai (IMSc)-Chennai Mathematical Institute Inde -Université de Bordeaux (UB)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)

المصدر: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.science/hal-03709692 ; Logical Methods in Computer Science, 2022, ⟨10.46298/LMCS-18(2:22)2022⟩

مصطلحات موضوعية: Mazurkiewicz traces, asynchronous automata, wreath product, cascade product, Krohn Rhodes decomposition theorem, local temporal logic over traces, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.0: Algebraic language theory, [INFO]Computer Science [cs]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2105.10897; hal-03709692; https://hal.science/hal-03709692; https://hal.science/hal-03709692/document; https://hal.science/hal-03709692/file/2105.10897.pdf; ARXIV: 2105.10897

الاتاحة: https://hal.science/hal-03709692
https://hal.science/hal-03709692/document
https://hal.science/hal-03709692/file/2105.10897.pdf
https://doi.org/10.46298/LMCS-18(2:22)2022