Fr. 110.00

Mark V Lawson, Mark V. Lawson, Lawson Mark V.

Finite Automata

English · Paperback / Softback

Shipping usually within 3 to 5 weeks

Description

List of contents

Introduction to Finite Automata. Recognisable Languages. Non-Deterministic Automata. e-Automata. Kleene's Theorem. Local Languages. Minimal Automata. The Transition Monoid. The Syntactic Monoid. Algebraic Language Theory. Star-Free Languages. Varieties of Languages. Appendix: Discrete Mathematics. Bibliography. Index

About the author

Lawson, Mark V.

Product details

Authors	Mark V Lawson, Mark V. Lawson, Lawson Mark V.
Publisher	Taylor & Francis Ltd.

Languages	English
Product format	Paperback / Softback
Released	25.09.2019

EAN	9780367394998
ISBN	978-0-367-39499-8
No. of pages	320
Subjects	Natural sciences, medicine, IT, technology > IT, data processing > Operating systems, user interfaces MATHEMATICS / Combinatorics, Combinatorics & graph theory, Combinatorics and graph theory

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.