Searching for "State Complexity of Regular Languages." – sorted by Relevance.
6 documents found, showing 1 through 6.
-
State Complexity of Regular Languages
- …State Complexity of Regular Languages Sheng Yu Department of Computer Science, University…
- Cited by 18 (1 self) – Add To MetaCart
-
K.: State complexity of basic operations on suffix-free regular languages
- …State Complexity of Basic Operations on Suffix-Free Regular Languages Yo-Sub Han 1,⋆ and Kai…
- Cited by 1 (1 self) – Add To MetaCart
-
Monoids and the state complexity of the operation root(L
- … the bounds on the state complexity of some different representations of regular languages. As well, we…
- Cited by 2 (0 self) – Add To MetaCart
-
Finding lower bounds for nondeterministic state complexity is hard (extended abstract
- … the nondeterministic state complexity of a regular language is known to be a computationally hard task, namely PSPACE…
- Cited by 3 (3 self) – Add To MetaCart
-
State complexity of union and intersection of finite languages
- … given regular language. There are many other results on state complexity with different viewpoints [4…
- Cited by 2 (2 self) – Add To MetaCart
-
Automaticity III: Polynomial Automaticity And Context-Free Languages
- … these questions and the notion of "state complexity" of regular languages, discussed, for example, in Yu et al…
- Cited by 5 (3 self) – Add To MetaCart
Showing 1 through 6.
