The family of one-counter languages is closed under quotient

MaRDI QIDQ1070828zbMATH OpenFDO

Authors B. Leguy, B. Ratoandromanana, Michel Latteux

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

closure propertycontext-free languagelinear languagesrational transductionsrecursively enumerable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3974329
• Quotient and bounded context-free languages

Cited in

(7)

• On characterizations of recursively enumerable languages
• On representing recursively enumerable languages by internal contextual languages
• Weighted systems of equations
• Computing by splicing
• scientific article; zbMATH DE number 3958754 (Why is no real title available?)
• scientific article; zbMATH DE number 3974329 (Why is no real title available?)
• State complexity of the quotient operation on input-driven pushdown automata

This page was built for publication: The family of one-counter languages is closed under quotient

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