Well quasi-orders and context-free grammars
From MaRDI portal
Publication:703570
DOI10.1016/J.TCS.2004.03.069zbMATH Open1071.68033OpenAlexW2003401299MaRDI QIDQ703570FDOQ703570
Authors: Flavio D'Alessandro, Stefano Varricchio 
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.069
Recommendations
Cites Work
- Title not available (Why is that?)
- The theory of well-quasi-ordering: a frequently discovered concept
- Title not available (Why is that?)
- Ordering by Divisibility in Abstract Algebras
- On regularity of context-free languages
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
- On the regularity of languages on a binary alphabet generated by copying systems
- On well quasi orders of free monoids
- On quasi orders of words and the confluence property
- Well quasi-orders and regular languages
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
Cited In (14)
- Well quasi-orders, unavoidable sets, and derivation systems
- Title not available (Why is that?)
- On total regulators generated by derivation relations
- On well quasiordering of finite languages
- Well Quasi-orders in Formal Language Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On regularity of context-free languages
- Well quasi-orders generated by a word-shuffle rewriting
- Well-quasi-orders and regular \(\omega\)-languages
- Stefano Varricchio (1960-2008)
- Title not available (Why is that?)
- Well quasi ordering finite posets and formal languages
- A characterization of (regular) circular languages generated by monotone complete splicing systems
This page was built for publication: Well quasi-orders and context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703570)
