On the transformation semigroups of finite automata

DOI10.1016/0022-0000(83)90024-7zbMath0504.68029OpenAlexW2010027134MaRDI QIDQ1836302

Yanyan Li

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90024-7

zbMATH Keywords

algorithmstime complexitytransition semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (5)

Characterization of state-independent automata ⋮ Semigroup automaton structure by homomorphism and domain partition ⋮ Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata ⋮ An Algebraic Characterization of Strictly Piecewise Languages ⋮ Unnamed Item

Cites Work

• The amalgamation of automata
• Group-Type Automata
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the transformation semigroups of finite automata