VC-dimensions of nondeterministic finite automata for words of equal length

01/07/2020
by   Bjørn Kjos-Hanssen, et al.
0

Ishigami and Tani studied VC-dimensions of deterministic finite automata. We obtain analogous results for the nondeterministic case by extending a result of Champarnaud and Pin, who proved that the maximal deterministic state complexity of a set of binary words of length n is ∑_i=0^nmin(2^i,2^2^n-i-1). We show that for the nondeterministic case, if we fully restrict attention to words of length n, then we at most need the strictly increasing initial terms in this sum.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/27/2020

From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata

The question whether P = NP revolves around the discrepancy between acti...
11/27/2019

Words With Few Palindromes, Revisited

In 2013, Fici and Zamboni proved a number of theorems about finite and i...
05/19/2021

Deciding FO2 Alternation for Automata over Finite and Infinite Words

We consider two-variable first-order logic FO^2 and its quantifier alter...
05/06/2021

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

We study the expressiveness and succinctness of good-for-games pushdown ...
02/05/2022

Logarithmic equal-letter runs for BWT of purely morphic words

In this paper we study the number r_bwt of equal-letter runs produced by...
02/13/2018

Lengths of Words Accepted by Nondeterministic Finite Automata

We consider two natural problems about nondeterministic finite automata....
02/21/2018

On detectability of labeled Petri nets and finite automata

Detectability is a basic property of dynamic systems: when it holds one ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.