Cover Image

Polyregular equivalence is undecidable in higher-order types

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bojańczyk, Mikołaj, Fabiański, Grzegorz, Stefański, Rafał
Format:	Preprint
Published:	2026
Subjects:	Programming Languages Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polyregular Model Checking
by: Lopez, Aliaume, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)

The single-use restriction for register automata and transducers over infinite alphabets
by: Stefański, Rafał
Published: (2024)

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

The Finite Length Property of the Rado Graph and Friends
by: Yang, Jingjie, et al.
Published: (2026)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
by: Schmellenkamp, Marko, et al.
Published: (2024)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
by: Li, Elaine, et al.
Published: (2026)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

Decision Procedure for A Theory of String Sequences
by: Hu, Denghang, et al.
Published: (2025)

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
by: Stutz, Felix, et al.
Published: (2025)

Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
by: Paul, Abhijit
Published: (2025)

Maximal and minimal dynamic Petri net slicing
by: Llorens, Marisa, et al.
Published: (2021)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

Synthesizing DSLs for Few-Shot Learning
by: Krogmeier, Paul, et al.
Published: (2025)

Syntax Repair as Language Intersection
by: Considine, Breandan
Published: (2025)

Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Reactive graphs in action (extended version)
by: Tinoco, David, et al.
Published: (2024)

Synchronisability in Mailbox Communication
by: Di Giusto, Cinzia, et al.
Published: (2024)

Verification under TSO with an infinite Data Domain
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

Linear Matching of JavaScript Regular Expressions
by: Barrière, Aurèle, et al.
Published: (2023)

Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
by: Vieira, Tim
Published: (2026)

Duality-based Mode Operations and Pyramid Multilayer Mapping for Rhetorical Modes
by: Wu, Zi-Niu
Published: (2025)

Simple grammar bisimilarity, with an application to session type equivalence
by: Poças, Diogo, et al.
Published: (2024)

Type-safe Monitoring of Parameterized Streams
by: Baumeister, Jan, et al.
Published: (2026)

Productive Quantum Programming Needs Better Abstract Machines
by: Núñez-Corrales, Santiago, et al.
Published: (2025)

Automated Formalization of Probabilistic Requirements from Structured Natural Language
by: Mavridou, Anastasia, et al.
Published: (2025)

Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs
by: Zhang, Kaiwen, et al.
Published: (2022)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

Formal verification of higher dimensional quantum protocols
by: Puthoor, Ittoop Vergheese
Published: (2024)