Loops in automata and HDTOL relations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4037263
- HDTOL matching of computations of multitape automata
- On the equivalence problem for deterministic multitape automata and transducers
- A class of multitape automata with a decidable equivalence problem
- Complete system of equivalent transformations for two-tape automata with disjoint loops
Cites work
- scientific article; zbMATH DE number 4058892 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- AFL with the semilinear property
- HDTOL matching of computations of multitape automata
- Intersections de langages algébriques bornes
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- The equivalence problem for deterministic two-tape automata
- The inclusion problem for some classes of deterministic multitape automata
Cited in
(4)
This page was built for publication: Loops in automata and HDTOL relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479541)