Efficient implementation of regular languages using reversed alternating finite automata
From MaRDI portal
Publication:1575901
DOI10.1016/S0304-3975(99)00020-1zbMath0951.68061MaRDI QIDQ1575901
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ On the Hopcroft's minimization technique for DFA and DFCA
Uses Software
Cites Work
- On equations for regular languages, finite automata, and sequential networks
- Affine automata and related techniques for generation of complex images
- Statecharts: a visual formalism for complex systems
- Succinct representation of regular languages by Boolean automata
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Parametrized recurrent systems for image generation
- Constructions for alternating finite automata∗
- Alternation
- Minimal NFA Problems are Hard
- Two-level logic minimization: an overview
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient implementation of regular languages using reversed alternating finite automata
