Image de couverture de livre

Implicit automata in λ-calculi III: affine planar string-to-string functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pradic, Cécilia, Price, Ian
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Formal Languages and Automata Theory 68N18, 03B40, 68Q55, 68Q45, 03B47
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
par: Alpay, Faruk, et autres
Publié: (2026)

Languages given by Finite Automata over the Unary Alphabet
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Finite-Horizon First-Order Rank Profiles of Regular Languages
par: Bazarova, Madina, et autres
Publié: (2026)

The generating power of weighted tree automata with initial algebra semantics
par: Droste, Manfred, et autres
Publié: (2024)

On the Intersection Problem for Quantum Finite Automata
par: Benso, Andrea, et autres
Publié: (2024)

Presheaf automata
par: Struth, Georg, et autres
Publié: (2024)

Probabilistic automatic complexity of finite strings
par: Gill, Kenneth
Publié: (2024)

Languages of Words of Low Automatic Complexity Are Hard to Compute
par: Chen, Joey, et autres
Publié: (2025)

Multidimensional tilings and MSO logic
par: Pallen, Rémi, et autres
Publié: (2025)

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

A hierarchy of reversible finite automata
par: Radionova, Maria, et autres
Publié: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
par: Petrov, Semyon, et autres
Publié: (2024)

Nondeterministic tree-walking automata are not closed under complementation
par: Martynova, Olga, et autres
Publié: (2024)

Around Don's conjecture for binary completely reachable automata
par: Zhu, Yinfeng
Publié: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
par: Casas, David, et autres
Publié: (2023)

Multipass automata and group word problems
par: Ceccherini-Silberstein, Tullio, et autres
Publié: (2014)

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

Bandwidth of Nondeterministic Finite Automata
par: Cho, Da-Jung, et autres
Publié: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
par: Inoue, Yusuke, et autres
Publié: (2024)

A Logic For Fresh Labelled Transition Systems
par: Bandukara, Mohamed H, et autres
Publié: (2025)

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

Run supports and initial algebra supports of weighted automata
par: Droste, Manfred, et autres
Publié: (2024)

Decision Problems on Copying and Shuffling
par: Halava, Vesa, et autres
Publié: (2023)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
par: Nakano, Keisuke, et autres
Publié: (2024)

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

On Quantum Context-Free Grammars
par: Aruja, Merina, et autres
Publié: (2025)

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

Density of rational languages under shift invariant measures
par: Berthé, Valérie, et autres
Publié: (2025)

Layered automata: A canonical model for automata over infinite words
par: Casares, Antonio, et autres
Publié: (2026)

Subshifts defined by nondeterministic and alternating plane-walking automata
par: de Menibus, Benjamin Hellouin, et autres
Publié: (2024)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
par: Hendel, Russell Jay
Publié: (2025)

Weakly-unambiguous Parikh automata and their link to holonomic series
par: Bostan, Alin, et autres
Publié: (2025)

Formalizing Computational Paths and Fundamental Groups in Lean
par: Ramos, Arthur F., et autres
Publié: (2025)

An automata-based test for bricks over string algebras
par: Kuber, Amit, et autres
Publié: (2026)

On Computational Completeness of Semi-Conditional Matrix Grammars
par: Fernau, Henning, et autres
Publié: (2024)

Mostowski Index via extended register games
par: Idir, Olivier, et autres
Publié: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
par: Laumen, Jasper, et autres
Publié: (2026)

Bounded Languages Described by GF(2)-grammars
par: Makarov, Vladislav
Publié: (2019)

Linear equations and recursively enumerable sets
par: Honkala, Juha
Publié: (2024)

Games, mobile processes, and functionss -- alternating, concurrent, and well-bracketed semantics
par: Jaber, Guilhem, et autres
Publié: (2025)