Automates boustrophédon et mots infinis
type: Item
instance of: scholarly article
title: Automates boustrophédon et mots infinis
zbMATH Open document ID: 0571.68074
DOI: 10.1016/0304-3975(85)90009-X
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: We show that the \(\omega\)-language accepted by a two-way finite automaton is regular. The result is effective.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3911749
zbMATH Keywords: omega language
zbMATH Keywords: regular language
zbMATH Keywords: two-way finite automaton
author: Jean-Pierre Pecuchet
MaRDI profile type: Publication
cites work: Q4079524
cites work: Q3857704
cites work: Q3741089
cites work: Q5541340
full work available at URL: 0304-3975(85)90009-x
OpenAlex ID: W2091635400
description: scientific article; zbMATH DE number 3911749