Loops in automata and HDTOL relations

DOI10.1051/ITA/1990240403271zbMATH Open0701.68079OpenAlexW23690154MaRDI QIDQ3479541FDOQ3479541

Authors: Karel II Culik, Juhani Karhumäki 

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92361

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

zbMATH Keywords

HDTOL relationn-tape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The inclusion problem for some classes of deterministic multitape automata
• HDTOL matching of computations of multitape automata
• The equivalence problem for deterministic two-tape automata
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• AFL with the semilinear property
• Intersections de langages algébriques bornes
• Title not available (Why is that?)

Cited In (4)

• On the equivalence problem for deterministic multitape automata and transducers
• HDTOL matching of computations of multitape automata
• Loops and overloops for tree-walking automata
• New techniques for proving the decidability of equivalence problem

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)