scientific article; zbMATH DE number 3504474

zbMATH Open0322.68052MaRDI QIDQ4085271FDOQ4085271

A. L. Semenov

Publication date: 1973

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (14)

• Classes of formal grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Syntax checking either way
• There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages
• Weighted automata
• One application of real-valued interpretation of formal power series.
• Formal languages over GF(2)
• ON APPLICATION OF MULTIDIMENSIONAL COMPLEX ANALYSIS IN FORMAL LANGUAGE AND GRAMMAR THEORY
• Unambiguous conjunctive grammars over a one-symbol alphabet
• 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)