Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)

DOI10.1016/0304-3975(90)90083-TzbMath0701.68057MaRDI QIDQ914396

Marcella Anselmo

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular languagetwo-way automatazigzag codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Related Items (6)

On coding morphisms for zigzag codes ⋮ The operation \(\uparrow\) on formal power series ⋮ Stability for the zigzag submonoids ⋮ A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes ⋮ The zig-zag power series: A two-way version of the \({}^*\) operator. ⋮ A more efficient notion of zigzag stability

Cites Work

• Concatenation of inputs in a two-way automaton
• Semigroups and one-way functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)