Mata: A Fast and Simple Finite Automata Library

Simple item page
dc.contributor.authorChocholatý, Davidcs
dc.contributor.authorFiedor, Tomášcs
dc.contributor.authorHavlena, Vojtěchcs
dc.contributor.authorHolík, Lukášcs
dc.contributor.authorHruška, Martincs
dc.contributor.authorLengál, Ondřejcs
dc.contributor.authorSíč, Jurajcs
dc.coverage.issue14571cs
dc.date.accessioned2025-06-17T10:58:17Z
dc.date.available2025-06-17T10:58:17Z
dc.date.issued2024-04-04cs
dc.description.abstractMata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding. The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.en
dc.description.abstractTento článek přináší efektivní knihovnu pro práci s konečnými automaty Mata. Mata využívá jednoduché, ale efektivní datové struktury. Rozsáhlé experimentální vyhodnocení ukazuje, že Mata umožňuje rychlejší automatové operace než ostatní knihovny.cs
dc.formattextcs
dc.format.extent130-151cs
dc.format.mimetypeapplication/pdfcs
dc.identifier.citationLecture Notes in Computer Science. 2024, issue 14571, p. 130-151.en
dc.identifier.doi10.1007/978-3-031-57249-4_7cs
dc.identifier.issn0302-9743cs
dc.identifier.orcid0009-0006-5614-1592cs
dc.identifier.orcid0000-0003-4375-7954cs
dc.identifier.orcid0000-0001-6957-1651cs
dc.identifier.orcid0000-0003-2318-0940cs
dc.identifier.orcid0000-0002-3038-5875cs
dc.identifier.orcid0000-0001-7454-3751cs
dc.identifier.other188471cs
dc.identifier.researcheridJCO-1846-2023cs
dc.identifier.scopus57189895456cs
dc.identifier.scopus24468124100cs
dc.identifier.scopus57188881647cs
dc.identifier.scopus24822331700cs
dc.identifier.urihttps://hdl.handle.net/11012/252869
dc.language.isoencs
dc.publisherSpringer Verlagcs
dc.relation.ispartofLecture Notes in Computer Sciencecs
dc.relation.urihttps://link.springer.com/chapter/10.1007/978-3-031-57249-4_7cs
dc.rightsCreative Commons Attribution 4.0 Internationalcs
dc.rights.accessopenAccesscs
dc.rights.sherpahttp://www.sherpa.ac.uk/romeo/issn/0302-9743/cs
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/cs
dc.subjectNondeterministic finite automataen
dc.subjectautomata libraryen
dc.titleMata: A Fast and Simple Finite Automata Libraryen
dc.title.alternativeMata: Rychlá a jednoduchá knihovna pro konečné automatycs
dc.type.driverconferenceObjecten
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
sync.item.dbidVAV-188471en
sync.item.dbtypeVAVen
sync.item.insts2025.06.17 12:58:17en
sync.item.modts2025.06.17 12:33:38en
thesis.grantorVysoké učení technické v Brně. Fakulta informačních technologií. Ústav inteligentních systémůcs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
9783031572494_7.pdf
Size:
913.04 KB
Format:
Adobe Portable Document Format
Description:
file 9783031572494_7.pdf
Download
Collections
Ústav inteligentních systémů