The power of symbolic automata and transducers

DOI10.1007/978-3-319-63387-9_3zbMath1494.68133OpenAlexW2676873924MaRDI QIDQ2151231

Loris D'Antoni, Margus Veanes

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-63387-9_3

zbMATH Keywords

symbolic automatasymbolic transducersextended finite automataalphabet theorycandidate automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Improving Symbolic Automata Learning with Concolic Execution ⋮ Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ Symbolic automatic relations and their applications to SMT and CHC solving ⋮ Symbolic weighted language models, quantitative parsing and automated music transcription ⋮ Poster Abstract: Model-Free Reinforcement Learning for Symbolic Automata-encoded Objectives ⋮ Temporal stream logic modulo theories ⋮ Natural projection as partial model checking ⋮ Selective monitoring ⋮ Fast computations on ordered nominal sets ⋮ Adaptive testing for specification coverage and refinement in CPS models ⋮ Monadic decomposition in integer linear arithmetic

This page was built for publication: The power of symbolic automata and transducers