Outils et résultats pour les transducteurs boustrophédons

DOI10.1051/ITA/1986200302211MaRDI QIDQ4728282zbMATHOpenAlexFDO

Authors Brigitte Rozoy

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

zbMATH Keywords

iterationDyck languagetwo-way transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3917738
• On two-way transducers
• A pumping lemma for two-way finite transducers
• Two-way transducers with a two-way output tape
• Uniformisation of two-way transducers

Cites work

• scientific article; zbMATH DE number 3839348 (Why is no real title available?)
• scientific article; zbMATH DE number 3878381 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3915644 (Why is no real title available?)
• scientific article; zbMATH DE number 3917738 (Why is no real title available?)
• scientific article; zbMATH DE number 3976380 (Why is no real title available?)
• scientific article; zbMATH DE number 3658994 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3669877 (Why is no real title available?)
• scientific article; zbMATH DE number 3589737 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A propos du lemme de substitution
• Absolutely parallel grammars and two-way finite-state transducers
• An analog of a theorem about context-free languages
• Automates boustrophédon et mots infinis
• Checking automata and one-way stack languages
• Deux Familles de Langages Incomparables
• On ETOL systems of finite index
• On a Special Class of Recurrent Events
• On the effect of the finite index restriction on several families of grammars
• On the index of a context-free grammar and language
• On the index of grammars and languages
• On two-way sequential transductions of full semi-AFL's
• One way finite visit automata
• Remarks on blind and partially blind one-way multicounter machines
• Scattered context grammars
• Two-way sequential transductions and stack automata

Cited in

(2)

• A pumping lemma for two-way finite transducers
• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index

This page was built for publication: Outils et résultats pour les transducteurs boustrophédons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728282)