Nested Antichains for WS1S
From MaRDI portal
Publication:5194965
DOI10.1007/978-3-662-46681-0_59zbMath1420.68186OpenAlexW1591447482MaRDI QIDQ5194965
Tomáš Fiedor, Ondřej Lengál, Lukáš Holík, Tomáš Vojnar
Publication date: 17 September 2019
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46681-0_59
decision proceduretree automatonnondeterministic automatonsymbolic representationdeterministic automaton
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items
Nested antichains for WS1S, Lazy Automata Techniques for WS1S, Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure, Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure