The family of one-counter languages is closed under quotient

zbMath0585.68069MaRDI QIDQ1070828

B. Ratoandromanana, B. Leguy, Michel Latteux

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

context-free languageclosure propertyrecursively enumerable languagelinear languagesrational transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Computing by splicing ⋮ State Complexity of the Quotient Operation on Input-Driven Pushdown Automata ⋮ On characterizations of recursively enumerable languages ⋮ On representing recursively enumerable languages by internal contextual languages ⋮ Weighted systems of equations

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