{"id":21295628,"url":"https://github.com/eric11eca/automatonstudio","last_synced_at":"2026-03-11T15:02:51.886Z","repository":{"id":37187375,"uuid":"281245121","full_name":"eric11eca/AutomatonStudio","owner":"eric11eca","description":"Toolbox for automaton theory, language theory, lambda calculus, propositional logic, and formal semantics. Including simulations, applications, parsers, and algorithm implementations.","archived":false,"fork":false,"pushed_at":"2022-12-13T09:33:49.000Z","size":3518,"stargazers_count":5,"open_issues_count":13,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2023-08-25T00:41:47.797Z","etag":null,"topics":["automaton","context-free-grammar","finite-automaton-simulator","finite-state-machine","lambda-calculus","propositional-logic","regular-expression","turing-machine-simulator"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/eric11eca.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-07-20T23:15:26.000Z","updated_at":"2023-08-25T00:41:47.798Z","dependencies_parsed_at":"2023-01-28T10:30:54.984Z","dependency_job_id":null,"html_url":"https://github.com/eric11eca/AutomatonStudio","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eric11eca%2FAutomatonStudio","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eric11eca%2FAutomatonStudio/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eric11eca%2FAutomatonStudio/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eric11eca%2FAutomatonStudio/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/eric11eca","download_url":"https://codeload.github.com/eric11eca/AutomatonStudio/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225741007,"owners_count":17516896,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["automaton","context-free-grammar","finite-automaton-simulator","finite-state-machine","lambda-calculus","propositional-logic","regular-expression","turing-machine-simulator"],"created_at":"2024-11-21T14:05:50.883Z","updated_at":"2026-03-11T15:02:46.842Z","avatar_url":"https://github.com/eric11eca.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Automaton Studio\nA toolbox for automaton theory, language theory, lambda calculus, propositional logic, and formal semantics. Including simulations, applications, parsers, and algorithm implementations.\n\n## TODOs\n1. [x] Finite State Machine\n\t- [x] Minimize finite state machine\n\t- [x] Convert Non-deterministic FSM to Deterministic FSM\n\t- [x] Convert FSM to regular expression\n\t- [x] FSM simulation\n\t- [x] FSM Union, Intersection, and Difference\n\t- [ ] FSM Reverse, Complement, and Kleen\n\t- [ ] FSM language subset, infinite, and empty \n\t- [ ] FSM to Regular Grammar\n\t- [ ] FSM enumeration\n2. [x] Regular Expression\n\t- [x] Convert regular expression to FSM\n\t- [x] Parse regular expression from string\n\t- [x] Regular expression simulation\n\t- [x] Regular expression simplification \n\t- [ ] Regular expression enumeration\n3. [ ] Context-free Grammar\n\t- [ ] Context-free Grammar simulation\n\t- [ ] Context-free Grammar parsing\n4. [ ] Pushdown Automaton\n5. [ ] Turing Machine\n6. [ ] Propositional Logic\n\t- [x] Truth Tables\n\t- [ ] Truth-functional connectors\n\t- [ ] Material-implication and bi-implication\n\t- [ ] Set theory inference and prove \n8. [ ] Lambda Calculus\n9. [ ] Formal Semantics\n10. [ ] Natural Logic and Monotonicity\n\n## Run\nnpm start run\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feric11eca%2Fautomatonstudio","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Feric11eca%2Fautomatonstudio","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feric11eca%2Fautomatonstudio/lists"}