On the impossibility of the homomorphic characterization of context- sensitive languages

DOI10.1016/0304-3975(86)90119-2zbMATH Open0609.68049OpenAlexW2076100617WikidataQ121832284 ScholiaQ121832284MaRDI QIDQ1087019FDOQ1087019

Authors: Satoshi Okawa, S. Hirose, Masaaki Yoneda 

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90119-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Left universal context-free grammars and homomorphic characterizations of languages

Cited In (3)

• \(\mathcal{L}\)-reduction computation revisited
• On ``inherently context-sensitive languages -- an application of complexity cores
• REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS

This page was built for publication: On the impossibility of the homomorphic characterization of context- sensitive languages

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