AbstractThe order of the language recognized by a nondeterministic finite automaton with n states is either infinite or at most 32n(n+1)−1. For each even n there is a deterministic finite automaton having n states and recognizing a language of order 2(n−2)2−1
Abstract. We investigate structures recognizable by finite state au-tomata with an input tape of len...
AbstractWe investigate the state complexity of some operations on binary regular languages. In parti...
AbstractA number d is magic for n, if there is no regular language for which an optimal nondetermini...
AbstractThe order of the language recognized by a nondeterministic finite automaton with n states is...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
It is known that an ordinal is the order type of the lexicographic ordering of a regular language if...
AbstractThe classical partial orders on strings (prefix, suffix, subsegment, subsequence, lexical, a...
It is known that an ordinal is the order type of the lexicographic ordering of a regular language if...
AbstractIt is well known that allowing nondeterminism in a finite automaton can produce in the most ...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
Abstract-This paper formulates a signed real measure for sublanguages of regular languages based on ...
AbstractWe consider the state complexities of some basic operations on regular languages. We show th...
AbstractGiven two regular languages R1 and R2 with R1⊆R2, one can effectively determine the number o...
AbstractThe number of states in a deterministic finite automaton (DFA) recognizing the language Lk, ...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
Abstract. We investigate structures recognizable by finite state au-tomata with an input tape of len...
AbstractWe investigate the state complexity of some operations on binary regular languages. In parti...
AbstractA number d is magic for n, if there is no regular language for which an optimal nondetermini...
AbstractThe order of the language recognized by a nondeterministic finite automaton with n states is...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
It is known that an ordinal is the order type of the lexicographic ordering of a regular language if...
AbstractThe classical partial orders on strings (prefix, suffix, subsegment, subsequence, lexical, a...
It is known that an ordinal is the order type of the lexicographic ordering of a regular language if...
AbstractIt is well known that allowing nondeterminism in a finite automaton can produce in the most ...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
Abstract-This paper formulates a signed real measure for sublanguages of regular languages based on ...
AbstractWe consider the state complexities of some basic operations on regular languages. We show th...
AbstractGiven two regular languages R1 and R2 with R1⊆R2, one can effectively determine the number o...
AbstractThe number of states in a deterministic finite automaton (DFA) recognizing the language Lk, ...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
Abstract. We investigate structures recognizable by finite state au-tomata with an input tape of len...
AbstractWe investigate the state complexity of some operations on binary regular languages. In parti...
AbstractA number d is magic for n, if there is no regular language for which an optimal nondetermini...
DOI
Add to ORKG