scientific article; zbMATH DE number 3427224
From MaRDI portal
Publication:3214824
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Cited in
(77)- Infinite-word languages and continuous mappings
- The complementation problem for Büchi automata with applications to temporal logic
- On the power of recursive optimizers
- On translations of temporal logic of actions into monadic second-order logic
- Remark on the star-height-problem
- On direct products of automaton decidable theories
- Semigroup automaton structure by homomorphism and domain partition
- A decidability result for deterministic \(\omega\)-context-free languages
- Theory of -languages. I: Characterizations of -context- free languages
- -computations on deterministic pushdown machines
- On the inference of strategies
- Finite acceptance of infinite words
- On the learnability and usage of acyclic probabilistic finite automata
- Efficient learning of typical finite automata from random walks
- Recent advances of grammatical inference
- Automata over continuous time
- The size of power automata.
- Learning languages and functions by erasing
- How to decide continuity of rational functions on infinite words
- Finite variability interpretation of monadic logic of order
- Attributed transition systems with hidden transitions
- Affine automata and classical fractals
- Generalized regular expressions - a language for synthesis of programs with branching in loops
- Real functions incrementally computable by finite automata
- Limit distributions of certain characteristics of random automaton graphs
- Decidability of split equivalence
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Learning algorithms
- Certifying DFA bounds for recognition and separation
- Minimal consistent DFA from sample strings
- A sufficient condition to polynomially compute a minimum separating DFA
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Inference of regular languages using state merging algorithms with search
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
- Learning a Random DFA from Uniform Strings and State Information
- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
- Delay games with WMSO+U winning conditions
- On the amount of nonconstructivity in learning recursive functions
- Minimal consistent DFA revisited
- Delay games with WMSO+U winning conditions
- Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides
- The state complexity of random DFAs
- Learning Meets Verification
- Evaluation and Comparison of Inferred Regular Grammars
- From Philosophical to Industrial Logics
- Facets of Synthesis: Revisiting Church’s Problem
- Learning finite automata using label queries
- Program testing: Specification languages and automatic test generation
- Polynomial characteristic sets for \(DFA\) identification
- Finite-state automata in information technologies
- Program verification: state of the art, problems, and results. II
- Solving Infinite Games in the Baire Space
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
- Church’s Problem and a Tour through Automata Theory
- From Monadic Logic to PSL
- How much lookahead is needed to win infinite games?
- How Much Lookahead is Needed to Win Infinite Games?
- Constructing deterministic parity automata from positive and negative examples
- Active learning for sound negotiations
- Monotonic and dual monotonic language learning
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Automata over abstract finite quasigroups
- Analysis of the structure of attributed transition systems without hidden transitions
- Extending antichains in the poset \(\langle [\omega]^{<\omega},\subseteq \rangle\)
- Unsupervised automata learning via discrete optimization
- The Church synthesis problem over continuous time
- Statistical estimation with bounded memory
- An evaluation of massively parallel algorithms for DFA minimization
- Combinatorial optimization by stochastic automata
- Diameter and stationary distribution of random r-out digraphs
- Infinity problems and countability problems for -automata
- Learning recursive functions: A survey
- Learning indexed families of recursive languages from positive data: A survey
- Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
- Fine hierarchies and m-reducibilities in theoretical computer science
- Kernel methods for learning languages
- Finite automata encoding geometric figures
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 Q3214824)
