Finite automata and their decision problems
IBM Journal of Research and Development
On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the Complexity of Parity Word Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Journal of Computer and System Sciences
Muller message-passing automata and logics
Information and Computation
Büchi Complementation and Size-Change Termination
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Bridging the gap between fair simulation and trace inclusion
Information and Computation
The isomorphism problem for ω-automatic trees
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Synthesis of trigger properties
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Reasoning about Co-Büchi tree automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Minimizing generalized büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Journal of Computer and System Sciences
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Larger automata and less work for LTL model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Mining movies to extract song sequences
Proceedings of the Eleventh International Workshop on Multimedia Data Mining
On the Generative Power of ω-Grammars and ω-Automata
Fundamenta Informaticae
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Nested Emptiness Search for Generalized Büchi Automata
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Determinization of ordinal automata
Problems of Information Transmission
| Hi-index | 0.00 |
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parallel battery of finite automata, a simple and transparent development of McNaughton's theory of automata on @w-tapes is given. The lemma and the technique are then used to give an independent and equally simple development of Buchi's theory of nondeterministic automata on these tapes. Some variants of these models are also studied. Finally a third independent approach, modelled after a simplified version of Rabin's theory of automata on infinite trees, is developed.