Characterization theorems on abstract families of transducers

DOI10.1016/0020-0255(75)90025-0zbMath0337.68056OpenAlexW2066185596MaRDI QIDQ1230515

Etsuro Moriya

Publication date: 1975

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(75)90025-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A note on dpda transductions of {0,1}^∗and inverse dpda transductions of the dyck set

Cites Work

• Checking automata and one-way stack languages
• Principal AFL
• Absolutely parallel grammars and two-way finite-state transducers
• Stack automata and compiling
• Control sets on grammars
• A note on preservation of languages by transducers
• One-way stack automata
• Preservation of languages by transducers
• Studies in abstract families of languages
• Two-way sequential transductions and stack automata

This page was built for publication: Characterization theorems on abstract families of transducers