Automates boustrophédon et mots infinis
- 31 December 1985
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 35, 115-122
- https://doi.org/10.1016/0304-3975(85)90009-x
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Automates boustrophedon, semi-groupe de Birget et monoïde inversif libreRAIRO. Informatique théorique, 1985
- The Reduction of Two-Way Automata to One-Way AutomataIBM Journal of Research and Development, 1959