Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  Bestsellers

  • articleNo Access

    Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets

  • articleOpen Access

    Image-Binary Automata

  • articleNo Access

    Compressed Structures for Partial Derivative Automata Constructions

  • articleNo Access

    Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

  • articleNo Access

    Binary Coded Unary Regular Languages

  • articleNo Access

    Operations on Boolean and Alternating Finite Automata

  • articleNo Access

    GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS

  • articleNo Access

    UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION

  • articleNo Access

    A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM

  • articleNo Access

    The Equivalence Problem of Finite Substitutions on ab*c, with Applications

  • articleNo Access

    LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES

  • articleNo Access

    FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS

  • articleNo Access

    DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY

  • articleNo Access

    A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT

  • articleNo Access

    HYBRID EXTENDED FINITE AUTOMATA

  • articleNo Access

    AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL

  • articleNo Access

    THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS

  • articleNo Access

    STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION

  • articleNo Access

    IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR

  • articleNo Access

    THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES