A more efficient notion of zigzag stability
From MaRDI portal
Publication:4717039
DOI10.1051/ita/1996300301811zbMath0868.68072MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68N99: Theory of software
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