├── .idea ├── automata_python.iml ├── inspectionProfiles │ ├── Project_Default.xml │ └── profiles_settings.xml ├── misc.xml ├── modules.xml ├── vcs.xml └── workspace.xml ├── LICENSE.md ├── PKG-INFO ├── README.md ├── automata ├── __init__.py ├── __pycache__ │ └── __init__.cpython-35.pyc ├── data_structures │ ├── __init__.py │ ├── __pycache__ │ │ ├── Stack.cpython-35.pyc │ │ └── __init__.cpython-35.pyc │ └── stack.py ├── fa │ ├── DFA.py │ ├── Mealy.py │ ├── Moore.py │ ├── NDFA.py │ ├── __init__.py │ └── __pycache__ │ │ ├── DFA.cpython-35.pyc │ │ ├── Mealy.cpython-35.pyc │ │ ├── Moore.cpython-35.pyc │ │ └── __init__.cpython-35.pyc ├── language.py └── testing.py ├── automata_python.egg-info ├── PKG-INFO ├── SOURCES.txt ├── dependency_links.txt └── top_level.txt ├── dist ├── automata_python-0.0.1.tar.gz └── automata_python-0.0.3.tar.gz ├── images ├── automata-header.png └── automatasub.png ├── setup.cfg └── setup.py /.idea/automata_python.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 11 | -------------------------------------------------------------------------------- /.idea/inspectionProfiles/Project_Default.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 10 | -------------------------------------------------------------------------------- /.idea/inspectionProfiles/profiles_settings.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 7 | -------------------------------------------------------------------------------- /.idea/misc.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | -------------------------------------------------------------------------------- /.idea/modules.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /.idea/vcs.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /.idea/workspace.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 17 | 18 | 19 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 55 | 56 | 57 | 59 | 60 | 72 | 73 | 74 | 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | Spelling 86 | 87 | 88 | 89 | 90 | SpellCheckingInspection 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 | 101 | 102 | 103 | 104 | 105 | 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 | 126 | 129 | 130 | 131 | 132 | 135 | 136 | 139 | 140 | 141 | 142 | 145 | 146 | 149 | 150 | 153 | 154 | 155 | 156 | 159 | 160 | 163 | 164 | 167 | 168 | 171 | 172 | 173 | 174 | 177 | 178 | 181 | 182 | 185 | 186 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 200 | 201 | 202 | 203 | 204 | 205 | 206 | 207 | 208 | 224 | 225 | 241 | 242 | 258 | 259 | 275 | 276 | 292 | 293 | 309 | 310 | 321 | 322 | 340 | 341 | 359 | 360 | 380 | 381 | 402 | 403 | 426 | 427 | 428 | 429 | 430 | 431 | 432 | 433 | 434 | 435 | 436 | 437 | 438 | 439 | 440 | 441 | 442 | 443 | 444 | 446 | 447 | 448 | 449 | 450 | 451 | 452 | 1477046847376 453 | 457 | 458 | 459 | 460 | 461 | 462 | 463 | 464 | 465 | 466 | 467 | 468 | 469 | 470 | 471 | 472 | 473 | 474 | 475 | 476 | 477 | 478 | 479 | 480 | 481 | 482 | 483 | 484 | 487 | 490 | 491 | 492 | 494 | 495 | 496 | 497 | 498 | 499 | 500 | 501 | 502 | 503 | 504 | 505 | 506 | 507 | 508 | 509 | 510 | 511 | 512 | 513 | 514 | 515 | 516 | 517 | 518 | 519 | 520 | 521 | 522 | 523 | 524 | 525 | 526 | 527 | 528 | 529 | 530 | 531 | 532 | 533 | 534 | 535 | 536 | 537 | 538 | 539 | 540 | 541 | 542 | 543 | 544 | 545 | 546 | 547 | 548 | 549 | 550 | 551 | 552 | 553 | 554 | 555 | 556 | 557 | 558 | 559 | 560 | 561 | 562 | 563 | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | 574 | 575 | 576 | 577 | 578 | 579 | 580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 | 590 | 591 | 592 | 593 | 594 | 595 | 596 | 597 | 598 | 599 | 600 | 601 | 602 | 603 | 604 | 605 | 606 | 607 | 608 | 609 | 610 | 611 | 612 | 613 | 614 | 615 | 616 | 617 | 618 | 619 | 620 | 621 | 622 | 623 | 624 | 625 | 626 | 627 | 628 | 629 | 630 | 631 | -------------------------------------------------------------------------------- /LICENSE.md: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | automata_python Copyright (C) 2016 Hemang S Kumar 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /PKG-INFO: -------------------------------------------------------------------------------- 1 | Metadata-Version: 0.0.1 2 | Name: automata_python 3 | Version: 0.0.3 4 | Summary: Python Automata Library 5 | Home-page: https://github.com/hemangsk/automata-python 6 | Author: Hemang Kumar 7 | Author-email: hemangsk@gmail.com 8 | License: GPLv3 9 | Description: Automata-Python 10 | ======== 11 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # automata_python 2 | 3 | 4 |

5 | 6 | 7 | 8 | 9 | 10 |

11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | ## Installation 19 | 20 | - Using PIP 21 | 22 | ``` 23 | pip install automata_python 24 | ``` 25 | 26 | - Using GitHub 27 | 28 | ``` 29 | git clone https://github.com/hemangsk/automata-python.git 30 | ``` 31 | 32 | 33 | ## Project Structure 34 | 35 |

automata

36 | 37 | -

fa 39 |: finite automata package

42 | -

data-structures: contains the data structures used

46 | 47 | 48 | 49 |

50 | 51 | -

DFA 53 |: Deterministic Finite Automata

56 | -

NDFA: Non Deterministic Finite Automata

60 | -

Mealy: Mealy Machine

64 | -

Moore: Moore Machine

68 | 69 | 70 |

data-structures

71 | 72 | -

Stack 74 |: The class implementing Stack

77 | -------------------------------------------------------------------------------- /automata/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/__init__.py -------------------------------------------------------------------------------- /automata/__pycache__/__init__.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/__pycache__/__init__.cpython-35.pyc -------------------------------------------------------------------------------- /automata/data_structures/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/data_structures/__init__.py -------------------------------------------------------------------------------- /automata/data_structures/__pycache__/Stack.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/data_structures/__pycache__/Stack.cpython-35.pyc -------------------------------------------------------------------------------- /automata/data_structures/__pycache__/__init__.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/data_structures/__pycache__/__init__.cpython-35.pyc -------------------------------------------------------------------------------- /automata/data_structures/stack.py: -------------------------------------------------------------------------------- 1 | class Stack: 2 | 3 | def __init__(self): 4 | self.stack = [] 5 | 6 | def push(self, item): 7 | self.stack.append((item)) 8 | 9 | def pop(self): 10 | return self.stack.pop() 11 | 12 | def isEmpty(self): 13 | return self.stack == [] 14 | 15 | def size(self): 16 | return len(self.stack) 17 | 18 | def top(self): 19 | return self.stack[self.size() - 1] 20 | 21 | def __contains__(self, item): 22 | for x in self.stack: 23 | #print ("in Stack" + str(x)) 24 | if x == item: 25 | return True 26 | 27 | return False 28 | 29 | 30 | def __str__(self): 31 | output = "[ " 32 | for x in self.stack: 33 | output += str(x) 34 | output += ", " 35 | 36 | return output[:-2] + " ]" -------------------------------------------------------------------------------- /automata/fa/DFA.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | 4 | class DFA(object): 5 | """Deterministic Finite Automata""" 6 | 7 | def __init__(self, states, alphabet, transitions, initial_state, final_states): 8 | """ 9 | Q is a finite set of states. 10 | 11 | sigma is a finite set of symbols called the alphabet. 12 | 13 | delta is the list of transitions based on transition relation. 14 | 15 | q0 is the initial state from where any input is processed (q0 ∈ Q). 16 | 17 | F is a set of final state/states of Q (F ⊆ Q). 18 | """ 19 | 20 | self.states = states #list 21 | self.alphabet = alphabet #list 22 | self.transitions = transitions #dict 23 | self.initial_state = initial_state #char 24 | self.final_states = final_states #list 25 | 26 | """ 27 | states=['q0', 'q1'], 28 | alphabets=['a', 'b'], 29 | transitions={ 30 | 'q0': {'a': 'q0', 'b': 'q1'}, 31 | 'q1': {'a': 'q0', 'b': 'q1'}, 32 | }, 33 | initial_state='q0', 34 | final_states=['q1'] 35 | """ 36 | 37 | def is_string_valid(self, string): 38 | """Return True if string is accepted by DFA, otherwise return False""" 39 | 40 | inputs = list(string) 41 | current_state = self.initial_state 42 | 43 | for letter in inputs: 44 | try: 45 | 46 | if letter in self.transitions[current_state]: 47 | current_state = self.transitions[current_state][letter] 48 | 49 | else: 50 | return False 51 | except KeyError as e: 52 | return False 53 | 54 | if current_state in self.final_states: 55 | return True 56 | 57 | return False 58 | 59 | def minimize(self): 60 | 61 | state_list = [list(set(self.states) - set(self.final_states)), self.final_states] 62 | 63 | foo_dict = {} 64 | final_list = [] 65 | 66 | while(1): 67 | 68 | if state_list == final_list : 69 | break 70 | final_list, foo_dict = self.create_foo_dict(state_list, foo_dict) 71 | state_list = self.create_state_list(foo_dict) 72 | 73 | new_states_dict = {} 74 | minified_initial_state = '' 75 | minified_states = [] 76 | minified_final_states = [] 77 | i = 0 78 | for x in state_list: 79 | for y in x: 80 | string = 'P' + str(i) 81 | new_states_dict[y] = string 82 | if y in self.final_states and string not in minified_final_states: 83 | minified_final_states.append(string) 84 | 85 | if y == self.initial_state and minified_initial_state == '': 86 | minified_initial_state = string 87 | 88 | if string not in minified_states: 89 | minified_states.append(string) 90 | 91 | i += 1 92 | 93 | minified_transitions = {} 94 | for x in self.alphabet: 95 | for s in self.states: 96 | try: 97 | minified_transitions[new_states_dict[s]][x] = new_states_dict[self.transitions[s][x]] 98 | except KeyError as e: 99 | minified_transitions[new_states_dict[s]] = {} 100 | minified_transitions[new_states_dict[s]][x] = new_states_dict[self.transitions[s][x]] 101 | 102 | minified_dfa = DFA(minified_states, self.alphabet, minified_transitions, minified_initial_state, minified_final_states) 103 | print(minified_dfa) 104 | 105 | def create_state_list(self, foo_dict): 106 | temp_list = [] 107 | for x in foo_dict.keys(): 108 | temp_list.append(foo_dict[x]) 109 | 110 | temp_list_2 = [] 111 | for x in temp_list: 112 | if x not in temp_list_2: 113 | temp_list_2.append(x) 114 | 115 | state_list = [] 116 | 117 | for x in temp_list_2: 118 | state_list_element = [] 119 | for k,v in foo_dict.items(): 120 | if v == x: 121 | state_list_element.append(k) 122 | state_list.append(state_list_element) 123 | 124 | return state_list 125 | 126 | def create_foo_dict(self, state_list, foo_dict): 127 | 128 | for x in self.states: 129 | for a in self.alphabet: 130 | for y in state_list: 131 | if self.transitions[x][a] in y: 132 | try: 133 | foo_dict[x].append(state_list.index(y)) 134 | except KeyError as e: 135 | foo_dict[x] = [] 136 | foo_dict[x].append(state_list.index(y)) 137 | 138 | return state_list, foo_dict 139 | 140 | def __str__(self): 141 | """"Pretty Print the DFA""" 142 | 143 | output = "\nDeterministic Finite Automata" + \ 144 | "\nStates " + str(self.states) + \ 145 | "\nAlphabet " + str(self.alphabet) + \ 146 | "\nTransitions " + str(self.transitions) + \ 147 | "\nInital State " + str(self.initial_state) + \ 148 | "\nFinal States " + str(self.final_states) 149 | 150 | return output 151 | 152 | 153 | 154 | 155 | d = DFA( 156 | ['q0', 'q1', 'q2', 'q3', 'q4', 'q5', 'q6', 'q7', 'q8','q9','q10'], 157 | ['a', 'b'], 158 | { 159 | 160 | 'q0': {'a': 'q3', 'b': 'q2'}, 161 | 'q1': {'a': 'q6', 'b': 'q2'}, 162 | 'q2': {'a': 'q8', 'b': 'q5'}, 163 | 'q3': {'a': 'q0', 'b': 'q1'}, 164 | 'q4': {'a': 'q2', 'b': 'q5'}, 165 | 'q5': {'a': 'q4', 'b': 'q3'}, 166 | 'q6': {'a': 'q1', 'b': 'q0'}, 167 | 'q7': {'a': 'q4', 'b': 'q6'}, 168 | 'q8': {'a': 'q2', 'b': 'q7'}, 169 | 'q9': {'a': 'q7', 'b': 'q10'}, 170 | 'q10': {'a': 'q5', 'b': 'q9'} 171 | 172 | }, 173 | 'q0', 174 | ['q3', 'q4', 'q6','q8'] 175 | ) 176 | 177 | d.minimize() 178 | """ 179 | print(d.is_string_valid('ababba')) 180 | print(d.convert_to_dfa()) 181 | print(d) 182 | """ -------------------------------------------------------------------------------- /automata/fa/Mealy.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | 4 | 5 | class Mealy(object): 6 | """Mealy Machine : Finite Automata with Output """ 7 | 8 | def __init__(self, states, input_alphabet, output_alphabet, transitions, initial_state): 9 | """ 10 | 6 tuple (Q, ∑, O, δ, X, q0) where − 11 | 12 | states is a finite set of states. 13 | 14 | alphabet is a finite set of symbols called the input alphabet. 15 | 16 | output_alphabet is a finite set of symbols called the output alphabet. 17 | 18 | transitions is the resultant data dictionary of input and output transition functions 19 | 20 | initial_state is the initial state from where any input is processed (q0 ∈ Q). 21 | """ 22 | self.states = states 23 | self.input_alphabet = input_alphabet 24 | self.output_alphabet = output_alphabet 25 | self.transitions = transitions 26 | self.initial_state = initial_state 27 | 28 | def get_output_from_string(self, string): 29 | """Return Mealy Machine's output when a given string is given as input""" 30 | 31 | temp_list = list(string) 32 | current_state = self.initial_state 33 | output = '' 34 | for x in temp_list: 35 | output+= self.transitions[current_state][x][1] 36 | current_state = self.transitions[current_state][x][0] 37 | 38 | return output 39 | 40 | def convert_to_moore(self): 41 | moore_transitions = {} 42 | temp_list = [] 43 | moore_output_table = {} 44 | moore_initial_state = self.initial_state 45 | for x in self.transitions.keys(): 46 | for a in self.input_alphabet: 47 | temp_list.append(self.transitions[x][a]) 48 | 49 | temp_list_2 = [] 50 | for x in temp_list: 51 | for y in temp_list: 52 | if x[0] == y[0] and x[1] != y[1]: 53 | if x not in temp_list_2 and y not in temp_list_2: 54 | temp_list_2.append(x) 55 | temp_list_2.append(y) 56 | 57 | temp_list_3 = [] 58 | for x in temp_list_2: 59 | if x[0] not in temp_list_3: 60 | temp_list_3.append(x[0]) 61 | 62 | if self.initial_state in temp_list_3: 63 | moore_initial_state = self.initial_state + self.output_alphabet[0] 64 | 65 | for x in temp_list_2: 66 | for a in self.input_alphabet: 67 | if self.transitions[x[0]][a][0] in temp_list_3: 68 | next_state = self.transitions[x[0]][a][0] 69 | output = self.transitions[x[0]][a][1] 70 | 71 | next_state = next_state + output 72 | try: 73 | moore_transitions[x[0] + x[1]][a] = next_state 74 | except KeyError as e: 75 | moore_transitions[x[0] + x[1]] = {} 76 | moore_transitions[x[0] + x[1]][a] = next_state 77 | 78 | if next_state not in moore_output_table.keys(): 79 | moore_output_table[next_state] = output 80 | 81 | else: 82 | try: 83 | moore_transitions[x[0] + x[1]][a] = self.transitions[x[0]][a][0] 84 | except KeyError as e: 85 | moore_transitions[x[0] + x[1]] = {} 86 | moore_transitions[x[0] + x[1]][a] = self.transitions[x[0]][a][0] 87 | 88 | if moore_transitions[x[0] + x[1]][a] not in moore_output_table.keys(): 89 | moore_output_table[moore_transitions[x[0] + x[1]][a]] = self.transitions[x[0]][a][1] 90 | 91 | for x in self.transitions.keys(): 92 | if x not in moore_transitions.keys() and x not in temp_list_3: 93 | for a in self.input_alphabet: 94 | if self.transitions[x][a][0] in temp_list_3: 95 | next_state = self.transitions[x][a][0] 96 | output = self.transitions[x][a][1] 97 | 98 | next_state = next_state + output 99 | try: 100 | moore_transitions[x][a] = next_state 101 | except KeyError as e: 102 | moore_transitions[x] = {} 103 | moore_transitions[x][a] = next_state 104 | 105 | if next_state not in moore_output_table.keys(): 106 | moore_output_table[next_state] = output 107 | 108 | else: 109 | try: 110 | moore_transitions[x][a] = self.transitions[x][a][0] 111 | except KeyError as e: 112 | moore_transitions[x] = {} 113 | moore_transitions[x][a] = self.transitions[x][a][0] 114 | 115 | if self.transitions[x][a][0] not in moore_output_table.keys(): 116 | moore_output_table[self.transitions[x][a][0]] = self.transitions[x][a][1] 117 | 118 | moore_states = [] 119 | for s in moore_transitions.keys(): 120 | if s not in moore_states: 121 | moore_states.append(s) 122 | 123 | from automata.fa.Moore import Moore 124 | 125 | moore_from_mealy = Moore( 126 | moore_states, 127 | self.input_alphabet, 128 | self.output_alphabet, 129 | moore_transitions, 130 | moore_output_table, 131 | moore_initial_state 132 | ) 133 | 134 | print(moore_from_mealy) 135 | 136 | 137 | def __str__(self): 138 | output = "\nMealy Machine" + \ 139 | "\nStates " + str(self.states) + \ 140 | "\nTransitions " + str(self.transitions) + \ 141 | "\nInital State " + str(self.initial_state) + \ 142 | "\nInital Alphabet " + str(self.input_alphabet) + \ 143 | "\nOutput Alphabet" + str(self.output_alphabet) 144 | 145 | return output 146 | 147 | 148 | 149 | 150 | """ 151 | mealy = Mealy( 152 | ['a', 'b', 'c', 'd'], 153 | ['0', '1'], 154 | ['0', '1'], 155 | { 156 | 'a' : { 157 | '0' : ('d', '1'), 158 | '1' : ('b', '0') 159 | }, 160 | 161 | 'b' : { 162 | '0' : ('a', '1'), 163 | '1' : ('d', '1') 164 | }, 165 | 166 | 'c' :{ 167 | '0' : ('c', '0'), 168 | '1' : ('c', '0') 169 | }, 170 | 'd':{ 171 | '0' : ('b', '0'), 172 | '1' : ('a', '1') 173 | } 174 | }, 175 | 'a' 176 | ) 177 | 178 | 179 | mealy_2 = Mealy(['q0'], 180 | ['0', '1'], 181 | ['0', '1'], 182 | { 183 | 'q0' : { 184 | '1' : ('q0', '0'), 185 | '0' : ('q0', '1') 186 | } 187 | }, 188 | 'q0' 189 | ) 190 | 191 | mealy_3 = Mealy(['q0', 'q1', 'q2', 'q3'], 192 | ['0', '1'], 193 | ['0', '1'], 194 | { 195 | 'q0' : { 196 | '0' : ('q3', '0'), 197 | '1' : ('q1', '1') 198 | }, 199 | 'q1': { 200 | '0': ('q0', '1'), 201 | '1': ('q3', '0') 202 | }, 203 | 'q2': { 204 | '0': ('q2', '1'), 205 | '1': ('q2', '0') 206 | }, 207 | 'q3': { 208 | '0': ('q1', '0'), 209 | '1': ('q0', '1') 210 | } 211 | 212 | }, 213 | 'q0' 214 | 215 | ) 216 | #print(mealy_2) 217 | #print(mealy_2.get_output_from_string('0111')) 218 | print(mealy_3.convert_to_moore()) 219 | """ -------------------------------------------------------------------------------- /automata/fa/Moore.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | 4 | class Moore(object): 5 | """Moore Machine : Finite Automata with Output""" 6 | 7 | def __init__(self, states, input_alphabet, output_alphabet, transitions, initial_state, output_table ): 8 | """ 9 | states: Finite set of states 10 | input_alphabet: Alphabet of letters for forming input string 11 | output_alphabet: Alphabet of letters for forming output characters 12 | transitions: Transition Table 13 | output_table: Output Table to show what character from output_alphabet is printed when a state from 'states' 14 | is reached 15 | """ 16 | 17 | self.states = states 18 | self.input_alphabet = input_alphabet 19 | self.output_alphabet = output_alphabet 20 | self.transitions = transitions 21 | self.output_table = output_table 22 | self.initial_state = initial_state 23 | 24 | def get_output_from_string(self, string): 25 | """Return Moore Machine's output when a given string is given as input""" 26 | temp_list = list(string) 27 | output = '' 28 | current_state = self.initial_state 29 | output += self.output_table[current_state] 30 | for x in temp_list: 31 | current_state = self.transitions[current_state][x] 32 | output += self.output_table[current_state] 33 | 34 | return output 35 | 36 | def convert_to_mealy(self): 37 | mealy_transitions = {} 38 | 39 | for x in self.transitions.keys(): 40 | 41 | try: 42 | mealy_transitions[x] = {} 43 | 44 | for a in self.input_alphabet: 45 | mealy_transitions[x][a] = (self.transitions[x][a], self.output_table[self.transitions[x][a]]) 46 | 47 | except KeyError as e: 48 | pass 49 | 50 | mealy_input_alphabet = self.input_alphabet 51 | mealy_output_alphabet = self.output_alphabet 52 | mealy_initial_state = self.initial_state 53 | mealy_states = self.states 54 | 55 | #print(mealy_transitions) 56 | 57 | from automata.fa.Mealy import Mealy 58 | 59 | mealy_from_moore = Mealy( 60 | mealy_states, 61 | mealy_input_alphabet, 62 | mealy_output_alphabet, 63 | mealy_transitions, 64 | mealy_initial_state 65 | ) 66 | 67 | print(mealy_from_moore) 68 | 69 | def __str__(self): 70 | """"Pretty Print the Moore Machine""" 71 | 72 | output = "\nMoore Machine" + \ 73 | "\nStates " + str(self.states) + \ 74 | "\nInput Alphabet " + str(self.input_alphabet) + \ 75 | "\nOutput Alphabet " + str(self.output_alphabet) + \ 76 | "\nTransitions " + str(self.transitions) + \ 77 | "\nInitial State" + str(self.initial_state) + \ 78 | "\nOutput Table " + str(self.output_table) 79 | 80 | return output 81 | 82 | """ 83 | moore = Moore(['q0', 'q1', 'q2', 'q3'], 84 | ['a' , 'b'], 85 | ['0', '1'], 86 | { 87 | 'q0' : { 88 | 'a' : 'q1', 89 | 'b' : 'q3' 90 | 91 | }, 92 | 'q1': { 93 | 'a': 'q3', 94 | 'b': 'q1' 95 | 96 | }, 97 | 'q2': { 98 | 'a': 'q0', 99 | 'b': 'q3' 100 | 101 | }, 102 | 'q3': { 103 | 'a': 'q3', 104 | 'b': 'q2' 105 | 106 | } 107 | 108 | 109 | }, 110 | 111 | 'q0', 112 | { 113 | 'q0' : '1', 114 | 'q1' : '0', 115 | 'q2' : '0', 116 | 'q3' : '1' 117 | } 118 | 119 | 120 | ) 121 | print(moore) 122 | print(moore.get_output_from_string('abbba')) 123 | print(moore.convert_to_mealy()) 124 | 125 | """ -------------------------------------------------------------------------------- /automata/fa/NDFA.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | from automata.data_structures.Stack import Stack 3 | from automata.fa.DFA import DFA 4 | 5 | 6 | class NDFA(object): 7 | """Non Deterministic Finite Automata""" 8 | 9 | def __init__(self, states, alphabet, transitions, initial_state, final_states): 10 | """ 11 | Q is a finite set of states. 12 | 13 | sigma is a finite set of symbols called the alphabet. 14 | 15 | delta is the list of transitions based on transition relation. 16 | 17 | q0 is the initial state from where any input is processed (q0 ∈ Q). 18 | 19 | F is a set of final state/states of Q (F ⊆ Q). 20 | """ 21 | 22 | self.states = states #list 23 | self.alphabet = alphabet #list 24 | self.transitions = transitions #dict 25 | self.initial_state = initial_state #char 26 | self.final_states = final_states #list 27 | 28 | """ 29 | states=['q0', 'q1'], 30 | alphabets=['a', 'b'], 31 | transitions={ 32 | 'q0': {'a': ['q0', 'q1'], 'b': ['q1']}, 33 | 'q1': {'a': ['q0'], 'b': ['q1', 'q0']}, 34 | }, 35 | initial_state='q0', 36 | final_states=['q1'] 37 | """ 38 | 39 | def is_string_valid(self, string): 40 | """Return True if string is accepted by NDFA, otherwise return False""" 41 | 42 | inputs = list(string) 43 | current_state = self.initial_state 44 | 45 | for letter in inputs: 46 | 47 | try: 48 | 49 | if isinstance(current_state, list): 50 | temp_cur_state = [] 51 | for state in current_state: 52 | if letter in self.transitions[state]: 53 | temp_cur_state.push(self.transitions[state][letter]) 54 | current_state = temp_cur_state 55 | 56 | elif isinstance(current_state, str): 57 | if letter in self.transitions[current_state]: 58 | current_state = self.transitions[current_state][letter] 59 | 60 | else: 61 | return False 62 | 63 | except KeyError as e: 64 | return False 65 | 66 | if isinstance(current_state, str): 67 | if current_state in self.final_states: 68 | return True 69 | 70 | elif isinstance(current_state, list): 71 | if not set(current_state).isdisjoint(self.final_states): 72 | return True 73 | 74 | return False 75 | 76 | def convert_to_dfa(self): 77 | """"Returns equivalent DFA of the given NDFA""" 78 | 79 | temp_init_state_list = [self.initial_state] 80 | 81 | foo_dict = {str(temp_init_state_list): self.transitions[self.initial_state]} 82 | 83 | s = Stack() 84 | q = Stack() 85 | 86 | for x in self.alphabet: 87 | s.push(foo_dict[str(temp_init_state_list)][x]) 88 | 89 | while not s.isEmpty(): 90 | 91 | current_states = s.pop() 92 | q.push(current_states) 93 | 94 | if current_states != foo_dict.keys(): 95 | foo_dict[str(current_states)] = {} 96 | 97 | for a in self.alphabet: 98 | 99 | temp_list = [] 100 | 101 | for c in current_states: 102 | 103 | try: 104 | for t in self.transitions[c][a]: 105 | if t not in temp_list: 106 | temp_list.append(t) 107 | 108 | except KeyError as e: 109 | pass 110 | 111 | foo_dict[str(current_states)][a] = (temp_list) 112 | 113 | if temp_list not in q and temp_list not in s and temp_list is not []: 114 | s.push(temp_list) 115 | 116 | dfa_initial_state = 'Q0' 117 | 118 | i = 0 119 | map_states ={} 120 | for a in foo_dict.keys(): 121 | map_states[a] = 'Q' + str(i) 122 | i+=1 123 | 124 | dfa_transitions = {} 125 | dfa_finial_states = [] 126 | dfa_states = [] 127 | 128 | for a in foo_dict.keys(): 129 | dfa_transitions[map_states[a]] = {} 130 | for b in self.alphabet: 131 | 132 | if set(foo_dict[a][b]).isdisjoint(self.final_states): 133 | if (a) not in dfa_finial_states: 134 | dfa_finial_states.append(map_states[a]) 135 | 136 | dfa_transitions[map_states[a]][b] = map_states[str(foo_dict[a][b])] 137 | 138 | if map_states[a] not in dfa_states: 139 | dfa_states.append(map_states[a]) 140 | 141 | if (map_states[str(foo_dict[a][b])]) not in dfa_states: 142 | dfa_states.append(map_states[str(foo_dict[a][b])]) 143 | 144 | # Here we go 145 | d = DFA(dfa_states, self.alphabet, dfa_transitions, dfa_initial_state, dfa_finial_states) 146 | print(d) 147 | return d 148 | 149 | def __str__(self): 150 | """"Pretty Print the NDFA""" 151 | 152 | output = "\nNon-Deterministic Finite Automata" + \ 153 | "\nStates " + str(self.states) + \ 154 | "\nAlphabet " + str(self.alphabet) + \ 155 | "\nTransitions " + str(self.transitions) + \ 156 | "\nInital State " + str(self.initial_state) + \ 157 | "\nFinal States " + str(self.final_states) 158 | 159 | return output 160 | 161 | 162 | 163 | d = NDFA( 164 | ['q0', 'q1'], 165 | ['a', 'b'], 166 | { 167 | 'q0': {'a': ['q0', 'q1'], 'b': ['q1']}, 168 | 'q1': {'a': ['q0'], 'b': ['q1']} 169 | }, 170 | 'q0', 171 | ['q1'] 172 | ) 173 | 174 | 175 | 176 | """ 177 | print (d.convert_to_dfa()) 178 | print(d.is_string_valid('a')) 179 | print(d) 180 | """ -------------------------------------------------------------------------------- /automata/fa/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/fa/__init__.py -------------------------------------------------------------------------------- /automata/fa/__pycache__/DFA.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/fa/__pycache__/DFA.cpython-35.pyc -------------------------------------------------------------------------------- /automata/fa/__pycache__/Mealy.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/fa/__pycache__/Mealy.cpython-35.pyc -------------------------------------------------------------------------------- /automata/fa/__pycache__/Moore.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/fa/__pycache__/Moore.cpython-35.pyc -------------------------------------------------------------------------------- /automata/fa/__pycache__/__init__.cpython-35.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/automata/fa/__pycache__/__init__.cpython-35.pyc -------------------------------------------------------------------------------- /automata/language.py: -------------------------------------------------------------------------------- 1 | class Language(object): 2 | """Basic operations that can be performed on a language""" 3 | 4 | def __init__(self, language, alphabets, rules): 5 | """Constructor to create language and its alphabet set""" 6 | if(type(language) == "list"): 7 | self.language = language 8 | 9 | if(type(alphabets) == "list"): 10 | self.alphabets = alphabets 11 | else: 12 | self.alphabets = [] 13 | 14 | if(type(rules) == "list"): 15 | self.rules = rules 16 | else: 17 | self.rules = [] 18 | 19 | def define(self, strings): 20 | """Add words to the language""" 21 | 22 | def define_alphabets(self, element): 23 | """"Add elements to the set of alphabets of the language""" 24 | 25 | if(type(element) == "list"): 26 | self.alphabet = element 27 | 28 | else: 29 | self.alphabet.push(element) 30 | 31 | def define_rules(self, rule ): 32 | """Add rule string to python list of rules""" 33 | self.rule.push(rule) 34 | 35 | def show(self): 36 | """Getter for language""" 37 | output = "----------------\n" 38 | output += "Language is " + self.language + "\n\n" 39 | output += "Alphabet for it is " + self.alphabets + "\n\n" 40 | output += "Rules for this language are " + self.rules + "\n" 41 | output += "\n----------------" 42 | return output 43 | 44 | def show_alphabet(self): 45 | """Getter for alphabets""" 46 | return self.alphabets 47 | -------------------------------------------------------------------------------- /automata/testing.py: -------------------------------------------------------------------------------- 1 | l = [1,2,3] 2 | p = [1,2,3] 3 | 4 | if l==p: 5 | print ("H") -------------------------------------------------------------------------------- /automata_python.egg-info/PKG-INFO: -------------------------------------------------------------------------------- 1 | Metadata-Version: 1.0 2 | Name: automata-python 3 | Version: 0.0.3 4 | Summary: Python Automata Library 5 | Home-page: https://github.com/hemangsk/automata-python 6 | Author: Hemang Kumar 7 | Author-email: hemangsk@gmail.com 8 | License: GPLv3 9 | Description: UNKNOWN 10 | Keywords: language finite automata turing machine push down automata linear bound automata 11 | Platform: UNKNOWN 12 | -------------------------------------------------------------------------------- /automata_python.egg-info/SOURCES.txt: -------------------------------------------------------------------------------- 1 | setup.cfg 2 | setup.py 3 | automata/language.py 4 | automata_python.egg-info/PKG-INFO 5 | automata_python.egg-info/SOURCES.txt 6 | automata_python.egg-info/dependency_links.txt 7 | automata_python.egg-info/top_level.txt -------------------------------------------------------------------------------- /automata_python.egg-info/dependency_links.txt: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /automata_python.egg-info/top_level.txt: -------------------------------------------------------------------------------- 1 | automata 2 | -------------------------------------------------------------------------------- /dist/automata_python-0.0.1.tar.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/dist/automata_python-0.0.1.tar.gz -------------------------------------------------------------------------------- /dist/automata_python-0.0.3.tar.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/dist/automata_python-0.0.3.tar.gz -------------------------------------------------------------------------------- /images/automata-header.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/images/automata-header.png -------------------------------------------------------------------------------- /images/automatasub.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hemangsk/automata-python/4c430b8afa44dce72a3bac4a4b1026d55e3e7f9c/images/automatasub.png -------------------------------------------------------------------------------- /setup.cfg: -------------------------------------------------------------------------------- 1 | [metadata] 2 | description-file = README.md 3 | -------------------------------------------------------------------------------- /setup.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | """Setup logic for pip.""" 3 | 4 | from setuptools import setup 5 | 6 | setup( 7 | name='automata_python', 8 | version='0.0.3', 9 | description='Python Automata Library', 10 | url='https://github.com/hemangsk/automata-python', 11 | author='Hemang Kumar', 12 | author_email='hemangsk@gmail.com', 13 | license='GPLv3', 14 | keywords='language finite automata turing machine push down automata linear bound automata', 15 | packages=[ 16 | 'automata' 17 | ], 18 | install_requires=[], 19 | entry_points={} 20 | ) 21 | --------------------------------------------------------------------------------