Suchergebnisse - "Formal Languages and Automata Theory (cs.FL)"

The n-ary initial literal and literal shuffle

Autoren: Stefan Hoffmann

Quelle: Discrete Applied Mathematics. 376:112-132

Schlagwörter: 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)

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

Membership problems in finite groups

Autoren: Markus Lohrey Andreas Rosowski Georg Zetzsche et al.

Weitere Verfasser: Markus Lohrey Andreas Rosowski Georg Zetzsche et al.

Quelle: 47th International Symposium on Mathematical Foundations of Computer Science
Leibniz International Proceedings in Informatics

Schlagwörter: algorithms for finite groups, FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), 20B05, 20F10, 68Q45, intersection non-emptiness problems, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, Group Theory (math.GR), 01 natural sciences, FOS: Mathematics, ddc:004, knapsack problems in groups, 0101 mathematics, Mathematics - Group Theory

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2206.11756
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.71
http://hdl.handle.net/21.11116/0000-000A-BC99-6
http://hdl.handle.net/21.11116/0000-000B-32E4-B
http://hdl.handle.net/21.11116/0000-000A-BC9B-4

STL-GO: Spatio-Temporal Logic with Graph Operators for Distributed Systems with Multiple Network Topologies

Autoren: Yiqi Zhao Xinyi Yu Bardh Hoxha et al.

Quelle: ACM Transactions on Embedded Computing Systems. 24:1-23

Schlagwörter: FOS: Computer and information sciences, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Formal Languages and Automata Theory, Multiagent Systems, Logic in Computer Science (cs.LO), Multiagent Systems (cs.MA)

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

Fibrational Perspectives on Determinization of Finite-State Automata

Autoren: Li, Thea

Quelle: Electronic Proceedings in Theoretical Computer Science. 429:203-216

Schlagwörter: FOS: Computer and information sciences, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), FOS: Mathematics, Category Theory, Category Theory (math.CT), Formal Languages and Automata Theory, Logic in Computer Science (cs.LO)

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

Conway’s Cosmological Theorem and Automata Theory

Autoren: Lairez, Pierre Storozhenko, Aleksandr

Quelle: The American Mathematical Monthly. :1-16

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

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

The Complexity of Generalized HyperLTL with Stuttering and Contexts

Autoren: Regaud, Gaëtan Zimmermann, Martin

Quelle: Electronic Proceedings in Theoretical Computer Science. 428:161-176

Schlagwörter: FOS: Computer and information sciences, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Formal Languages and Automata Theory, Logic in Computer Science (cs.LO)

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

An Automaton-based Characterisation of First-Order Logic over Infinite Trees

Autoren: Benerecetti, Massimo Della Monica, Dario Matteo, Angelo et al.

Quelle: Electronic Proceedings in Theoretical Computer Science. 428:45-61

Schlagwörter: FOS: Computer and information sciences, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Formal Languages and Automata Theory, Logic in Computer Science (cs.LO)

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

How Concise are Chains of co-Büchi Automata?

Autoren: Ehlers, Rüdiger

Quelle: Electronic Proceedings in Theoretical Computer Science. 428:111-126

Schlagwörter: FOS: Computer and information sciences, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), F.1.1, F.4.3, Formal Languages and Automata Theory, Logic in Computer Science (cs.LO)

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

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games

Autoren: Bhaduri, Purandar

Quelle: Electronic Proceedings in Theoretical Computer Science. 428:62-75

Schlagwörter: Computer Science and Game Theory, FOS: Computer and information sciences, Computational Complexity, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Computational Complexity (cs.CC), Formal Languages and Automata Theory, Multiagent Systems, Computer Science and Game Theory (cs.GT), Logic in Computer Science (cs.LO), Multiagent Systems (cs.MA)

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

Preserving self-similarity in free products of semigroups

Autoren: Tara Macalister Brough Jan Philipp Wächter Janette Welker

Quelle: International Journal of Algebra and Computation. :1-31

Schlagwörter: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Group Theory, FOS: Mathematics, 0102 computer and information sciences, Group Theory (math.GR), 20M35, 68Q45, 0101 mathematics, Formal Languages and Automata Theory, 01 natural sciences

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

Tokenization as Finite-State Transduction

Autoren: Cognetta, Marco Okazaki, Naoaki

Quelle: Computational Linguistics. :1-35

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)

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

RUNS IN PAPERFOLDING SEQUENCES

Autoren: JEFFREY SHALLIT

Quelle: Bulletin of the Australian Mathematical Society. :1-15

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Combinatorics, Discrete Mathematics, Formal Languages and Automata Theory (cs.FL), FOS: Mathematics, Combinatorics (math.CO), Formal Languages and Automata Theory

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

STLCCP: Efficient Convex Optimization-Based Framework for Signal Temporal Logic Specifications

Autoren: Yoshinari Takayama Kazumune Hashimoto Toshiyuki Ohtsuka

Quelle: IEEE Transactions on Automatic Control. 70:6064-6079

Schlagwörter: FOS: Computer and information sciences, Computer Science - Robotics, Formal Languages and Automata Theory (cs.FL), FOS: Electrical engineering, electronic engineering, information engineering, Computer Science - Formal Languages and Automata Theory, Systems and Control (eess.SY), Electrical Engineering and Systems Science - Systems and Control, Robotics (cs.RO)

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

The word problem and growth of groups

Autoren: Bondarenko, Ievgen

Quelle: Journal of Algebra. 677:252-266

Schlagwörter: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), 20F10, 68Q70, 03D10, 20E08, FOS: Mathematics, Computer Science - Formal Languages and Automata Theory, Group Theory (math.GR), Mathematics - Group Theory

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

Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory

Autoren: Affeldt, Reynald Cohen, Cyril Saito, Ayumu

Weitere Verfasser: Affeldt, Reynald Cohen, Cyril Saito, Ayumu

Quelle: ACM Transactions on Probabilistic Machine Learning. 1:1-34

Schlagwörter: Denotational semantics, measure theory, formal proofs, Program verification, integration theory, Rocq, Formalized mathematics, Probabilistic algorithms, probabilistic programming language, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-05318682v1/document
https://hal.science/hal-05318682v1
https://doi.org/10.1145/3732291

Measuring Grammatical Diversity from Small Corpora: Derivational Entropy Rates, Mean Length of Utterances, and Annotation Invariance

Autoren: Martin, Fermin Moscoso del Prado

Quelle: Computational Linguistics. :1-43

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

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

INPROVF: Leveraging Large Language Models to Repair High-level Robot Controllers from Assumption Violations

Autoren: Meng, Qian Zhou, Jin Peng Weinberger, Kilian Q. et al.

Quelle: 2025 IEEE 21st International Conference on Automation Science and Engineering (CASE). :1680-1687

Schlagwörter: FOS: Computer and information sciences, Computer Science - Robotics, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Formal Languages and Automata Theory (cs.FL), FOS: Electrical engineering, electronic engineering, information engineering, Computer Science - Formal Languages and Automata Theory, Systems and Control (eess.SY), Electrical Engineering and Systems Science - Systems and Control, Robotics (cs.RO)

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

Comparing spoken languages using the Pāninian System of sounds and finite state machines

Autoren: Shreekanth M. Prabhu Abhisek Midya

Quelle: CSI Transactions on ICT. 13:225-264

Schlagwörter: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), 0601 history and archaeology, 06 humanities and the arts, Computation and Language, Formal Languages and Automata Theory, 01 natural sciences, Computation and Language (cs.CL), 0105 earth and related environmental sciences

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

A Design Recipe and Recipe-Based Errors for Regular Expressions

Autoren: Morazán, Marco T. Dzhatdoyev, Shamil Rosiers, Josephine Des et al.

Quelle: Electronic Proceedings in Theoretical Computer Science. 424:25-48

Schlagwörter: Human-Computer Interaction, Software Engineering (cs.SE), FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Software Engineering, Programming Languages, Formal Languages and Automata Theory, Human-Computer Interaction (cs.HC), Programming Languages (cs.PL)

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

Design Support for Multitape Turing Machines

Autoren: Morazán, Marco T. Kempinski, Oliwia Garced, Andrés M.

Quelle: Electronic Proceedings in Theoretical Computer Science. 424:1-24

Schlagwörter: Human-Computer Interaction, Software Engineering (cs.SE), FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Software Engineering, Programming Languages, Formal Languages and Automata Theory, Human-Computer Interaction (cs.HC), Programming Languages (cs.PL)

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