Equivalence problem of mappings relative to languages

DOI10.1007/BF02366577zbMath0879.68067MaRDI QIDQ1364102

L. P. Lisovik, V. A. Kanivets

Publication date: 24 August 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

\(\Sigma TC\)-generated languagespalindromicity problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• 2DST mappings of languages and related problems
• One way finite visit automata
• On the decidability of homomorphism equivalence for languages
• On vector languages
• Controlled pushdown automata
• Finite-turn checking automata
• Absolutely parallel grammars and two-way finite-state transducers
• The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
• On some transducer equivalence problems for families of languages
• Simple matrix languages

This page was built for publication: Equivalence problem of mappings relative to languages