Imagen de Portada

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Lopez, Aliaume
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory 03D05, 03B70, 68Q45, 68Q70 F.1.1; F.4.1; F.4.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Commutative N-polyregular functions
por: Lopez, Aliaume
Publicado: (2024)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
por: Lopez, Aliaume
Publicado: (2024)

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

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

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

Weighing Obese Timed Languages
por: Asarin, Eugene, et al.
Publicado: (2025)

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

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

Stratifiable formulae are not context-free
por: Ryan-Smith, Calliope
Publicado: (2023)

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

On Transition Constructions for Automata -- A Categorical Perspective
por: Cruchten, Mike
Publicado: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

Kleene Theorems for Lasso Languages and $ω$-Languages
por: Cruchten, Mike
Publicado: (2024)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
por: Nakano, Keisuke, et al.
Publicado: (2024)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
por: Diekert, Volker, et al.
Publicado: (2019)

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

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

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

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

Well-Quasi-Orderings on Word Languages
por: Lhote, Nathan, et al.
Publicado: (2025)

Hypernode Automata
por: Bartocci, Ezio, et al.
Publicado: (2023)

The Algebra of Nondeterministic Finite Automata
por: Gorrieri, Roberto
Publicado: (2023)

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

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
por: Cho, Da-Jung, et al.
Publicado: (2025)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
por: Bruse, Florian, et al.
Publicado: (2026)

A correspondence between the time and space complexity
por: Latkin, Ivan V.
Publicado: (2023)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
por: Heemstra, Jan, et al.
Publicado: (2025)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
por: Forster, Jonas, et al.
Publicado: (2026)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
por: Chan, Jhet
Publicado: (2025)

A Logspace Constructive Proof of L=SL
por: Buss, Sam, et al.
Publicado: (2025)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
por: Esparza, Javier, et al.
Publicado: (2025)

Recursive windows for grammar logics of bounded density
por: Gasquet, Olivier
Publicado: (2025)

PSPACE-completeness of bimodal transitive weak-density logic
por: Balbiani, Philippe, et al.
Publicado: (2025)

Eve-positional languages: putting order into Büchi automata
por: Idir, Olivier
Publicado: (2026)

Behavioural Conformances based on Lax Couplings
por: Wild, Paul, et al.
Publicado: (2025)

Evolution-Based Timed Opacity under a Universal Observation Model
por: Zhang, Zhe, et al.
Publicado: (2026)

On Graph Grammars and Games
por: Vijayakumar, Jayakrishna, et al.
Publicado: (2024)

Subshifts defined by nondeterministic and alternating plane-walking automata
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2024)

Relational Connectors and Heterogeneous Bisimulations
por: Nora, Pedro, et al.
Publicado: (2024)