Suchergebnisse - Theory of computation Formal languages and automation theory Formalisms

Beyond Decisiveness of Infinite Markov Chains

Autoren: Barbot, Benoît Bouyer, Patricia Haddad, Serge et al.

Weitere Verfasser: Barbot, Benoît Bouyer, Patricia Haddad, Serge et al.

Quelle: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)
https://hal.science/hal-04822969
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024), Dec 2024, Gandhinagar, Gujarat, India. pp.8:1-8:22, ⟨10.4230/lipics.fsttcs.2024.8⟩

Schlagwörter: Theory of computation → Concurrency, Mathematics of computing → Markov processes, Numerical and Statistical Verification, Infinite State Systems, Markov Chains, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Geographisches Schlagwort: Gandhinagar, Gujarat, India

Verfügbarkeit: https://hal.science/hal-04822969
https://hal.science/hal-04822969v1/document
https://hal.science/hal-04822969v1/file/LIPIcs.FSTTCS.2024.8.pdf
https://doi.org/10.4230/lipics.fsttcs.2024.8

Correctness by construction and style preserving reconfigurations of system of systems

Autoren: Eichler, Cédric Drira, Khalil Monteil, Thierry et al.

Weitere Verfasser: Eichler, Cédric Drira, Khalil Monteil, Thierry et al.

Quelle: SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing ; SAC 2018: The 33th ACM/SIGAPP Symposium on Applied Computing ; https://hal.science/hal-02652140 ; SAC 2018: The 33th ACM/SIGAPP Symposium on Applied Computing, Apr 2018, Pau, France. pp.1680-1686

Schlagwörter: Rewrite systems, Grammars and context-free languages, Formalisms, Theory of computation, Formal languages and automata theory, [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS]

Geographisches Schlagwort: Pau, France

Verfügbarkeit: https://hal.science/hal-02652140
https://hal.science/hal-02652140v1/document
https://hal.science/hal-02652140v1/file/Eichler_22153.pdf

Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models

Autoren: Donatelli, Susanna Haddad, Serge

Weitere Verfasser: Donatelli, Susanna Haddad, Serge

Quelle: Lecture Notes in Computer Science ISBN: 9783030406073
Language and Automata Theory and Applications

Schlagwörter: Automata Theory, Theory of computation → Formal languages and automata theory, Mathematics of computing → Discrete mathematics, 0202 electrical engineering, electronic engineering, information engineering, Partially observed systems, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Diagnosability, Predictability, 01 natural sciences, Article

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2F978-3-030-40608-0_11.pdf
https://hal.science/hal-04390304v1
https://doi.org/10.1007/978-3-030-40608-0_11
https://europepmc.org/article/PMC/PMC7206655
https://dblp.uni-trier.de/db/conf/lata/lata2020.html#DonatelliH20
https://link.springer.com/chapter/10.1007%2F978-3-030-40608-0_11
https://rd.springer.com/chapter/10.1007/978-3-030-40608-0_11
https://hal.inria.fr/hal-03150821

Cost Automata, Safe Schemes, and Downward Closures

Autoren: Barozzini, David Clemente, Lorenzo Colcombet, Thomas et al.

Weitere Verfasser: Barozzini, David Clemente, Lorenzo Colcombet, Thomas et al.

Quelle: Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020

Schlagwörter: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Theory of computation → Logic and verification, 01 natural sciences, Automata, Regular cost functions, higher-order recursion schemes, Infinite trees, Cost logics, downward closure, safe recursion schemes, cost automata, 0202 electrical engineering, electronic engineering, information engineering, cost logics, ddc:004, Safe scheme, Theory of computation → Rewrite systems, downward closures

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2004.12187
https://fi.episciences.org/8485
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.109
https://hal.science/hal-03105650v1
https://doi.org/10.4230/lipics.icalp.2020.109
https://hal.science/hal-03105650v1/document

Reasoning about Moving Target Defense in Attack Modeling Formalisms

Autoren: Ballot, Gabriel Malvone, Vadim Leneutre, Jean et al.

Weitere Verfasser: Ballot, Gabriel Malvone, Vadim Leneutre, Jean et al.

Quelle: MTD'22: Proceedings of the 9th ACM Workshop on Moving Target Defense ; https://hal.science/hal-04336316 ; MTD'22: Proceedings of the 9th ACM Workshop on Moving Target Defense, Nov 2022, Los Angeles CA USA, United States. pp.55-65, ⟨10.1145/3560828.3564009⟩

Schlagwörter: Security and privacy, Formal methods and theory of security, Systems security, Theory of computation, Formal languages and automata theory, Automata extensions, [INFO]Computer Science [cs]

Geographisches Schlagwort: Los Angeles CA USA, United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2206.14076; ARXIV: 2206.14076

Verfügbarkeit: https://hal.science/hal-04336316
https://doi.org/10.1145/3560828.3564009

Operational Models for Piecewise-Smooth Systems

Autoren: Andrew Sogokon Khalil Ghorbal Taylor T. Johnson et al.

Weitere Verfasser: Andrew Sogokon Khalil Ghorbal Taylor T. Johnson et al.

Quelle: ACM Transactions on Embedded Computing Systems. 16:1-19

Schlagwörter: 0209 industrial biotechnology, discontinuous differential equations, hybrid automata, operational models, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Piecewise-smooth systems, Additional Key Words and Phrases: piecewise-smooth systems, • Computer systems organization → Embedded and cyber-physical systems, Program verification, discon- tinuous differential equations, • Theory of computation → Formalisms, CCS Concepts: • Mathematics of computing → Differential equations, 0101 mathematics, Program semantics, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Dateibeschreibung: application/pdf; text

Zugangs-URL: https://dl.acm.org/doi/pdf/10.1145/3126506
https://dblp.uni-trier.de/db/journals/tecs/tecs16.html#SogokonGJ17
https://hal.inria.fr/hal-01658196/document
https://eprints.soton.ac.uk/434325/
https://dl.acm.org/citation.cfm?doid=3145508.3126506
https://dl.acm.org/doi/10.1145/3126506
https://hal.inria.fr/hal-01658196
https://eprints.soton.ac.uk/434325/

A Linear-Time Nominal $��$-Calculus with Name Allocation

Autoren: Hausmann, Daniel Milius, Stefan Schröder, Lutz et al.

Weitere Verfasser: Hausmann, Daniel Milius, Stefan Schröder, Lutz et al.

Quelle: MFCS 2021: 46th International Symposium on Mathematical Foundations of Computer Science

Schlagwörter: FOS: Computer and information sciences, Model checking, Computer Science - Logic in Computer Science, Theory of computation → Verification by model checking, Formal Languages and Automata Theory (cs.FL), 4. Education, 1. No poverty, Computer Science - Formal Languages and Automata Theory, Logic in Computer Science (cs.LO), linear-time logic, 8. Economic growth, nominal sets, Theory of computation → Modal and temporal logics, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2010.10912
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.58

Logical forms of chronicles

Autoren: Guyet, Thomas Markey, Nicolas Artificial Evolution and Computational Biology (BEAGLE) et al.

Weitere Verfasser: Guyet, Thomas Markey, Nicolas Artificial Evolution and Computational Biology (BEAGLE) et al.

Quelle: Leibniz International Proceedings in Informatics ; TIME 2022 - 29th International Symposium on Temporal Representation and Reasoning ; https://hal.science/hal-03777471 ; TIME 2022 - 29th International Symposium on Temporal Representation and Reasoning, Nov 2022, Virtual, Heard & McDonald Islands. pp.1-15

Schlagwörter: temporal logics, temporal models, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geographisches Schlagwort: Virtual, Heard & McDonald Islands

Verfügbarkeit: https://hal.science/hal-03777471
https://hal.science/hal-03777471v2/document
https://hal.science/hal-03777471v2/file/chronicleMTL_TIME22.pdf

Grammatical Theory

Autoren: Müller, Stefan

Resource Type: eBook.

Schlagworte: Language acquisition, Language and languages--Study and teaching, Germanic languages--Syntax, Computational linguistics, Grammar, Comparative and general, Generative grammar, Government (Grammar)

Categories: LANGUAGE ARTS & DISCIPLINES / Linguistics / General

Learning nominal regular languages with binders

Autoren: Xiao, Yi

Schlagwörter: 006.3, Theories, language, automata, machine learning

Zugangs-URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.798214

Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages

Autoren: Butoi, Alexandra Vieira, Tim Cotterell, Ryan et al.

Weitere Verfasser: Butoi, Alexandra Vieira, Tim Cotterell, Ryan et al.

Quelle: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computation and Language, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Computation and Language (cs.CL)

Dateibeschreibung: application/application/pdf

Zugangs-URL: http://arxiv.org/abs/2310.15276
http://hdl.handle.net/20.500.11850/650682

Convergence and Diversity in the Control Hierarchy

Autoren: Butoi, Alexandra Cotterell, Ryan Chiang, David et al.

Weitere Verfasser: Butoi, Alexandra Cotterell, Ryan Chiang, David et al.

Quelle: Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computation and Language, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Computation and Language (cs.CL)

Dateibeschreibung: application/application/pdf

Zugangs-URL: http://arxiv.org/abs/2306.03628
http://hdl.handle.net/20.500.11850/650668

A Unifying Theory of Transition-based and Sequence Labeling Parsing

Autoren: Gómez-Rodríguez, Carlos Strzyz, Michalina Vilares, David

Quelle: Proceedings of the 28th International Conference on Computational Linguistics

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computation and Language, Formal Languages and Automata Theory (cs.FL), I.2.7, F.4.3, 68T50, 68Q45, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, Computation and Language (cs.CL)

Zugangs-URL: https://www.aclweb.org/anthology/2020.coling-main.336.pdf
http://arxiv.org/abs/2011.00584
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-00584
https://www.aclweb.org/anthology/2020.coling-main.336/
https://www.aclweb.org/anthology/2020.coling-main.336.pdf
https://aclanthology.org/2020.coling-main.336/

Verification of programs with ADTs using Shallow Horn Clauses

Autoren: Losekoot, Théo Genet, Thomas Jensen, Thomas

Weitere Verfasser: Losekoot, Théo Genet, Thomas Jensen, Thomas

Schlagwörter: Algebraic datatypes, Formal verification, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], [INFO] Computer Science [cs], Model inference, Relational properties, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Dateibeschreibung: application/pdf

Zugangs-URL: https://inria.hal.science/hal-04820358v1

Integrating Supertag Features into Neural Discontinuous Constituent Parsing

Autoren: Mielczarek, Lukas

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computation and Language, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Computation and Language (cs.CL)

Zugangs-URL: http://arxiv.org/abs/2410.08766

A theory of reversibility for Erlang

Autoren: Ivan Lanese Naoki Nishida Adrián Palacios et al.

Weitere Verfasser: Ivan Lanese Naoki Nishida Adrián Palacios et al.

Quelle: RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Universitat Politècnica de València (UPV)
instname

Schlagwörter: reversible computation, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Programming Languages, Reversibility, Erlang, Concurrency, Reversible computation, Rollback recovery, 0102 computer and information sciences, 02 engineering and technology, actor model, 16. Peace & justice, 01 natural sciences, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], Logic in Computer Science (cs.LO), rollback recovery $, Concurrency, 0202 electrical engineering, electronic engineering, information engineering, concurrency, Actor model, LENGUAJES Y SISTEMAS INFORMATICOS, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Programming Languages (cs.PL)

Dateibeschreibung: application/pdf

Zugangs-URL: https://riunet.upv.es/bitstream/10251/145737/3/Lanese%3bNishida%3bPalacios%20-%20A%20theory%20of%20reversibility%20for%20Erlang.pdf
http://arxiv.org/abs/1806.07100
https://riunet.upv.es/handle/10251/145737
https://inria.hal.science/hal-01912856v1/document
https://inria.hal.science/hal-01912856v1
https://doi.org/10.1016/j.jlamp.2018.06.004
https://hal.univ-cotedazur.fr/hal-01912856v1
https://dblp.uni-trier.de/db/journals/corr/corr1806.html#abs-1806-07100
https://hal.inria.fr/hal-01912856/document
https://riunet.upv.es/bitstream/10251/145737/3/Lanese%3bNishida%3bPalacios%20-%20A%20theory%20of%20reversibility%20for%20Erlang.pdf
https://riunet.upv.es/handle/10251/145737
https://cris.unibo.it/handle/11585/674989
https://hdl.handle.net/10251/145737
https://doi.org/10.1016/j.jlamp.2018.06.004
https://hdl.handle.net/11585/674989
https://doi.org/10.1016/j.jlamp.2018.06.004

Structured Thoughts Automaton: First Formalized Execution Model for Auto-Regressive Language Models

Autoren: Vanderbruggen, Tristan Liao, Chunhua Pirkelbauer, Peter et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Computation and Language, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Computation and Language (cs.CL), Machine Learning (cs.LG)

Zugangs-URL: http://arxiv.org/abs/2306.10196

Grammatical Theory

Autoren: Müller, Stefan

Resource Type: eBook.

Schlagworte: Language arts

Categories: LANGUAGE ARTS & DISCIPLINES / Linguistics / General

Formalism for Supporting the Development of Verifiably Safe Medical Guidelines with Statecharts

Autoren: Guo, Chunhui Fu, Zhicheng Zhang, Zhenyu et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Computation and Language, Computer Science - Programming Languages, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, 3. Good health, Logic in Computer Science (cs.LO), Software Engineering (cs.SE), Computer Science - Software Engineering, 0202 electrical engineering, electronic engineering, information engineering, Computation and Language (cs.CL), Programming Languages (cs.PL)

Zugangs-URL: http://arxiv.org/abs/1909.10493

A semantic framework for PEGs

Autoren: Sérgio Queiroz de Medeiros Carlos Olarte Olarte, Carlos

Weitere Verfasser: Sérgio Queiroz de Medeiros Carlos Olarte Olarte, Carlos

Quelle: Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering. :230-245

Schlagwörter: FOS: Computer and information sciences, Computer Science - Programming Languages, D.3.4, Formal Languages and Automata Theory (cs.FL), [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], F.4.3, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Formal Languages and Automata Theory, F.4.2, 02 engineering and technology, Programming Languages (cs.PL)

Zugangs-URL: http://arxiv.org/pdf/2011.04360
http://arxiv.org/abs/2011.04360
https://hal.science/hal-03568013v1
https://doi.org/10.1145/3426425.3426944
https://arxiv.org/pdf/2011.04360
https://arxiv.org/abs/2011.04360
http://ui.adsabs.harvard.edu/abs/2020arXiv201104360M/abstract