Intractability of decision problems for finite-memory automata
Hiroshi Sakamoto,Daisuke Ikeda +1 more
TLDR
In this paper, the membership problem is shown to be P-complete, provided a given automaton is deterministic, and each of the other problems is NP-complete for general finite-memory automata.About:
This article is published in Theoretical Computer Science.The article was published on 2000-01-28 and is currently open access. It has received 63 citations till now. The article focuses on the topics: Deterministic automaton & Two-way deterministic finite automaton.read more
Citations
More filters
Journal ArticleDOI
Finite state machines for strings over infinite alphabets
TL;DR: This work investigates the expressiveness and complexity of the automata and their connection to the logics, as well as standard decision problems of Kaminski and Francez on register automata.
Journal ArticleDOI
LTL with the freeze quantifier and register automata
Stéphane Demri,Ranko Lazić +1 more
TL;DR: It is proved that surprisingly, over infinite data words, LTLdarr without the 'until' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register.
Book ChapterDOI
Automata and logics for words and trees over an infinite alphabet
TL;DR: This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power and decidability.
Posted Content
LTL with the Freeze Quantifier and Register Automata
Stéphane Demri,Ranko Lazić +1 more
TL;DR: In this paper, a complete complexity table for logic fragments defined by varying the set of temporal operators and the number of registers is presented. But it is not decidable over finite data words, since adding past-time operators or 1 more register causes undecidability.
Journal ArticleDOI
Querying Graphs with Data
TL;DR: A family of languages that enable combination of data and topology querying for graph databases are presented, and it is shown that it includes efficient and highly expressive formalisms for querying both the structure of the data and the data itself.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
An Introduction to Automata Theory
TL;DR: Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines
Book
Computational Complexity
TL;DR: Computational complexity is the realm of mathematical models and techniques for establishing impossibility proofs for proving formally that there can be no algorithm for the given problem which runs faster than the current one.
Journal ArticleDOI
Finite-memory automata
Michael Kaminski,Nissim Francez +1 more
TL;DR: This model is based on replacing the equality test by substitution and appears to be a natural generalization of the classical Rabin-Scott finite-state automata and possesses many of their closure and decision properties.
Journal ArticleDOI
The monotone and planar circuit value problems are log space complete for P
TL;DR: It is shown that Ladner's simulation of Turing mac]hines by boolean circuits seems to require an "adequate" set of gates, such as AND and NOT, but the same simulation is possible with monotone circuits using AND and OR gates only.