arXiv (OAI Expanded)
open access
Undecidability of Adjacent Equality for Insertion, Shuffle, and Crossover Language Operations
We study a family of language operations based on insertion, shuffle, and crossover and investigate the undecidability of adjacent equality together with finite convergence and associated spectrum questions. Insertion and shuffle operations on formal languages arise in formal language theory, models
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Undecidability of Adjacent Equality for Insertion, Shuffle, and Crossover Language Operations#781050
- Yablo sequences in truth theories#711096
- The gamut of dynamic logics#110833
- An observation on Carnapʼs Continuum and stochastic independencies#758976
- On the Semantics of Generative SPARQL#303306
Record · ID 779675
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive