Cover Image

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages

Fuente: arXiv

Saved in:

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

Similar Items

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

Biprofile Deviation Logic: Report-Replacement Frames and Audit Witnesses
by: Alpay, Faruk, et al.
Published: (2026)

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

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
by: German, Samuel
Published: (2026)

Density of rational languages under shift invariant measures
by: Berthé, Valérie, et al.
Published: (2025)

Finite-Horizon First-Order Rank Profiles of Regular Languages
by: Bazarova, Madina, et al.
Published: (2026)

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

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

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

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

Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

Generalised Möbius Categories and Convolution Kleene Algebras
by: Cranch, James, et al.
Published: (2025)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Transfinite Fixed Points in Alpay Algebra as Ordinal Game Equilibria in Dependent Type Theory
by: Alpay, Faruk, et al.
Published: (2025)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

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

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

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

Probabilistic automatic complexity of finite strings
by: Gill, Kenneth
Published: (2024)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)

Simplicity and irreducibility in circular automata
by: Venturi, Riccardo
Published: (2025)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)