Automates boustrophédon et mots infinis

DOI10.1016/0304-3975(85)90009-XzbMath0571.68074OpenAlexW2091635400MaRDI QIDQ1061503

Jean-Pierre Pecuchet

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90009-x

zbMATH Keywords

regular languageomega languagetwo-way finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA ⋮ Partially Ordered Two-Way Büchi Automata ⋮ Unnamed Item ⋮ On the complementation of Büchi automata ⋮ Outils et résultats pour les transducteurs boustrophédons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automates boustrophédon et mots infinis