Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet

DOI10.1016/j.ic.2019.104442zbMath1435.68153arXiv1805.04003OpenAlexW2970365824MaRDI QIDQ2280321

Stefano Crespi Reghizzi, Pierluigi San Pietro

Publication date: 18 December 2019

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.04003

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Limited automata and unary languages ⋮ Special issue: selected papers of the 10th international conference on language and automata theory and applications, LATA 2016

Uses Software

• LANGAGE

Cites Work

• An elementary proof of a generalization of double Greibach normal form
• Position-restricted grammar forms and grammars
• An elementary proof of double Greibach normal form
• Families of locally testable languages
• The Missing Case in Chomsky-Schützenberger Theorem
• FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
• Non-erasing Variants of the Chomsky–Schützenberger Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet