NFA Reduction Algorithms by Means of Regular Inequalities
- 18 June 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 194-205
- https://doi.org/10.1007/3-540-45007-6_15
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algorithms for Computing Small NFAsLecture Notes in Computer Science, 2002
- FA Minimisation Heuristics for a Class of Finite LanguagesLecture Notes in Computer Science, 2001
- Incremental construction of minimal acyclic finite state automata and transducersPublished by Association for Computational Linguistics (ACL) ,1998
- Rewriting regular inequalitiesLecture Notes in Computer Science, 1995
- Minimal NFA Problems are HardSIAM Journal on Computing, 1993
- Fast text searchingCommunications of the ACM, 1992
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier BV ,1971
- On the State Minimization of Nondeterministic Finite AutomataIEEE Transactions on Computers, 1970