scientific article; zbMATH DE number 3504474

MaRDI QIDQ4085271zbMATH OpenFDO

Authors A. L. Semenov

Publication date 1973

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(16)

• Chair of Mathematical Logic and Theory of Algorithms
• Classes of formal grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• scientific article; zbMATH DE number 7300346 (Why is no real title available?)
• scientific article; zbMATH DE number 7746261 (Why is no real title available?)
• There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages
• Checking whether two unambiguous context-free grammars describe the same set of strings of length n
• Syntax checking either way
• Weighted automata
• One application of real-valued interpretation of formal power series.
• Formal languages over GF(2)
• Unambiguous conjunctive grammars over a one-symbol alphabet
• ON APPLICATION OF MULTIDIMENSIONAL COMPLEX ANALYSIS IN FORMAL LANGUAGE AND GRAMMAR THEORY
• On Solvability of Systems of Symbolic Polynomial Equations
• The inclusion problem for some subclasses of context-free languages
• On equivalence of grammars through transformation trees

This page was built for publication:

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