Finite-state -languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3707805 (Why is no real title available?)
- scientific article; zbMATH DE number 3471986 (Why is no real title available?)
- scientific article; zbMATH DE number 3539162 (Why is no real title available?)
- scientific article; zbMATH DE number 3566723 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3341983 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- Definability in the monadic second-order theory of successor
- Derivatives of Regular Expressions
- On the concept of strongly transitive systems in topology
- On ω-regular sets
- On ω-sets associated with context-free languages
- 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
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- \(\omega\)-computations on deterministic pushdown machines
Cited in
(41)- Learning infinite-word automata with loop-index queries
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
- Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words
- Finite automata encoding geometric figures
- scientific article; zbMATH DE number 7453075 (Why is no real title available?)
- Going beyond Turing with P automata: partial adult halting and regular observer \(\omega\)-languages
- Efficient minimization of deterministic weak \(\omega\)-automata
- On the minimization problem for \(\omega \)-automata
- The topological structure of adherences of regular languages
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages
- Iterated function systems and control languages
- Regular \(\omega\)-languages with an informative right congruence
- Fractals, dimension, and formal languages
- \(\omega \)-automata
- Characterizations of rational \(\omega\)-languages by means of right congruences
- Subword metrics for infinite words
- Finitely generated bi\(\omega\)-languages
- scientific article; zbMATH DE number 6764298 (Why is no real title available?)
- Polynomial identification of \(\omega \)-automata
- Ambiguity, weakness, and regularity in probabilistic Büchi automata
- Construction of a Deterministicω-Automaton Using Derivatives
- Language-theoretical representations of \(\omega\)-languages
- Pomset Languages of Finite Step Transition Systems
- First-order logic and numeration systems
- Inferring regular languages and \(\omega\)-languages
- Infinite-word languages and continuous mappings
- \(X\)-automata on \(\omega\)-words
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Rebootable and suffix-closed $\omega $-power languages
- Half-positional objectives recognized by deterministic Büchi automata
- scientific article; zbMATH DE number 7649888 (Why is no real title available?)
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- A geometrical view of the determinization and minimization of finite-state automata
- Learning regular omega languages
- Closure of finite-state automaton languages
- The disjunctivities of \(\omega\)-languages.
- scientific article; zbMATH DE number 4039337 (Why is no real title available?)
- Classifying recognizable infinitary trace languages using word automata
- On syntactic congruences for \(\omega\)-languages
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)
