File:AdaptiveDFA-Bc (copy)-pg113.pdf
AdaptiveDFA-Bc_(copy)-pg113.pdf (file size: 109 KB, MIME type: application/pdf)
Adaptive D. F. Automata based on array of sets by Dan Popa, from Bacau. This paper is a part of the theory of Adaptive Automata - a new branch (2005) of the well known domain: Formal Languages and Automata. Actrually Adaptive Automata is a branch which is opened now, after almost 30 years of no discoveries. In fact the LFA and DFA branch was considered a closed branch of mathematics. Due to some problems of the original website the .pdf of the paper was rebuild and uploaded here. The Adaptive DFA was also implemented in: Haskell, C++, Oberon-2.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 21:36, 4 February 2010 | (109 KB) | Ha$kell (talk | contribs) | Adaptive D. F. Automata based on array of sets by Dan Popa, from Bacau. This paper is a part of the theory of Adaptive Automata - a new branch (2005) of the well known domain: Formal Languages and Automata. Actrually Adaptive Automata is a branch which i |
You cannot overwrite this file.
File usage
There are no pages that use this file.