{"cited_by_count":694659,"description":"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.","display_name":"semigroups and automata theory","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T11567","wikipedia":"https://en.wikipedia.org/wiki/Automata_theory"},"field_id":"17","id":"T11567","keywords":[{"display_name":"formal languages","id":"formal-languages","score":0.6029,"url":"https://openalex.org/keywords/formal-languages"},{"display_name":"automata theory","id":"automata-theory","score":0.7185,"url":"https://openalex.org/keywords/automata-theory"},{"display_name":"finite automata","id":"finite-state-machines","score":0.2528,"url":"https://openalex.org/keywords/finite-state-machines"},{"display_name":"decidability","id":"decidability","score":0.2238,"url":"https://openalex.org/keywords/decidability"},{"display_name":"regular languages","id":"regular-languages","score":0.7128,"url":"https://openalex.org/keywords/regular-languages"},{"display_name":"automata","id":"automata","score":0.3274,"url":"https://openalex.org/keywords/automata"},{"display_name":"combinatorics on words","id":"combinatorics-on-words","score":0.6045,"url":"https://openalex.org/keywords/combinatorics-on-words"},{"display_name":"semigroups","id":"semigroups","score":0.2843,"url":"https://openalex.org/keywords/semigroups"},{"display_name":"formal language theory","id":"formal-language-theory","score":0.6695,"url":"https://openalex.org/keywords/formal-language-theory"},{"display_name":"context-free grammars","id":"context-free-grammars","score":0.4023,"url":"https://openalex.org/keywords/context-free-grammars"},{"display_name":"semigroup theory","id":"semigroup-theory","score":0.429,"url":"https://openalex.org/keywords/semigroup-theory"},{"display_name":"context-free languages","id":"context-free-languages","score":0.7988,"url":"https://openalex.org/keywords/context-free-languages"},{"display_name":"infinite words","id":"infinite-words","score":0.7795,"url":"https://openalex.org/keywords/infinite-words"},{"display_name":"deterministic finite automata","id":"deterministic-finite-automata","score":0.5032,"url":"https://openalex.org/keywords/deterministic-finite-automata"},{"display_name":"regular expressions","id":"regular-expressions","score":0.2254,"url":"https://openalex.org/keywords/regular-expressions"},{"display_name":"closure properties","id":"closure-properties","score":0.4962,"url":"https://openalex.org/keywords/closure-properties"},{"display_name":"pushdown automata","id":"pushdown-automata","score":0.7171,"url":"https://openalex.org/keywords/pushdown-automata"},{"display_name":"nondeterministic finite automata","id":"nondeterministic-finite-automata","score":0.6333,"url":"https://openalex.org/keywords/nondeterministic-finite-automata"},{"display_name":"tree automata","id":"tree-automata","score":0.591,"url":"https://openalex.org/keywords/tree-automata"},{"display_name":"regular semigroups","id":"regular-semigroups","score":0.8071,"url":"https://openalex.org/keywords/regular-semigroups"},{"display_name":"idempotents","id":"idempotents","score":0.2126,"url":"https://openalex.org/keywords/idempotents"},{"display_name":"automaton minimization","id":"automaton-minimization","score":0.8048,"url":"https://openalex.org/keywords/automaton-minimization"},{"display_name":"formal grammars","id":"formal-grammars","score":0.2816,"url":"https://openalex.org/keywords/formal-grammars"},{"display_name":"inverse semigroups","id":"inverse-semigroups","score":0.6357,"url":"https://openalex.org/keywords/inverse-semigroups"},{"display_name":"finite semigroups","id":"finite-semigroups","score":0.7821,"url":"https://openalex.org/keywords/finite-semigroups"}],"legacy_keywords":["Automata","Formal Languages","Regular Expressions","Finite Automata","Combinatorics on Words","Transducers","Synchronizing Automata","Sturmian Words","State Complexity","Semigroups"],"openalex_id":"https://openalex.org/T11567","source_created_date":"2024-01-23T15:27:11","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1703","url":"/topics/T11567","works_api_url":"https://api.openalex.org/works?filter=topics.id:T11567","works_count":78638,"label":"semigroups and automata theory","provider":"openalex","revision":"06ecb1f2e4a67b93","taxonomy_revision":"f050b5d4780b1289","title":"semigroups and automata theory","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36183038970989791","address_version":"morton4x16-v1","coordinates":[3,17,1703,11567],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}