Construction of an Automaton From a Formula of the Monadic First-Order Theory of Natural Numbers

Authors:
A. N. Chebotarev
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2001

Citing 4
Cited 1

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Infinitary languages: basic theory and applications to concurrent systems

Current trends in concurrency. Overviews and tutorials
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Mathematical logic for computer science

Mathematical logic for computer science

The Automata-Theoretic Approach to Verification of Reactive Systems

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for construction of an automaton (an acceptor) from a first-order logical formula is proposed. The method is similar to the tableau method and can be considered as modification and improvement of it.