Finite-state -languages
From MaRDI portal
Publication:794443
DOI10.1016/0022-0000(83)90051-XzbMATH Open0541.68052MaRDI QIDQ794443FDOQ794443
Authors: Ludwig Staiger 
Publication date: 1983
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Recommendations
Borel hierarchyfinite state omega-languagesinfinite sequences of wordsminimization problem for finite automataregular omega-languagestopological considerations
Cites Work
- Derivatives of Regular Expressions
- Title not available (Why is that?)
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Title not available (Why is that?)
- On?-Languages whose syntactic monoid is trivial
- Testing and generating infinite sequences by a finite automaton
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Title not available (Why is that?)
- On ω-regular sets
- \(\omega\)-computations on deterministic pushdown machines
- On ω-sets associated with context-free languages
- Definability in the monadic second-order theory of successor
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the concept of strongly transitive systems in topology
Cited In (41)
- Title not available (Why is that?)
- The topological structure of adherences of regular languages
- \(\omega \)-automata
- Going beyond Turing with P automata: partial adult halting and regular observer \(\omega\)-languages
- Language-theoretical representations of \(\omega\)-languages
- Pomset Languages of Finite Step Transition Systems
- Efficient minimization of deterministic weak \(\omega\)-automata
- Title not available (Why is that?)
- Iterated function systems and control languages
- Title not available (Why is that?)
- Learning infinite-word automata with loop-index queries
- Subword metrics for infinite words
- First-order logic and numeration systems
- Half-positional objectives recognized by deterministic Büchi automata
- Infinite-word languages and continuous mappings
- Finite automata encoding geometric figures
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Closure of finite-state automaton languages
- On the minimization problem for \(\omega \)-automata
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Regular \(\omega\)-languages with an informative right congruence
- \(X\)-automata on \(\omega\)-words
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Title not available (Why is that?)
- The disjunctivities of \(\omega\)-languages.
- Learning regular omega languages
- A geometrical view of the determinization and minimization of finite-state automata
- Finitely generated bi\(\omega\)-languages
- Construction of a Deterministicω-Automaton Using Derivatives
- Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words
- Fractals, dimension, and formal languages
- On syntactic congruences for \(\omega\)-languages
- Ambiguity, weakness, and regularity in probabilistic Büchi automata
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages
- Polynomial identification of \(\omega \)-automata
- Classifying recognizable infinitary trace languages using word automata
- Title not available (Why is that?)
- Inferring regular languages and \(\omega\)-languages
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
- Rebootable and suffix-closed $\omega $-power languages
- Characterizations of rational \(\omega\)-languages by means of right congruences
This page was built for publication: Finite-state \(\omega\)-languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794443)
