专题：semigroups and automata theory

This cluster of papers covers topics in automata theory, formal languages, and combinatorics on words. It includes research on regular expressions, finite automata, transducers, synchronizing automata, Sturmian words, and state complexity. The cluster also explores the connections between automata theory and semigroups.
最新文献
The Fibonacci Machine: How φ² = φ + 1 Forces the Riemann Hypothesis

preprint Full Text OpenAlex

An Auditable Transcript-to-Notebook Pipeline with Completion-Mass Capacity Bounds (Within-Model Results)

preprint Full Text OpenAlex

Analysing the Dynamic and Static Structures of Keçeci and Oresme Sequences

article Full Text OpenAlex

Computable Structure Theory

book Full Text OpenAlex

Co-annihilating graphs of partial transformation semigroups: structure and basic invariants

article Full Text OpenAlex

Unity as Closure Capacity: The Borwein Threshold

preprint Full Text OpenAlex

Unity as Closure Capacity: The Borwein Threshold

preprint Full Text OpenAlex

On the Analysis of a System of Equations Containing a Parameter n and Describing a Special State of a Certain Table of Numbers

article Full Text OpenAlex

Truncating and Shifting Weights for Max-Plus Automata

preprint Full Text OpenAlex

Clonoids of Boolean functions with a monotone or discriminator source clone

article Full Text OpenAlex

近5年高被引文献
Combinatorics of Permutations

book Full Text OpenAlex 413 FWCI6.2292

Proceedings of the International Congress of Mathematicians 1998

book Full Text OpenAlex 349 FWCI45.4545

Transcendental Number Theory

book Full Text OpenAlex 99 FWCI8.6466

Automata Theory and Formal Languages

book Full Text OpenAlex 95 FWCI2.0281

International Colloquium on Automata, Languages and Programming (ICALP 2020)

article Full Text OpenAlex 92 FWCI6.1516

Hopf Monoids and Generalized Permutahedra

article Full Text OpenAlex 68 FWCI17.5192

Reachability in Vector Addition Systems is Ackermann-complete

preprint Full Text OpenAlex 63 FWCI7.0127

Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs

book-chapter Full Text OpenAlex 59 FWCI38.5012

The Reachability Problem for Petri Nets is Not Primitive Recursive

preprint Full Text OpenAlex 56 FWCI11.5873016

A New Approach for Active Automata Learning Based on Apartness

book-chapter Full Text OpenAlex 43 FWCI12.8872