A more efficient notion of zigzag stability

DOI10.1051/ita/1996300301811zbMath0868.68072OpenAlexW135216162MaRDI QIDQ4717039

Bertrand Le Saëc, Bruno Patrou, Igor Litovsky

Publication date: 17 August 1997

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

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

zbMATH Keywords

zigzag stabilityzigzag submonoids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)
• A note on the reduction of two-way automata to one-way automata
• Stability for the zigzag submonoids
• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• Automates et codes zigzag
• On $z$-submonoids and $z$-codes
• On coding morphisms for zigzag codes

This page was built for publication: A more efficient notion of zigzag stability