专题：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.
最新文献
Structural Invariants, Memory, and Modular Diagnostics of Recamán's Sequence

preprint Full Text OpenAlex

AffordDexGrasp: Open-Set Language-Guided Dexterous Grasp With Generalizable-Instructive Affordance

article Full Text OpenAlex

Channel Theory for Polynomial Continued Fractions: Asymptotic Channels, the ξ₀ = 2/√β₂ Identity, and a Bridge Conjecture

preprint Full Text OpenAlex

Complex Multiplication as a Transcendence Predicate for Degree-2 Polynomial Continued Fractions

preprint Full Text OpenAlex

Complex Multiplication as a Transcendence Predicate for Degree-2 Polynomial Continued Fractions

preprint Full Text OpenAlex

Recognition of k-Distance Monotone Boolean Functions

article Full Text OpenAlex

An Arithmetic Stratification of Polynomial Continued Fractions — v2.0 (Modular-Discriminant Framing)

preprint Full Text OpenAlex

EmergenTheta: Experimental Analyses within the Theta Framework (Competition Contribution)

book-chapter Full Text OpenAlex

Digit Gaps and Synchronisation Clusters in Mod-6 Prime Products: Analysis to 3.25 Million Digits with Null Model Verification

preprint Full Text OpenAlex

Diamond on Kurepa trees

article Full Text OpenAlex

近5年高被引文献
Combinatorics of Permutations

book Full Text OpenAlex 421 FWCI7.6667

Proceedings of the International Congress of Mathematicians 1998

book Full Text OpenAlex 349 FWCI45.3383

Transcendental Number Theory

book Full Text OpenAlex 102 FWCI8.9925

Automata Theory and Formal Languages

book Full Text OpenAlex 96 FWCI2.0218

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 69 FWCI16.8371

Reachability in Vector Addition Systems is Ackermann-complete

preprint Full Text OpenAlex 66 FWCI7.2419

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

book-chapter Full Text OpenAlex 61 FWCI38.4649

The Reachability Problem for Petri Nets is Not Primitive Recursive

preprint Full Text OpenAlex 60 FWCI6.6384

A New Approach for Active Automata Learning Based on Apartness

book-chapter Full Text OpenAlex 43 FWCI13.3521