Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
From MaRDI portal
Recommendations
Cites work
- Applications of transducers in independent languages, word distances, codes
- Dyck path enumeration
- Elements of automata theory. Translated from the French by Reuben Thomas
- Embedding rationally independent languages into maximal ones
- scientific article; zbMATH DE number 5605092 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3566726 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Left and Right Synchronous Relations
- Partitioning a symmetric rational relation into two asymmetric rational relations
- Rational relations having a rational trace on each finite intersection of rational relations
This page was built for publication: Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114831)