On equations for regular languages, finite automata, and sequential networks☆
Reads0
Chats0
TLDR
It is shown that any system of equations of the form X i = ⋃ α∈A α·F i,a ∪δ i i=1,…,n has a unique solution which, moreover, is regular.About:
This article is published in Theoretical Computer Science.The article was published on 1980-01-01 and is currently open access. It has received 176 citations till now. The article focuses on the topics: Nondeterministic finite automaton & Regular language.read more
Citations
More filters
Journal ArticleDOI
Reasoning about Infinite Computations
Moshe Y. Vardi,Pierre Wolper +1 more
TL;DR: This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
Book ChapterDOI
An automata-theoretic approach to linear temporal logic
TL;DR: The automata-theoretic approach to linear temporal logic as discussed by the authors uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis Both programs and specifications are in essence descriptions of computations These computations can be viewed as words over some alphabet.
Proceedings Article
Linear temporal logic and linear dynamic logic on finite traces
TL;DR: This paper shows that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and proposes a logic, LDLf for Linear Dynamic Logic over finite traces, which borrows the syntax from Propositional Dynamic Logic (PDL), but is interpreted over finite trace.
Journal ArticleDOI
Partial derivatives of regular expressions and finite automaton constructions
TL;DR: A constructive definition of partial derivatives is given, their properties are studied, and they are employed to develop a new algorithm for turning regular expressions into relatively small NFA and to provide certain improvements to Brzozowski's algorithm constructing DFA.
Proceedings ArticleDOI
Reasoning about infinite computation paths
TL;DR: In this paper, the authors investigate extensions of temporal logic by finite automata on infinite words and give three different types of acceptance conditions (finite, looping and repeating) that one can give for these automata.
References
More filters
Proceedings ArticleDOI
On parallelism in turing machines
TL;DR: A natural characterization of the polynomial time hierarchy of Stockmeyer and Meyer in terms of parallel machines is given, and a generalization of Saviten's result NONDET-L(n)-SPACE ⊆ L(n)2-SPACE is given.
Proceedings ArticleDOI
Delayed-logic and finite-state machines
TL;DR: The paper's main results hinge on certain properties of a new type of state subgraph, and on an indirect application of permutation groups to the state-pair transition problem.
Digital networks
TL;DR: The accuracy of a digital frequency multiplication technique can be improved approximately by a factor of 2 by applying a digital synchtonization tedmique descn’bed in this letter.