scientific article; zbMATH DE number 2206109
From MaRDI portal
Publication:5317419
Semigroups in automata theory, linguistics, etc. (20M35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Combinatorics on words (68R15) Applications of game theory (91A80)
Recommendations
- scientific article; zbMATH DE number 988807
- Automata and semigroups recognizing infinite words
- scientific article; zbMATH DE number 1263593
- Logic, semigroups and automata on words
- Automata and Logics for Words and Trees over an Infinite Alphabet
- scientific article; zbMATH DE number 4140052
- Automata, logics, and infinite games. A guide to current research
- Automata on infinite words and their applications in formal verification
- scientific article; zbMATH DE number 3924161
Cited in
(only showing first 100 items - show all)- Powers of rationals modulo 1 and rational base number systems
- Infinite periodic points of endomorphisms over special confluent rewriting systems
- Topology on words
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Weak bases and quasi-pseudo-metrization of bispaces
- Level two of the quantifier alternation hierarchy over infinite words
- The word problem for omega-terms over the Trotter-Weil hierarchy
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- Inferring regular languages and \(\omega\)-languages
- Sequentializing cellular automata
- Recognizable sets of power series over finite fields
- Separability by piecewise testable languages is \textsc{PTime}-complete
- Reasoning about graded strategy quantifiers
- Computational capabilities of analog and evolving neural networks over infinite input streams
- Tree-shifts of finite type
- Local temporal logic is expressively complete for cograph dependence alphabets
- On the descriptional complexity of finite automata with modified acceptance conditions
- Finite-state independence
- Closure properties of locally finite \(\omega\)-languages
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Decimation and interleaving operations in one-sided symbolic dynamics
- Preservation of normality by non-oblivious group selection
- Nilpotency and periodic points in non-uniform cellular automata
- On degrees of ambiguity for Büchi tree automata
- -automata
- Automata on infinite trees
- Minimisation of automata
- Varieties
- Wadge-Wagner hierarchies
- Equational theories for automata
- Gardens of Eden in the game of life
- On the Weihrauch degree of the additive Ramsey theorem over the rationals
- Descriptive set theory, from Cantor to Wadge and beyond
- Preservation of normality by unambiguous transducers
- Bisimulation invariant monadic-second order logic in the finite
- On detectability of labeled Petri nets and finite automata
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Some complete -powers of a one-counter language, for any Borel class of finite rank
- Certifying inexpressibility
- Classical and effective descriptive complexities of \(\omega \)-powers
- Detecting fictitious states in a -automaton synthesized from its specification in the language LP
- Boolean algebras of regular languages
- Normality and two-way automata
- A characterization of oblivious message adversaries for which consensus is solvable
- An analogue of Cobham's theorem for graph directed iterated function systems
- On labeled birooted tree languages: algebras, automata and logic
- Completeness results for omega-regular algebras
- Omega-rational expressions with bounded synchronization delay
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Fuzzy tree automata
- Dynamical directions in numeration
- On the complexity of infinite words generated by countable \(q\)-automata
- Complementation of rational sets on scattered linear orderings of finite rank
- Timed substitutions for regular signal-event languages
- Decidability and universality of quasiminimal subshifts
- Classifying recognizable infinitary trace languages using word automata
- Bounded variability of metric temporal logic
- Message exchange games in strategic contexts
- Finite-state independence and normal sequences
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
- On weighted first-order logics with discounting
- A complete characterization of deterministic regular liveness properties
- Execution monitoring enforcement under memory-limitation constraints
- The recognizability of sets of graphs is a robust property
- Mean-payoff games with partial observation
- Spectrum, algebraicity and normalization in alternate bases
- Rational selecting relations and selectors
- MSO-definable properties of Muller context-free languages are decidable
- Operations on weakly recognizing morphisms
- Computational classification of cellular automata
- Automated formal analysis and verification: an overview
- Regular languages of thin trees
- Classifying recognizable infinitary trace languages using word automata
- Operator precedence languages: their automata-theoretic and logic characterization
- Expressive power of non-deterministic evolving recurrent neural networks in terms of their attractor dynamics
- Going beyond Turing with P automata: partial adult halting and regular observer -languages
- Reasoning about strategies: on the model-checking problem
- Subword metrics for infinite words
- Language games
- On some sets of dictionaries whose -powers have a given complexity
- AF inverse monoids and the structure of countable MV-algebras
- Some problems in automata theory which depend on the models of set theory
- scientific article; zbMATH DE number 988807 (Why is no real title available?)
- Infinite games specified by 2-tape automata
- Well-Quasi Orders and Hierarchy Theory
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Incompleteness theorems, large cardinals, and automata over infinite words
- Recognisable languages over monads
- Weighted Automata and Weighted Logics with Discounting
- The Algebraic Counterpart of the Wagner Hierarchy
- On the continuity set of an Omega rational function
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- Some Algebraic Properties of Machine Poset of Infinite Words
- A new algebraic invariant for weak equivalence of sofic subshifts
- Complexity of Topological Properties of Regular ω-Languages
- Bicyclic subsemigroups in amalgams of finite inverse semigroups.
- On selective unboundedness of VASS
- CAYLEY AUTOMATON SEMIGROUPS
- Highly Undecidable Problems For Infinite Computations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317419)
