Two complexity measures for context-free languages
From MaRDI portal
Publication:3821606
DOI10.1080/00207168808803681zbMath0668.68080MaRDI QIDQ3821606
Publication date: 1988
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168808803681
context-free languages; regular languages; complex measures; weak identity; pure iterative languages
68Q45: Formal languages and automata
Cites Work