An investigation is conducted of the Vapnik-Chervonenkis dimensions (VC-dimensions) of finite automata having k letters and n states. It is shown for a fixed positive integer k( 22) that (1) the VC-dimension of DFAk(n) := {Lc{1,2,...,k}\* : some deterministic finite automaton with at most n states a
Deterministic finite automata with recursive calls and DPDAs
β Scribed by Jean H. Gallier; Salvatore La Torre; Supratik Mukhopadhyay
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 127 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
We study deterministic finite automata (DFA) with recursive calls, that is, finite sequences of component DFAs that can call each other recursively. DFAs with recursive calls are akin to recursive state machines and unrestricted hierarchic state machines. We show that they are language equivalent to deterministic pushdown automata (DPDA).
π SIMILAR VOLUMES
An investigation is conducted of the Vapnik-Chervonenkis dimensions (VC-dimensions) of finite automata having k letters and n states. It is shown for a fixed positive integer k ( > 2), that (1) the VC-dimension of DFAk(n) := {L c{1,2,...,k}\* : some deterministic finite automaton with at most n stat
## Abstract We study the effect of Interference Cancellation (IC) on the Call Blocking Probabilities (CBP), in the uplink of WβCDMA networks supporting multiple serviceβclasses with finite number of traffic sources. We propose an approximate but recurrent formula for the calculation of the system s