scientific article; zbMATH DE number 1747450
From MaRDI portal
Publication:4531381
zbMATH Open1004.68077MaRDI QIDQ4531381FDOQ4531381
Authors: Ming-wei Wang, Jeffrey Shallit 
Publication date: 29 May 2002
Title of this publication is not available (Why is that?)
Recommendations
- A linearly computable measure of string complexity
- Complexity of automatic sequences
- Complexity of automatic sequences
- The combinatorial complexity of a finite string
- An Evaluation of Automata Algorithms for String Analysis
- scientific article; zbMATH DE number 2087550
- scientific article; zbMATH DE number 1336330
- The complexity of computing the number of strings of given length in context-free languages
- On the complexity of automatic complexity
- On the complexity of random strings
Cited In (27)
- Algorithmic introduction of quantified cuts
- Automatic complexity of Fibonacci and tribonacci words
- An incompressibility theorem for automatic complexity
- The Complexity of Complexity
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- An Evaluation of Automata Algorithms for String Analysis
- Finite state complexity
- Kolmogorov structure functions for automatic complexity in computational statistics
- Separating strings with small automata
- Conditional automatic complexity and its metrics
- Automatic complexity of shift register sequences
- A linearly computable measure of string complexity
- Automatic complexity. A computable measure of irregularity
- Maximizing T-complexity
- Simulating finite automata with context-free grammars.
- Kolmogorov structure functions for automatic complexity
- Finite-state independence
- An improvement of subword complexity
- Compressibility of Finite Languages by Grammars
- Complexity of strings in the class of Markov sources
- Title not available (Why is that?)
- The combinatorial complexity of a finite string
- Nondeterministic automatic complexity of overlap-free and almost square-free words
- Title not available (Why is that?)
- On the complexity of automatic complexity
- String Analysis via Automata Manipulation with Logic Circuit Representation
- VC-dimensions of nondeterministic finite automata for words of equal length
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 Q4531381)
