State complexity of basic operations on suffix-free regular languages

Published 2009 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
State complexity of basic operations on suffix-free regular languages
Authors
Keywords
-
Journal
THEORETICAL COMPUTER SCIENCE
Volume 410, Issue 27-29, Pages 2537-2548
Publisher
Elsevier BV
Online
2009-01-09
DOI
10.1016/j.tcs.2008.12.054

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.