Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.116
URN: urn:nbn:de:0030-drops-62518
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6251/
Tamm, Hellis
New Interpretation and Generalization of the Kameda-Weiner Method
| pdf-format: |
|
Abstract
We present a reinterpretation of the Kameda-Weiner method of finding a minimal nondeterministic finite automaton (NFA) of a language, in terms of atoms of the language. We introduce a method to generate NFAs from a set of languages, and show that the Kameda-Weiner method is a special case of it. Our method provides a unified view of the construction of several known NFAs, including the canonical residual finite state automaton and the atomaton of the language.
BibTeX - Entry
@InProceedings{tamm:LIPIcs:2016:6251,
author = {Hellis Tamm},
title = {{New Interpretation and Generalization of the Kameda-Weiner Method}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {116:1--116:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6251},
URN = {urn:nbn:de:0030-drops-62518},
doi = {10.4230/LIPIcs.ICALP.2016.116},
annote = {Keywords: Nondeterministic finite automata, NFA minimization, Kameda-Weinermethod, atoms of regular languages}
}
| Keywords: | Nondeterministic finite automata, NFA minimization, Kameda-Weinermethod, atoms of regular languages | |
| Seminar: | 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 23.08.2016 |
