Applications of Symbolic Finite Automata

DOI10.1007/978-3-642-39274-0_3zbMath1298.68160OpenAlexW122051056MaRDI QIDQ5327478

Margus Veanes

Publication date: 7 August 2013

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-39274-0_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Deciding Synchronous Kleene Algebra with Derivatives ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ A split-based incremental deterministic automata minimization algorithm ⋮ Natural projection as partial model checking ⋮ Twinning automata and regular expressions for string static analysis ⋮ An efficient SMT solver for string constraints ⋮ Weighted Symbolic Automata with Data Storage ⋮ A Formal Framework for Complex Event Processing ⋮ Implementation of Code Properties via Transducers ⋮ Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels

This page was built for publication: Applications of Symbolic Finite Automata