Testing and generating infinite sequences by a finite automaton

Cited in

(only showing first 100 items - show all)

Mathematical logic and quantum finite state automata
A classification of \(\omega\)-regular languages
Equivalence of infinite behavior of finite automata
Langages infinitaires et produit de mixage
Towards a formal proof system for \(\omega\)-rational expressions
Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
Description and reasoning of VLSI circuit in temporal logic
Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions
The complementation problem for Büchi automata with applications to temporal logic
Finitely generated \(\omega\)-languages
On generators of rational \(\omega\)-power languages
On a subclass of \(\infty\)-regular languages
Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
Complementing deterministic Büchi automata in polynomial time
An automata theoretic decision procedure for the propositional mu- calculus
Characterization and closure properties of linear \(\omega\)-languages
On the complexity of -type Turing acceptors
Generalized automata on infinite trees and Muller-McNaughton's theorem
Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
Finitely generated bi\(\omega\)-languages
On automata on infinite trees
Finite automata on directed graphs
A denotational theory of synchronous reactive systems
Fairness, distances and degrees
Alternating automata, the weak monadic theory of trees and its complexity
\(\infty\)-regular temporal logic and its model checking problem
\(X\)-automata on \(\omega\)-words
Theories of automata on \(\omega\)-tapes: a simplified approach
On the monadic theory of \(\omega_1\) without A.C
A decidability result for deterministic \(\omega\)-context-free languages
Theory of -languages. I: Characterizations of -context- free languages
Theory of -languages. II: A study of various models of - type generation and recognition
-computations on Turing machines
-computations on deterministic pushdown machines
Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
Finite acceptance of infinite words
Dynamic linear time temporal logic
A theory of timed automata
CTL^* and ECTL^* as fragments of the modal -calculus
Progress measures, immediate determinacy, and a subset construction for tree automata
Deterministic asynchronous automata for infinite traces
Finite automata and ordinals
Chain automata
Somewhat finite approaches to infinite sentences.
Determinization and memoryless winning strategies
Using automata theory for characterizing the semantics of terminological cycles
Axiomatising extended computation tree logic
Finite automata on timed \(\omega\)-trees
Ambiguity in omega context free languages
The complexity of the temporal logic with ``until over general linear time
Borel hierarchy and omega context free languages.
From bidirectionality to alternation.
Unambiguous Büchi automata.
A gap property of deterministic tree languages.
Minimal separating sets for acceptance conditions in Muller automata
Inferring regular languages and \(\omega\)-languages
Quantum \(\omega\)-automata over infinite words and their relationships
On the descriptional complexity of finite automata with modified acceptance conditions
Weak Muller acceptance conditions for tree automata
Logic, semigroups and automata on words
Two characterizations of rational adherences
On the complementation of Büchi automata
Automata techniques for query inference machines
On probabilistic timed automata.
Star-free sets of words on ordinals
On omega context free languages which are Borel sets of infinite rank.
On control of systems modelled as deterministic Rabin automata
Beyond -regular languages: T-regular expressions and their automata and logic counterparts
Temporal logic with recursion
-automata
Certifying inexpressibility
Infinite behaviour of Petri nets
Shift-invariant topologies for the Cantor space \(X^{\omega}\)
Topology, monitorable properties and runtime verification
An axiomatization of PCTL*
Relating word and tree automata
An axiomatization of full computation tree logic
Operator precedence languages: their automata-theoretic and logic characterization
Subword metrics for infinite words
Decidability and undecidability of theories with a predicate for the primes
Automata theory and model checking
Saturating right congruences
Learning regular omega languages
New optimizations and heuristics for determinization of Büchi automata
On?-Languages whose syntactic monoid is trivial
Beyond BS-regular languages: T-regular expressions and counter-check automata
Limited set quantifiers over countable linear orderings
On Determinisation of Good-for-Games Automata
The Wadge hierarchy of Petri nets \(\omega\)-languages
Logic programming approach to automata-based decision procedures
Parallel generation of infinite images
Finite state automata and monadic definability of singular cardinals
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Some Algebraic Properties of Machine Poset of Infinite Words
The quest for a tight translation of Büchi to co-Büchi automata
On monadic theories of monadic predicates
Selection in the monadic theory of a countable ordinal
Facets of Synthesis: Revisiting Church’s Problem
Tighter Bounds for the Determinisation of Büchi Automata
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata

This page was built for publication: Testing and generating infinite sequences by a finite automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613960)