Automata that recognize intersections of free submonoids
From MaRDI portal
Publication:4154498
DOI10.1016/S0019-9958(77)90050-XzbMath0375.94022MaRDI QIDQ4154498
Publication date: 1977
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (6)
The poset of retracts of a free monoid ⋮ Universal algebras ⋮ On the degree of ambiguity of finite automata ⋮ Unnamed Item ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ A note on intersections of free submonoids of a free monoid
This page was built for publication: Automata that recognize intersections of free submonoids