Skip to search formSkip to main contentSkip to account menu

The State Complexities of Some Basic Operations on Regular Languages

View via Publisher (opens in a new tab)

Minimal cover-automata for finite languages

This paper describes an efficient algorithm that, for a given DFA accepting a finite language, constructs a minimal deterministic finite cover- automaton of the language and gives algorithms for the boolean operations on deterministic cover automata, i.e., on the finite languages they represent.
View via Publisher (opens in a new tab)

State Complexity of Regular Languages

  • Sheng Yu
  • Computer Science, Linguistics
    J. Autom. Lang. Comb.
  • 1 February 2001
This work investigates the problems related to the state complexity of regular languages and their operations and compares the results on regular languages with those on nite languages.
View via Publisher (opens in a new tab)

Follow automata

View via Publisher (opens in a new tab)

A sharpening of the Parikh mapping

A sharpening of the Parikh map- ping is introduced and an interesting in- terconnection between mirror images of words and inverses of matrices is established.
View via Publisher (opens in a new tab)

Decision Problems for Patterns

We settle an open problem, the inclusion problem for pattern languages. This is the first known case where inclusion is undecidable for generative devices having a trivially decidable equivalence…
View via Publisher (opens in a new tab)

Algorithms for Computing Small NFAs

A way to convert regular expressions into NFAs which can be arbitrarily smaller than the position, partial derivative, and follow automata.
View via Publisher (opens in a new tab)

Pattern languages with and without erasing

The paper deals with the problems related to finding a pattern common to all words in a given set. We restrict our attention to patterns expressible by the use of variables ranging over words. Two…
View via Publisher (opens in a new tab)

On NFA Reductions

We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We develop restricted…
View via Publisher (opens in a new tab)

Reducing NFAs by invariant equivalences

View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)