Decision Procedure for A Theory of String Sequences
Fuente:
arXiv
Saved in:
| Main Authors: | Hu, Denghang, Chen, Taolue, Rümmer, Philipp, Song, Fu, Wu, Zhilin |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)
by: Nepeivoda, Antonina, et al.
Published: (2025)
Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)
by: Geißler, Dominik, et al.
Published: (2025)
Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)
by: Filiot, Emmanuel, et al.
Published: (2024)
Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)
by: Alur, Rajeev, et al.
Published: (2022)
The Decision Problem for Regular First-Order Theories
by: Mathur, Umang, et al.
Published: (2024)
by: Mathur, Umang, et al.
Published: (2024)
A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)
by: Filiot, Emmanuel, et al.
Published: (2022)
Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)
by: Benalioua, Yahia Idriss, et al.
Published: (2026)
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)
by: Kan, Shuanglong, et al.
Published: (2025)
An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
by: Stutz, Felix, et al.
Published: (2025)
by: Stutz, Felix, et al.
Published: (2025)
Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
by: Paul, Abhijit
Published: (2025)
by: Paul, Abhijit
Published: (2025)
Synthesizing DSLs for Few-Shot Learning
by: Krogmeier, Paul, et al.
Published: (2025)
by: Krogmeier, Paul, et al.
Published: (2025)
Syntax Repair as Language Intersection
by: Considine, Breandan
Published: (2025)
by: Considine, Breandan
Published: (2025)
Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)
by: Chatterjee, Krishnendu, et al.
Published: (2025)
Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)
by: Geißler, Dominik, et al.
Published: (2025)
Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)
by: Chassot, Samuel, et al.
Published: (2025)
Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)
by: Li, Elaine, et al.
Published: (2024)
Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)
by: Dixon, Alex, et al.
Published: (2023)
Maximal and minimal dynamic Petri net slicing
by: Llorens, Marisa, et al.
Published: (2021)
by: Llorens, Marisa, et al.
Published: (2021)
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)
by: Jia, Xiaodong, et al.
Published: (2024)
CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)
by: Zhang, Kaiwen, et al.
Published: (2026)
Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
by: Li, Elaine, et al.
Published: (2026)
by: Li, Elaine, et al.
Published: (2026)
Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)
by: Chatterjee, Krishnendu, et al.
Published: (2024)
Reactive graphs in action (extended version)
by: Tinoco, David, et al.
Published: (2024)
by: Tinoco, David, et al.
Published: (2024)
Polyregular equivalence is undecidable in higher-order types
by: Bojańczyk, Mikołaj, et al.
Published: (2026)
by: Bojańczyk, Mikołaj, et al.
Published: (2026)
Synchronisability in Mailbox Communication
by: Di Giusto, Cinzia, et al.
Published: (2024)
by: Di Giusto, Cinzia, et al.
Published: (2024)
Verification under TSO with an infinite Data Domain
by: Abdulla, Parosh Aziz, et al.
Published: (2024)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)
Linear Matching of JavaScript Regular Expressions
by: Barrière, Aurèle, et al.
Published: (2023)
by: Barrière, Aurèle, et al.
Published: (2023)
Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
by: Hong, Chih-Duo, et al.
Published: (2025)
by: Hong, Chih-Duo, et al.
Published: (2025)
Duality-based Mode Operations and Pyramid Multilayer Mapping for Rhetorical Modes
by: Wu, Zi-Niu
Published: (2025)
by: Wu, Zi-Niu
Published: (2025)
Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
by: Tsai, Yun Chen, et al.
Published: (2025)
by: Tsai, Yun Chen, et al.
Published: (2025)
String Attractors for Automatic Sequences
by: Schaeffer, Luke, et al.
Published: (2020)
by: Schaeffer, Luke, et al.
Published: (2020)
AGDES: Automatic Generation of Dependent Event Sequences
by: Guzman, Alexander Obeid
Published: (2026)
by: Guzman, Alexander Obeid
Published: (2026)
The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)
by: Bergsträßer, Pascal, et al.
Published: (2024)
Closure and Decision Properties for Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2023)
by: Amrane, Amazigh, et al.
Published: (2023)
Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
by: Pshenitsyn, Tikhon
Published: (2025)
by: Pshenitsyn, Tikhon
Published: (2025)
An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
by: Finkel, Alain, et al.
Published: (2025)
by: Finkel, Alain, et al.
Published: (2025)
Standard Automata Theory and Process Algebra
by: Yodaiken, Victor
Published: (2022)
by: Yodaiken, Victor
Published: (2022)
Context-Free Languages of String Diagrams
by: Earnshaw, Matt, et al.
Published: (2024)
by: Earnshaw, Matt, et al.
Published: (2024)
Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
by: Principato, Flavio T., et al.
Published: (2025)
by: Principato, Flavio T., et al.
Published: (2025)
The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)
by: Chen, Zeyu, et al.
Published: (2026)
Similar Items
-
Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025) -
Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025) -
Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024) -
Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022) -
The Decision Problem for Regular First-Order Theories
by: Mathur, Umang, et al.
Published: (2024)