Semi-discrete context-free languages†
From MaRDI portal
Publication:3660939
DOI10.1080/00207168308803373zbMath0514.68072MaRDI QIDQ3660939
Michel Latteux, Gabriel Thierrin
Publication date: 1983
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168308803373
decision problems; finite alphabet; semi-discrete; discrete context-free languages; discrete language
68Q45: Formal languages and automata
Related Items
A characterization of poly-slender context-free languages, On differentiation functions, structure functions, and related languages of context-free grammars, One-dimensional pattern generation by cellular automata, Periodic and Sturmian languages, Star-free sets of integers, The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index, The single loop representations of regular languages, Word-paired catenations of regular languages, Two complexity measures for context-free languages
Cites Work
- Unnamed Item
- Unnamed Item
- Langages algébriques, paires iterantes et transductions rationnelles
- A new proof of two theorems about rational transductions
- Générateurs algébriques et systèmes de paires iterantes
- The length sets of D0L languages are uniformly bounded
- AFL with the semilinear property
- Hypercodes in deterministic and slender 0L languages
- H-bounded and semi-discrete languages
- On the periodicity of word-length in DOL languages
- Une hiérarchie des parties rationnelles de N2