Asymptotical behaviour of some non-uniform measures
From MaRDI portal
Publication:3833644
DOI10.1051/ita/1989230302811zbMath0677.68086MaRDI QIDQ3833644
Publication date: 1989
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92335
68Q45: Formal languages and automata
03D15: Complexity of computation (including implicit computational complexity)
94A17: Measures of information, entropy
Related Items
Cites Work
- On the length of word chains
- Concise description of finite languages
- Complexity measures for regular expressions
- Uniform characterizations of non-uniform complexity measures
- The Compilation of Regular Expressions into Integrated Circuits
- On the Length of Programs for Computing Finite Binary Sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item