Intersection and union of regular languages and state complexity
Information Processing Letters
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 1
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A family of NFAs which need 2n - α deterministic states
Theoretical Computer Science
On the state complexity of reversals of regular languages
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Magic numbers in the state hierarchy of finite automata
Information and Computation
Nonterminal Complexity of Some Operations on Context-Free Languages
Fundamenta Informaticae
Finite automata and their decision problems
IBM Journal of Research and Development
| Hi-index | 0.01 |
We investigate the deterministic and nondeterministic state complexity of languages that can be obtained as the concatenation of two regular languages represented by deterministic and nondeterministic finite automata. In the nondeterministic case, we show that the whole range of complexities from 1 to m + n can be obtained using a binary alphabet. In the deterministic case, we get the whole range of complexities from 1 to m ·2 n *** 2 n *** 1, however, to describe appropriate automata we use a growing alphabet.