The Complexity of Translating Logic to Finite Automata
From MaRDI portal
Publication:4412836
DOI10.1007/3-540-36387-4_13zbMath1021.03031OpenAlexW1596995530MaRDI QIDQ4412836
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36387-4_13
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
The complexity of model checking multi-stack systems ⋮ Regular language representations in the constructive type theory of Coq ⋮ Automata for the verification of monadic second-order graph properties ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Computations by fly-automata beyond monadic second-order logic ⋮ Model checking for hybrid branching-time logics ⋮ Automata on finite trees ⋮ On long words avoiding Zimin patterns ⋮ Unnamed Item ⋮ Defining long words succinctly in FO and MSO
This page was built for publication: The Complexity of Translating Logic to Finite Automata
