Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

More paper edits #171

Merged
merged 3 commits into from
Sep 10, 2023
Merged

More paper edits #171

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
fa99bf6
Add discussion of other packages
eliotwrobson Sep 10, 2023
fac2100
Update paper.bib
eliotwrobson Sep 10, 2023
0b934e7
Update paper.md
eliotwrobson Sep 10, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 11 additions & 1 deletion joss/paper.bib
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -87,7 +87,8 @@ @INPROCEEDINGS{Erickson23
}

@misc{Johnson_2010,
title={Nick’s Blog},
title={Damn Cool Algorithms: Levenshtein Automata},
journal={Nick’s Blog},
url={http://blog.notdot.net/2010/07/Damn-Cool-Algorithms-Levenshtein-Automata},
author={Johnson, Nick},
year={2010},
Expand Down Expand Up @@ -167,3 +168,12 @@ @ARTICLE{Xu16
pages={2991-3029},
doi={10.1109/COMST.2016.2566669}
}

@book{Rodger06,
author = {Rodger, Susan H.},
title = {JFLAP: An Interactive Formal Languages and Automata Package},
year = {2006},
isbn = {0763738344},
publisher = {Jones and Bartlett Publishers, Inc.},
address = {USA}
}
15 changes: 9 additions & 6 deletions joss/paper.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,13 +35,16 @@ of the corresponding languages using specialized algorithms.

# Statement of need

These models are a core component of both computer science education and research, seeing further theoretical work
Automata are a core component of both computer science education and research, seeing further theoretical work
and applications in a wide variety of areas such as computational biology [@Marschall11] and networking [@Xu16].
In particular, the ability to manipulate finite-state automata within the context of a software package has seen attention from
researchers in the past [@Sutner03]. Similar software has also included
functionality for parsing regular expressions into their corresponding finite-state automata [@brics].

`automata` serves the demand for such a package in the Python software ecosystem. As a popular high-level language, Python enables
Consequently, the manipulation of automata with software packages has seen significant attention from
researchers in the past. The similarly named Mathematica package `Automata` [@Sutner03] implements a number of
algorithms for use with finite-state automata, including regular expression conversion and binary set operations.
In Java, the Brics package [@brics] implements similar algorithms, while the JFLAP package [@Rodger06] places an emphasis
on interactivity and simulation of more general families of automata.

`automata` serves the demand for such a package in the Python software ecosystem, implementing algorithms and allowing for
simulation of automata in a manner comparable to the packages described previously. As a popular high-level language, Python enables
significant flexibility and ease of use that directly benefits many users. The package includes a comprehensive test suite,
support for modern language features (including type annotations), and has a large number of different automata,
meeting the demands of users across a wide variety of use cases. In particular, the target audience
Expand Down