{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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.","keywords":[{"id":"https://openalex.org/keywords/formal-languages","display_name":"formal languages","score":0.6029},{"id":"https://openalex.org/keywords/automata-theory","display_name":"automata theory","score":0.7184},{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.2527},{"id":"https://openalex.org/keywords/decidability","display_name":"decidability","score":0.2237},{"id":"https://openalex.org/keywords/regular-languages","display_name":"regular languages","score":0.7128},{"id":"https://openalex.org/keywords/automata","display_name":"automata","score":0.3273},{"id":"https://openalex.org/keywords/combinatorics-on-words","display_name":"combinatorics on words","score":0.6043},{"id":"https://openalex.org/keywords/semigroups","display_name":"semigroups","score":0.2842},{"id":"https://openalex.org/keywords/formal-language-theory","display_name":"formal language theory","score":0.6696},{"id":"https://openalex.org/keywords/context-free-grammars","display_name":"context-free grammars","score":0.4023},{"id":"https://openalex.org/keywords/semigroup-theory","display_name":"semigroup theory","score":0.429},{"id":"https://openalex.org/keywords/context-free-languages","display_name":"context-free languages","score":0.799},{"id":"https://openalex.org/keywords/infinite-words","display_name":"infinite words","score":0.7795},{"id":"https://openalex.org/keywords/deterministic-finite-automata","display_name":"deterministic finite automata","score":0.5032},{"id":"https://openalex.org/keywords/regular-expressions","display_name":"regular expressions","score":0.2251},{"id":"https://openalex.org/keywords/closure-properties","display_name":"closure properties","score":0.496},{"id":"https://openalex.org/keywords/pushdown-automata","display_name":"pushdown automata","score":0.7171},{"id":"https://openalex.org/keywords/nondeterministic-finite-automata","display_name":"nondeterministic finite automata","score":0.6333},{"id":"https://openalex.org/keywords/tree-automata","display_name":"tree automata","score":0.591},{"id":"https://openalex.org/keywords/regular-semigroups","display_name":"regular semigroups","score":0.8071},{"id":"https://openalex.org/keywords/idempotents","display_name":"idempotents","score":0.2124},{"id":"https://openalex.org/keywords/automaton-minimization","display_name":"automaton minimization","score":0.8048},{"id":"https://openalex.org/keywords/formal-grammars","display_name":"formal grammars","score":0.2815},{"id":"https://openalex.org/keywords/inverse-semigroups","display_name":"inverse semigroups","score":0.6353},{"id":"https://openalex.org/keywords/finite-semigroups","display_name":"finite semigroups","score":0.7824}],"legacy_keywords":"Automata; Formal Languages; Regular Expressions; Finite Automata; Combinatorics on Words; Transducers; Synchronizing Automata; Sturmian Words; State Complexity; Semigroups","ids":{"openalex":"https://openalex.org/T11567","wikipedia":"https://en.wikipedia.org/wiki/Automata_theory"},"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"},"siblings":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification"},{"id":"https://openalex.org/T10211","display_name":"Computational Drug Discovery Methods"},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research"},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis"},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs"},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms"},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms"},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic"},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling"},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation"},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms"},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic"},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms"},{"id":"https://openalex.org/T12100","display_name":"Advanced Mathematical Modeling in Engineering"},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications"},{"id":"https://openalex.org/T12469","display_name":"Chaos, Complexity, and Education"},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis"},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems"},{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control"},{"id":"https://openalex.org/T12809","display_name":"Contact Mechanics and Variational Inequalities"},{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata"},{"id":"https://openalex.org/T13286","display_name":"Modeling and Simulation Systems"},{"id":"https://openalex.org/T13523","display_name":"Mathematics, Computing, and Information Processing"}],"works_count":78664,"cited_by_count":694700,"works_api_url":"https://api.openalex.org/works?filter=topics.id:T11567","updated_date":"2026-10-19T03:01:26","created_date":"2024-01-23T15:27:11"}