The n-ary initial literal and literal shuffle

Συγγραφείς: Stefan Hoffmann

Πηγή: Discrete Applied Mathematics. 376:112-132

Θεματικοί όροι: FOS: Computer and information sciences, F.4.3, D.1.3, Computer Science - Distributed, Parallel, and Cluster Computing, Formal Languages and Automata Theory (cs.FL), 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, Distributed, Parallel, and Cluster Computing (cs.DC), 01 natural sciences, 68Q45 (Primary) 68Q85 (Secondary)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2108.09282

The Target Discounted-Sum Problem

Συγγραφείς: Boker, Udi, Henzinger, Thomas A., Otop, Jan

Θεματικοί όροι: Formal Languages and Automata Theory, F.4.3; G.2.m

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.22979

Extended branching Rauzy induction

Συγγραφείς: Dolce, Francesco, Hughes, Christian B.

Θεματικοί όροι: Formal Languages and Automata Theory, Discrete Mathematics, Dynamical Systems, 37B10, 37E05, 68R15

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.22588

General Decidability Results for Systems with Continuous Counters

Συγγραφείς: Balasubramanian, A. R., Hague, Matthew, Majumdar, Rupak, Thinniyam, Ramanathan S., Zetzsche, Georg

Θεματικοί όροι: Formal Languages and Automata Theory, Logic in Computer Science

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.21559

Softmax Transformers are Turing-Complete

Συγγραφείς: Jiang, Hongjian, Hahn, Michael, Zetzsche, Georg, Lin, Anthony Widjaja

Θεματικοί όροι: Formal Languages and Automata Theory, Machine Learning, Logic in Computer Science

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.20038

Parameterized Verification of Quantum Circuits (Technical Report)

Συγγραφείς: Abdulla, Parosh Aziz, Chen, Yu-Fang, Hečko, Michal, Holík, Lukáš, Lengál, Ondřej, Lin, Jyun-Ao, Thinniyam, Ramanathan Srinivasan

Θεματικοί όροι: Logic in Computer Science, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.19897

HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs

Συγγραφείς: Ospanov, Azim, Feng, Zijin, Sun, Jiacheng, Bai, Haoli, Shen, Xin, Farnia, Farzan

Θεματικοί όροι: Artificial Intelligence, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.18760

ObjectAlign: Neuro-Symbolic Object Consistency Verification and Correction

Συγγραφείς: Munir, Mustafa, Goel, Harsh, Wei, Xiwen, Choi, Minkyu, Shah, Sahil, Bhardwaj, Kartikeya, Whatmough, Paul, Chinchali, Sandeep, Marculescu, Radu

Θεματικοί όροι: Computer Vision and Pattern Recognition, Artificial Intelligence, Formal Languages and Automata Theory, Machine Learning

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.18701

Extracting Robust Register Automata from Neural Networks over Data Sequences

Συγγραφείς: Hong, Chih-Duo, Jiang, Hongjian, Lin, Anthony W., Markgraf, Oliver, Parsert, Julian, Tan, Tony

Θεματικοί όροι: Artificial Intelligence, Formal Languages and Automata Theory, Machine Learning

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.19100

Formalizing Computational Paths and Fundamental Groups in Lean

Συγγραφείς: Ramos, Arthur F., de Oliveira, Anjolina G., de Queiroz, Ruy J. G. B., de Veras, Tiago M. L.

Θεματικοί όροι: Logic in Computer Science, Formal Languages and Automata Theory, 03B35, 55Q05, 68T01, F.4.1; I.2.3

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.19142

Comparing Labeled Markov Chains: A Cantor-Kantorovich Approach

Συγγραφείς: Banse, Adrien, Abate, Alessandro, Jungers, Raphaël M.

Θεματικοί όροι: Logic in Computer Science, Computation and Language, Formal Languages and Automata Theory, Probability

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.18103

Notes on Stack Machines and Quantum Stack Machines

Συγγραφείς: Qiu, Daowen

Θεματικοί όροι: Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.17264

Simplicity and irreducibility in circular automata

Συγγραφείς: Venturi, Riccardo

Θεματικοί όροι: Formal Languages and Automata Theory, Combinatorics, Representation Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.16611

Behavior Trees vs Executable Ontologies: a Comparative Analysis of Robot Control Paradigms

Συγγραφείς: Boldachev, Alexander

Θεματικοί όροι: Robotics, Artificial Intelligence, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.15274

Computing Sound and Accurate Upper and Lower Bounds on Hamilton-Jacobi Reachability Value Functions

Συγγραφείς: Tabbara, Ihab, Badr, Eliya, Sibai, Hussein

Θεματικοί όροι: Systems and Control, Formal Languages and Automata Theory, Symbolic Computation

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.15238

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis

Συγγραφείς: Besset, Antoine, Tillet, Joris, Sandretto, Julien Alexandre dit

Θεματικοί όροι: Logic in Computer Science, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.17617

Towards A Catalogue of Requirement Patterns for Space Robotic Missions

Συγγραφείς: Etumi, Mahdi, Taylor, Hazel M., Farrell, Marie

Πηγή: EPTCS 436, 2025, pp. 136-166

Θεματικοί όροι: Logic in Computer Science, Formal Languages and Automata Theory, Robotics, Software Engineering

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.14438

Model Learning for Adjusting the Level of Automation in HCPS

Συγγραφείς: Hajnorouzi, Mehrnoush, Rakow, Astrid, Fränzle, Martin

Πηγή: EPTCS 436, 2025, pp. 96-113

Θεματικοί όροι: Human-Computer Interaction, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.14437

Optimal Sequential Flows

Συγγραφείς: Gimbert, Hugo, Mascle, Corto, Totzke, Patrick

Θεματικοί όροι: Optimization and Control, Data Structures and Algorithms, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.13806

Ontology-Driven Model-to-Model Transformation of Workflow Specifications

Συγγραφείς: Abreu, Francisco, Cruz, Luís, Guerreiro, Sérgio

Θεματικοί όροι: Software Engineering, Formal Languages and Automata Theory

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2511.13661