Titlebook: Developments in Language Theory; 25th International C Nelma Moreira,Rogério Reis Conference proceedings 2021 Springer Nature Switzerland AG

OFF

不要严酷

State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters . states. Up to now, these, and finite languages projected onto unary languages, were the only classes of automata known to possess this property. We show that this is also true for commutative automata and we find commutative automata that are not state-partition automata.

勉励

Conference proceedings 2021ugal, during August 16-20, 2021. The conference took place in an hybrid format with both in-person and online participation..The 27 full papers included in these proceedings were carefully reviewed and selected from 48 submissions. The DLT conference series provides a forum for presenting current de

EXUDE

Pointlike Sets and Separation: A Personal Perspectivef separation and covering problems, have become very popular now in Computer Science because of the truly amazing work of Place and Zeitoun on dot-depth and related hierarchies. I believe revisiting some of the older results will revive interest and provide perspective.

木质

ALTER

Variations on the Post Correspondence Problem for Free Groupsectivity assumptions, we prove that computing the rank of the equaliser of a pair of free group homomorphisms can be applied to computing a basis of this equaliser, and also to solve the “generalised” Post Correspondence Problem for free groups.

话

软弱

laceration

凶残