Science Explorer Back to mapMap

semigroups and automata theory

semigroups and automata theory is a research topic within Computational Theory and Mathematics. Science Explorer counts 25k research works in it since 1950. 10.0% of them reached the world's top 10% most cited for their field and year.

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.

  • Automata
  • Formal Languages
  • Regular Expressions
  • Finite Automata
  • Combinatorics on Words
  • Transducers
  • Synchronizing Automata
  • Sturmian Words
  • State Complexity
  • Semigroups
Research works
25k
fractional, since 1950
In the world top 10%
2.5k
per year above
Top-10% rate
10.0%
share of its works in the world top 10%
Growth, 2018-21 → 2022-25
+0%
the tick is no change
Largest producer
United States
21% of the 10 largest, 2022-now

Discussion

Ask a question or share a note about semigroups and automata theory. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.