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)

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

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)