Automata theory and its applications
From MaRDI portal
Publication:5936849
zbMath1083.68058MaRDI QIDQ5936849
Anil Nerode, Bakhadyr Khoussainov
Publication date: 9 July 2001
Published in: Progress in Computer Science and Applied Logic (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items
Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Pumping for ordinal-automatic structures1 ⋮ Weighted automata and weighted logics ⋮ Weighted automata and weighted logics with discounting ⋮ Infinite games on finite graphs using grossone ⋮ Weighted Automata and Weighted Logics ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Regular language representations in the constructive type theory of Coq ⋮ Rational elements of summation semirings ⋮ Liveness in broadcast networks ⋮ Randomness of formal languages via automatic martingales ⋮ Modelling Uncertainty in Architectures of Parametric Component-Based Systems ⋮ Taming strategy logic: non-recurrent fragments ⋮ Weighted Automata and Weighted Logics with Discounting ⋮ Reasoning About Substructures and Games ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Logic vs topology on regular \(\omega \)-languages ⋮ Deciding the isomorphism problem in classes of unary automatic structures ⋮ A new algorithm for testing diagnosability of fuzzy discrete event systems ⋮ Rauzy Fractal of the Smallest Substitution Associated with the Smallest Pisot Number ⋮ Uncountable automatic classes and learning ⋮ Infinite Games on Finite Graphs Using Grossone ⋮ Verification of component-based systems with recursive architectures ⋮ EXPANSIONS OF THE ORDERED ADDITIVE GROUP OF REAL NUMBERS BY TWO DISCRETE SUBGROUPS ⋮ Unnamed Item ⋮ Recognizing malicious software behaviors with tree automata inference ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weak Second‐Order Arithmetic and Finite Automata ⋮ The complexity of recursion theoretic games ⋮ Yet Another Characterization of the Pisot Substitution Conjecture ⋮ Ostrowski numeration systems, addition, and finite automata ⋮ How to avoid a compact set ⋮ Learners based on transducers ⋮ Model checking of linear-time properties in multi-valued systems ⋮ Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists ⋮ Sampling polynomial trajectories for LTL verification ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Uncountable Automatic Classes and Learning ⋮ Weighted automata ⋮ Automata on infinite trees ⋮ Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation ⋮ A language hierarchy and kitchens-type theorem for self-similar groups ⋮ Unnamed Item ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics
