From Sequential Extended Regular Expressions to NFA with Symbolic Labels

DOI10.1007/978-3-642-18098-9_10zbMath1297.68116OpenAlexW1584319581WikidataQ62041241 ScholiaQ62041241MaRDI QIDQ3073625

Marco Roveri, Stefano Tonetta, Alessandro Cimatti, Sergio Mover

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• AUTOMATE
• Grail
• NuSMV
• MONA
• Rex

Cites Work

• Unnamed Item
• Unnamed Item
• Finite state transducers with predicates and identities
• AUTOMATE, a computing package for automata and finite semigroups
• \textit{Grail}: A C++ library for automata and expressions
• NuSMV: A new symbolic model checker
• EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
• Qex: Symbolic SQL Query Explorer
• From regular expressions to finite automata^∗
• Theory Is Forever
• Implementation and Application of Automata

This page was built for publication: From Sequential Extended Regular Expressions to NFA with Symbolic Labels