scispace - formally typeset
Topic

Quantum finite automata

About: Quantum finite automata is a(n) research topic. Over the lifetime, 3725 publication(s) have been published within this topic receiving 96542 citation(s).
Papers
More filters

Journal ArticleDOI
Abstract: Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e) automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol. We study timed automata from the perspective of formal language theory: we consider closure properties, decision problems, and subclasses. We consider both nondeterministic and deterministic transition structures, and both Biichi and Muller acceptance conditions. We show that nondeterministic timed automata are closed under union and intersection, but not under complementation, whereas deterministic timed Muller automata are closed under all Boolean operations. The main construction of the paper is an (PSPACE) algorithm for checking the emptiness of the language of a (nondeterministic) timed automaton. We also prove that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the nondeterministic case and PSPACE-complete in the deterministic case. Finally, we discuss the application of this theory to automatic verification of real-time requirements of finite-state systems.

6,845 citations


Journal ArticleDOI
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined. Some decision problems concerning automata are shown to be solvable by effective algorithms; others turn out to be unsolvable by algorithms.

1,836 citations


Book
01 Mar 1988-
TL;DR: Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines
Abstract: Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines Parallel and serial composition of automata The parallel decomposition theorem The serial decomposition theorem The lattice of SP partitions Analysis of machines Concurrent systems: net theory Concurrent systems: the calculus of communicating systems. Appendix: Sets, relations and functions.

1,550 citations


Book ChapterDOI
02 Jan 1991-
TL;DR: This chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree.
Abstract: Publisher Summary This chapter focuses on finite automata on infinite sequences and infinite trees. The chapter discusses the complexity of the complementation process and the equivalence test. Deterministic Muller automata and nondeterministic Buchi automata are equivalent in recognition power. Any nonempty Rabin recognizable set contains a regular tree and shows that the emptiness problem for Rabin tree automata is decidable. The chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree. A short overview of the work that studies the fine structure of the class of Rabin recognizable sets of trees is also presented in the chapter. Depending on the formalism in which tree properties are classified, the results fall in three categories: monadic second-order logic, tree automata, and fixed-point calculi.

1,442 citations


Book ChapterDOI
TL;DR: The formalism of regular expressions was introduced by S. C. Kleene to obtain the following basic theorems.
Abstract: The formalism of regular expressions was introduced by S. C. Kleene [6] to obtain the following basic theorems.

1,093 citations


Network Information
Related Topics (5)
Nondeterministic finite automaton

2.5K papers, 58.9K citations

93% related
Automaton

2.3K papers, 53.8K citations

92% related
Automata theory

5.1K papers, 175.8K citations

92% related
Deterministic automaton

2.7K papers, 62.5K citations

92% related
Regular language

3.6K papers, 68.5K citations

92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202115
202016
201913
201814
201785
2016113

Top Attributes

Show by:

Topic's top 5 most impactful authors

Abuzer Yakaryilmaz

44 papers, 600 citations

Martin Kutrib

42 papers, 467 citations

Markus Holzer

41 papers, 662 citations

Daowen Qiu

38 papers, 759 citations

Giovanni Pighizzini

23 papers, 358 citations