Languages Generated by Conjunctive Query Fragments of FC[REG].
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1640, doi. 10.1007/s00224-024-10198-4
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2024 AND VI 68 AND IP 6
Results: 9
1
2
Automatic Abelian Complexities of Parikh-Collinear Fixed Points.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1622, doi. 10.1007/s00224-024-10197-5
- By:
- Publication type:
- Article
3
String Attractors of Some Simple-Parry Automatic Sequences.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1601, doi. 10.1007/s00224-024-10195-7
- By:
- Publication type:
- Article
4
On the Solution Sets of Three-Variable Word Equations.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1556, doi. 10.1007/s00224-024-10193-9
- By:
- Publication type:
- Article
5
Jumping Automata over Infinite Words.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1572, doi. 10.1007/s00224-024-10192-w
- By:
- Publication type:
- Article
6
Obstructions to Return Preservation for Episturmian Morphisms.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1512, doi. 10.1007/s00224-024-10190-y
- By:
- Publication type:
- Article
7
2-Balanced Sequences Coding Rectangle Exchange Transformation.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1537, doi. 10.1007/s00224-024-10188-6
- By:
- Publication type:
- Article
8
Non-Constructive Upper Bounds for Repetition Thresholds.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1487, doi. 10.1007/s00224-024-10187-7
- By:
- Publication type:
- Article
9
Reordered Computable Numbers.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 6, p. 1683, doi. 10.1007/s00224-024-10183-x
- By:
- Publication type:
- Article