An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
Fuente:
arXiv
Saved in:
| Main Authors: | Jansen, Klaus, Nowotka, Dirk, Pirotton, Lis, Wambsganz, Corinna, Wiedenhöft, Max |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024)
by: Nowotka, Dirk, et al.
Published: (2024)
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024)
by: Nowotka, Dirk, et al.
Published: (2024)
Tight Bounds for the Number of Absent Subsequences
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
Subword enumeration up to stack-sorting equivalence
by: Campbell, John M., et al.
Published: (2026)
by: Campbell, John M., et al.
Published: (2026)
Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, et al.
Published: (2025)
by: Currie, James, et al.
Published: (2025)
Computing the k-binomial complexity of generalized Thue--Morse words
by: Golafshan, M., et al.
Published: (2024)
by: Golafshan, M., et al.
Published: (2024)
Mapping words to powers by morphisms
by: Saarela, Aleksi
Published: (2025)
by: Saarela, Aleksi
Published: (2025)
A Connection Between Unbordered Partial Words and Sparse Rulers
by: Saarela, Aleksi, et al.
Published: (2024)
by: Saarela, Aleksi, et al.
Published: (2024)
Mapped Exponent and Asymptotic Critical Exponent of Words
by: Foster, Eva, et al.
Published: (2025)
by: Foster, Eva, et al.
Published: (2025)
Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
by: Machacek, John
Published: (2025)
by: Machacek, John
Published: (2025)
The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)
by: Fici, Gabriele
Published: (2024)
The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)
by: Currie, James D., et al.
Published: (2024)
Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)
by: Andrade, Jonathan, et al.
Published: (2024)
Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)
by: De Luca, Alessandro, et al.
Published: (2025)
Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)
by: Halava, Vesa, et al.
Published: (2023)
The decidability of the genus of regular languages and directed emulators
by: Bonfante, Guillaume, et al.
Published: (2021)
by: Bonfante, Guillaume, et al.
Published: (2021)
Words with factor complexity $2n+1$ and minimal critical exponent
by: Currie, James D.
Published: (2025)
by: Currie, James D.
Published: (2025)
A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
by: Heuberger, Clemens, et al.
Published: (2022)
by: Heuberger, Clemens, et al.
Published: (2022)
From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)
by: Khormali, Omid, et al.
Published: (2026)
Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)
by: De Luca, Alessandro, et al.
Published: (2022)
Resolution of The Linear-Bounded Automata Question
by: Lin, Tianrong
Published: (2021)
by: Lin, Tianrong
Published: (2021)
Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
by: Lin, Tianrong
Published: (2021)
by: Lin, Tianrong
Published: (2021)
Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
by: Rukavicka, Josef
Published: (2023)
by: Rukavicka, Josef
Published: (2023)
A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
by: Cho, Da-Jung, et al.
Published: (2025)
by: Cho, Da-Jung, et al.
Published: (2025)
On gapped repeats in a cyclic Fibonacci word
by: Horiyama, Takashi, et al.
Published: (2026)
by: Horiyama, Takashi, et al.
Published: (2026)
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)
by: Couvreur, Jean-Michel, et al.
Published: (2025)
Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)
by: Renard, Antoine, et al.
Published: (2024)
Some Remarks on Marginal Code Languages
by: Konstantinidis, Stavros
Published: (2026)
by: Konstantinidis, Stavros
Published: (2026)
Word-Representable Graphs and Locality of Words
by: Böll, Philipp, et al.
Published: (2025)
by: Böll, Philipp, et al.
Published: (2025)
The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)
by: Allouche, Jean-Paul, et al.
Published: (2024)
A cornering strategy for synchronizing a DFA
by: Bradshaw, Peter, et al.
Published: (2024)
by: Bradshaw, Peter, et al.
Published: (2024)
Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
by: Silva, Jorge Miguel
Published: (2026)
by: Silva, Jorge Miguel
Published: (2026)
Symbols frequencies in the Thue--Morse word in base $3/2$ and related conjectures
by: Cassaigne, Julien, et al.
Published: (2026)
by: Cassaigne, Julien, et al.
Published: (2026)
On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)
by: Deng, Zhibo, et al.
Published: (2025)
Positionality of Dumont--Thomas numeration systems for integers
by: Kreczman, Savinien, et al.
Published: (2025)
by: Kreczman, Savinien, et al.
Published: (2025)
Clustering of return words in languages of interval exchanges
by: Dolce, Francesco, et al.
Published: (2025)
by: Dolce, Francesco, et al.
Published: (2025)
Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)
by: Kostolányi, Peter
Published: (2023)
q-Parikh Matrices and q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)
by: Renard, Antoine, et al.
Published: (2024)
Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)
by: Idir, Olivier
Published: (2026)
Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)
by: Berry, Mathias, et al.
Published: (2026)
Similar Items
-
The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024) -
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024) -
Tight Bounds for the Number of Absent Subsequences
by: Adamson, Duncan, et al.
Published: (2024) -
Subword enumeration up to stack-sorting equivalence
by: Campbell, John M., et al.
Published: (2026) -
Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, et al.
Published: (2025)