Semi-discrete context-free languages†

DOI10.1080/00207168308803373zbMath0514.68072OpenAlexW2022200601MaRDI 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

zbMATH Keywords

decision problemsfinite alphabetsemi-discretediscrete context-free languagesdiscrete language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Star-free sets of integers ⋮ Word-paired catenations of regular languages ⋮ Periodic and Sturmian languages ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ On differentiation functions, structure functions, and related languages of context-free grammars ⋮ The single loop representations of regular languages ⋮ One-dimensional pattern generation by cellular automata ⋮ Two complexity measures for context-free languages ⋮ A characterization of poly-slender 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

This page was built for publication: Semi-discrete context-free languages^†