Skip to content

add link to the TACAS 2012 paper #5

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

Open
davisjam wants to merge 2 commits into
base: master
Choose a base branch
from
Open

add link to the TACAS 2012 paper #5

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6932799
add link to the TACAS 2012 paper
davisjam Jul 21, 2020
4e43412
match with the srm reference format
davisjam Jul 21, 2020
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
2 changes: 2 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,2 +1,4 @@
# Automata
Automata is a .NET library that provides algorithms for composing and analyzing _regular expressions_, _automata_, and _transducers_. In addition to classical word automata, it also includes algorithms for analysis of _tree automata_ and _tree transducers_. The library covers algorithms over finite alphabets as well as their _symbolic_ counterparts. In symbolic automata concrete characters have been replaced by _character predicates_. Such predicates can range over very large or even _infinite_ alphabets, like integers. Predicates can be supported by an SMT solver as a plugin.

For an overview of the library please see: [Veanes and Bjørner. *Symbolic Automata: The Toolkit*. In TACAS 2012](https://doi.org/10.1007/978-3-642-28756-5_33).