scientific article; zbMATH DE number 3324737

zbMath0204.31801MaRDI QIDQ5602929

No author found.

Publication date: 1969

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

Unnamed Item ⋮ Data representation and computational complexity ⋮ On parsing two-level grammars ⋮ On generators and generative capacity of EOL forms ⋮ Colorings and interpretations: a connection between graphs and grammar forms ⋮ Concise description of finite languages ⋮ Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms ⋮ Surjectivity of functors on grammars ⋮ Context-free grammar forms ⋮ On non context-free grammar forms ⋮ Tree controlled grammars ⋮ The class of context-free languages is not an EOL family ⋮ On the inherent ambiguity of simple tuple languages ⋮ Complexity and decidability for chain code picture languages