Complexity of Operations on Cofinite Languages

13 years 6 months ago

Download www-lipn.univ-paris13.fr

We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the resulting minimal automata.

Frédérique Bassino, Laura Giambruno,

Real-time Traffic

Information Management | LATIN 2010 | Minimal Automata | Regular Operations | Worst Case Complexity |

claim paper

Related Content

» Engineering formal metatheory

» Deciding the finiteness of the number of simple permutations contained in a wreathclosed c...

» Orthogonal Concatenation Language Equations and State Complexity

» Nonterminal Complexity of Some Operations on ContextFree Languages

» Quotient Complexity of Regular Languages

» On the Topological Complexity of Weakly Recognizable Tree Languages

» Complex Lexicosyntactic Reformulation of Sentences Using Typed Dependency Representations

» Generating operation specifications from UML class diagrams A model transformation approac...

» Hitting the Wall What to Do When High Performing Scrum Teams Overwhelm Operations and Infr...

Post Info
More Details (n/a)

Added	14 Oct 2010
Updated	14 Oct 2010
Type	Conference
Year	2010
Where	LATIN
Authors	Frédérique Bassino, Laura Giambruno, Cyril Nicaud

Comments (0)

Sciweavers

Complexity of Operations on Cofinite Languages

Information Management | LATIN 2010 | Minimal Automata | Regular Operations | Worst Case Complexity |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers