On the separability of sparse context-free languages and of bounded rational relations
From MaRDI portal
Publication:995585
DOI10.1016/J.TCS.2007.04.003zbMATH Open1188.68170OpenAlexW2013770373MaRDI QIDQ995585FDOQ995585
Authors: Christian Choffrut, Stefano Varricchio, Flavio D'Alessandro 
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.003
Recommendations
- On the structure and complexity of rational sets of regular languages
- scientific article; zbMATH DE number 3856432
- Independence results about context-free languages and lower bounds
- Context-Sensitive Languages, Rational Graphs and Determinism
- scientific article
- scientific article; zbMATH DE number 3943060
- scientific article
- A complete refinement procedure for regular separability of context-free languages
- On the separation question for tree languages
- On the separation question for tree languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularity and Related Problems for Deterministic Pushdown Automata
- A regularity test for pushdown machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of the counting function of sparse context-free languages.
- Bounded Regular Sets
- Title not available (Why is that?)
- A characterization of poly-slender context-free languages
- Title not available (Why is that?)
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
Cited In (3)
This page was built for publication: On the separability of sparse context-free languages and of bounded rational relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995585)
