scientific article

zbMath0271.94032MaRDI QIDQ3214824

B. A. Trakhtenbrot, Ja. M. Barzdin'

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) 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)

Related Items

Solving Infinite Games in the Baire Space, Infinite-word languages and continuous mappings, The complementation problem for Büchi automata with applications to temporal logic, Minimal consistent DFA revisited, Infinity problems and countability problems for \(\omega \)-automata, Certifying DFA bounds for recognition and separation, Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides, The state complexity of random DFAs, Delay Games with WMSO$$+$$U Winning Conditions, On the power of recursive optimizers, Program testing: Specification languages and automatic test generation, Efficient learning of typical finite automata from random walks, On translations of temporal logic of actions into monadic second-order logic, Minimal consistent DFA from sample strings, Recent advances of grammatical inference, Delay Games with WMSO+U Winning Conditions, Automata over continuous time, The size of power automata., Remark on the star-height-problem, Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Polynomial characteristic sets for \(DFA\) identification, Learning Meets Verification, Attributed transition systems with hidden transitions, Evaluation and Comparison of Inferred Regular Grammars, On direct products of automaton decidable theories, Learning recursive functions: A survey, Learning indexed families of recursive languages from positive data: A survey, Finite-state automata in information technologies, Program verification: state of the art, problems, and results. II, Semigroup automaton structure by homomorphism and domain partition, 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, Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\), On the Amount of Nonconstructivity in Learning Recursive Functions, Affine automata and classical fractals, Fine hierarchies and m-reducibilities in theoretical computer science, Kernel methods for learning languages, Automata over abstract finite quasigroups, Analysis of the structure of attributed transition systems without hidden transitions, Statistical estimation with bounded memory, Inference of regular languages using state merging algorithms with search, From Philosophical to Industrial Logics, A decidability result for deterministic \(\omega\)-context-free languages, Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages, A sufficient condition to polynomially compute a minimum separating DFA, Finite automata encoding geometric figures, \(\omega\)-computations on deterministic pushdown machines, 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, Facets of Synthesis: Revisiting Church’s Problem, How Much Lookahead is Needed to Win Infinite Games?, On the inference of strategies, How Much Lookahead is Needed to Win Infinite Games?, Combinatorial optimization by stochastic automata, Finite acceptance of infinite words, On the learnability and usage of acyclic probabilistic finite automata, Generalized regular expressions - a language for synthesis of programs with branching in loops, Learning Finite Automata Using Label Queries, Real functions incrementally computable by finite automata, Learning a Random DFA from Uniform Strings and State Information, Learning algorithms, Learning languages and functions by erasing, Diameter and stationary distribution of random \(r\)-out digraphs, Limit distributions of certain characteristics of random automaton graphs, How to decide continuity of rational functions on infinite words, Decidability of split equivalence, On the hardness of approximating the minimum consistent acyclic DFA and decision diagram., Recursively Generated Evolutionary Turing Machines and Evolutionary Automata, Finite variability interpretation of monadic logic of order, Shift-invariant topologies for the Cantor space \(X^{\omega}\)