Efficient implementation of regular languages using reversed alternating finite automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 579921 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- Affine automata and related techniques for generation of complex images
- Alternation
- Constructions for alternating finite automata∗
- Minimal NFA Problems are Hard
- On equations for regular languages, finite automata, and sequential networks
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Parametrized recurrent systems for image generation
- Statecharts: a visual formalism for complex systems
- Succinct representation of regular languages by Boolean automata
- Two-level logic minimization: an overview
Cited in
(5)- scientific article; zbMATH DE number 1452984 (Why is no real title available?)
- On the Hopcroft's minimization technique for DFA and DFCA
- Equations and regular-like expressions for afa
- Hopcroft’s Minimization Technique: Queues or Stacks?
- A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
This page was built for publication: Efficient implementation of regular languages using reversed alternating finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575901)
