Výsledky vyhledávání - "Formal Languages and Automata Theory"

The n-ary initial literal and literal shuffle

Autoři: Stefan Hoffmann

Zdroj: Discrete Applied Mathematics. 376:112-132

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2108.09282

Membership problems in finite groups

Autoři: Markus Lohrey Andreas Rosowski Georg Zetzsche a další

Přispěvatelé: Markus Lohrey Andreas Rosowski Georg Zetzsche a další

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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: Yiqi Zhao Xinyi Yu Bardh Hoxha a další

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2507.15147

Fibrational Perspectives on Determinization of Finite-State Automata

Autoři: Li, Thea

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2410.00675

Conway’s Cosmological Theorem and Automata Theory

Autoři: Lairez, Pierre Storozhenko, Aleksandr

Zdroj: The American Mathematical Monthly. :1-16

Témata: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory

Přístupová URL adresa: http://arxiv.org/abs/2409.20341

The Complexity of Generalized HyperLTL with Stuttering and Contexts

Autoři: Regaud, Gaëtan Zimmermann, Martin

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2509.14095

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

Autoři: Benerecetti, Massimo Della Monica, Dario Matteo, Angelo a další

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2509.14090

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

Autoři: Ehlers, Rüdiger

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2509.14087

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games

Autoři: Bhaduri, Purandar

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2505.07501

Preserving self-similarity in free products of semigroups

Autoři: Tara Macalister Brough Jan Philipp Wächter Janette Welker

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2003.12810

Tokenization as Finite-State Transduction

Autoři: Cognetta, Marco Okazaki, Naoaki

Zdroj: Computational Linguistics. :1-35

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2410.15696

RUNS IN PAPERFOLDING SEQUENCES

Autoři: JEFFREY SHALLIT

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2412.17930

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

Autoři: Yoshinari Takayama Kazumune Hashimoto Toshiyuki Ohtsuka

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2305.09441

The word problem and growth of groups

Autoři: Bondarenko, Ievgen

Zdroj: Journal of Algebra. 677:252-266

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2403.11148

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

Autoři: Martin, Fermin Moscoso del Prado

Zdroj: Computational Linguistics. :1-43

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2412.06095

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

Autoři: Meng, Qian Zhou, Jin Peng Weinberger, Kilian Q. a další

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2503.13660

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

Autoři: Shreekanth M. Prabhu Abhisek Midya

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2301.12463

A Design Recipe and Recipe-Based Errors for Regular Expressions

Autoři: Morazán, Marco T. Dzhatdoyev, Shamil Rosiers, Josephine Des a další

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2508.03639

Design Support for Multitape Turing Machines

Autoři: Morazán, Marco T. Kempinski, Oliwia Garced, Andrés M.

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2508.03638

Visual Execution and Validation of Finite-State Machines and Pushdown Automata

Autoři: Morazán, Marco T. Fields, David Anthony K. Garced, Andrés M. a další

Zdroj: Electronic Proceedings in Theoretical Computer Science. 424:87-108

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2508.03641