Semi-discrete context-free languages†

DOI10.1080/00207168308803373MaRDI QIDQ3660939zbMATH OpenOpenAlexFDO

Authors 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 problemsdiscrete context-free languagesdiscrete languagefinite alphabetsemi-discrete

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A new proof of two theorems about rational transductions
• AFL with the semilinear property
• Générateurs algébriques et systèmes de paires iterantes
• H-bounded and semi-discrete languages
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Hypercodes in deterministic and slender 0L languages
• Langages algébriques, paires iterantes et transductions rationnelles
• On the periodicity of word-length in DOL languages
• The length sets of D0L languages are uniformly bounded
• Une hiérarchie des parties rationnelles de N2

Cited in

(10)

• 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
• 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
• Real-time pattern generation by one-dimensional cellular automata
• Periodic and Sturmian languages

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

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