
Implementation and application of automata
by Jean-Marc Champarnaud, Denis Maurel
No club is reading this yet — be the first to start one
Author: Jean-Marc Champarnaud, Denis Maurel
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40391-3
DOI: 10.1007/3-540-44977-9
Table of Contents:
- Edit-Distance of Weighted Automata
- p-Subsequentiable Transducers
- Bidirectional Push Down Automata
- Finite Automata and Non-self-Embedding Grammars
- Simulation of Gate Circuits in the Algebra of Transients
- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata
- Regex and Extended Regex
- Prime Decompositions of Regular Prefix Codes
- Implementation of Dictionaries via Automata and Decision Trees
- Feedback-Free Circuits in the Algebra of Transients
- On Minimizing Cover Automata for Finite Languages in O(n log n) Time
- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers
- Finite State Lazy Operations in NLP
- State Complexity of Basic Operations on Nondeterministic Finite Automata
- Adaptive Automata - A Revisited Proposal
- Efficient Automaton-Based Recognition for Linear Conjunctive Languages
- Syntactic Semiring and Language Equations
- Reduced Power Automata
- A Polynomial Time Algorithm for Left [Right] Local Testability
- Whale Calf, a Parser Generator for Conjunctive Grammars
Discuss Implementation and application of automata with other readers
Join or start a book club for Implementation and application of automata on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Implementation and application of automata?
Sign up free on Readfeed, then browse public clubs or start your own club with Implementation and application of automata as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Implementation and application of automata with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Implementation and application of automata with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.