Outils et résultats pour les transducteurs boustrophédons
From MaRDI portal
Publication:4728282
DOI10.1051/ita/1986200302211zbMath0617.68073OpenAlexW30276727MaRDI QIDQ4728282
Publication date: 1986
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92258
Related Items (1)
Cites Work
- Automates boustrophédon et mots infinis
- A propos du lemme de substitution
- One way finite visit automata
- On two-way sequential transductions of full semi-AFL's
- Remarks on blind and partially blind one-way multicounter machines
- Checking automata and one-way stack languages
- Scattered context grammars
- Absolutely parallel grammars and two-way finite-state transducers
- Deux Familles de Langages Incomparables
- On the index of grammars and languages
- On ETOL systems of finite index
- On the effect of the finite index restriction on several families of grammars
- On the index of a context-free grammar and language
- An analog of a theorem about context-free languages
- Two-way sequential transductions and stack automata
- On a Special Class of Recurrent Events
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Outils et résultats pour les transducteurs boustrophédons