Cover Image

Finite-Horizon First-Order Rank Profiles of Regular Languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bazarova, Madina, Alpay, Faruk
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Logic in Computer Science 03D05, 03C13, 68Q45, 03B25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
by: Alpay, Faruk, et al.
Published: (2026)

On the Intersection Problem for Quantum Finite Automata
by: Benso, Andrea, et al.
Published: (2024)

Run supports and initial algebra supports of weighted automata
by: Droste, Manfred, et al.
Published: (2024)

The generating power of weighted tree automata with initial algebra semantics
by: Droste, Manfred, et al.
Published: (2024)

Sparse regular subsets of the reals
by: Bell, Jason, et al.
Published: (2023)

A Dichotomy for $k$-automatic expansions of Presburger Arithmetic
by: Bell, Jason, et al.
Published: (2025)

Implicit automata in λ-calculi III: affine planar string-to-string functions
by: Pradic, Cécilia, et al.
Published: (2024)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

On Probabilistic $ω$-Pushdown Systems, and $ω$-Probabilistic Computational Tree Logic
by: Lin, Deren, et al.
Published: (2022)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)

Subsets of groups with context-free preimages
by: Levine, Alex
Published: (2023)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

The Polynomial Hierarchy does not collapse
by: Czerwinski, Reiner
Published: (2024)

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

Effective equation solving, constraints and growth in virtually abelian groups
by: Ciobanu, Laura, et al.
Published: (2023)

NIP and Distal Metric Structures
by: Anderson, Aaron
Published: (2023)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)

Multipass automata and group word problems
by: Ceccherini-Silberstein, Tullio, et al.
Published: (2014)

NL Is Strictly Contained in P
by: Flum, Santiago, et al.
Published: (2023)

Word equations and the exponent of periodicity
by: Diekert, Volker, et al.
Published: (2025)

Multidimensional tilings and MSO logic
by: Pallen, Rémi, et al.
Published: (2025)

Solutions of Word Equations over Partially Commutative Structures
by: Diekert, Volker, et al.
Published: (2016)

On the problem of stability of abstract elementary classes of modules
by: Paolini, Gianluca, et al.
Published: (2025)

Preservation theorems on sparse classes revisited
by: Dawar, Anuj, et al.
Published: (2024)

Local stability in structures with a standard sort
by: Barbina, Silvia, et al.
Published: (2025)

An automata-based test for bricks over string algebras
by: Kuber, Amit, et al.
Published: (2026)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

Some contributions to presheaf model theory
by: Brunner, Andreas, et al.
Published: (2024)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
by: Carrasco-Vargas, Nicanor
Published: (2023)

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
by: Kattermann, David, et al.
Published: (2025)

Mekler's Construction and the Preservation of NCTP and NBTP
by: Ahn, JinHoo, et al.
Published: (2026)

Paths, Ends and The Separation Problem for Infinite Graphs
by: Carrasco-Vargas, Nicanor, et al.
Published: (2024)

A vector logic for intensional formal semantics
by: Quigley, Daniel
Published: (2026)