A translational theorem for the class of EOL languages

DOI10.1016/S0019-9958(81)90198-4MaRDI QIDQ4745282zbMATH OpenFDO

Authors Joost Engelfriet, Grzegorz Rozenberg

Publication date 1981

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(81)90198-4

zbMATH Keywords

shufflecontext-free languagesEOL formsabstract families of languagescombinatorial results concerning EOL languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(3)

• Rational languages and the Burnside problem
• On the usefulness of bifaithful rational cones
• A combinatorial property of EOL languages

This page was built for publication: A translational theorem for the class of EOL languages

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