On the definition of a family of automata
From MaRDI portal
Publication:3288101
DOI10.1016/S0019-9958(61)80020-XzbMath0104.00702OpenAlexW1984151763MaRDI QIDQ3288101
Publication date: 1961
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(61)80020-x
Related Items (only showing first 100 items - show all)
Rational languages and the Burnside problem ⋮ A simple proof of the Skolem-Mahler-Lech theorem ⋮ Noncommutative minimization algorithms ⋮ Approximate comparison of functions computed by distance automata ⋮ Noncommutative partially convex rational functions ⋮ Weighted automata and weighted logics with discounting ⋮ Alternating weighted automata over commutative semirings ⋮ Definable transductions and weighted logics for texts ⋮ Weighted automata and weighted logics on infinite words ⋮ Weighted finite automata over strong bimonoids ⋮ Minor identities for quasi-determinants and quantum determinants ⋮ Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring ⋮ A rationality criterion coming from noncommutative geometry ⋮ Noncommutative convexity arises from linear matrix inequalities ⋮ Skew and infinitary formal power series ⋮ Weighted tree automata and weighted logics ⋮ Inversion height in free fields ⋮ Applications of the theory of automata in enumeration ⋮ Function transformations with automata ⋮ Analytic subordination theory of operator-valued free additive convolution and the solution of a general random matrix problem ⋮ Applications of realizations (aka linearizations) to free probability ⋮ On a conjecture by Pierre Cartier about a group of associators ⋮ Weighted finite automata over hemirings ⋮ Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series ⋮ Noncommutative rational functions, their difference-differential calculus and realizations ⋮ Un théorème de factorisation des produits d'endomorphismes de \(K^N\) ⋮ Free iterative and iteration \(K\)-semialgebras ⋮ Series formelles et algèbres syntactiques ⋮ On transformations of formal power series. ⋮ Symmetric determinantal representation of polynomials ⋮ A coalgebraic perspective on linear weighted automata ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Sur les séries associees à certains systèmes de Lindenmayer ⋮ Finite automata theory with membership values in lattices ⋮ Matrix coefficient realization theory of noncommutative rational functions ⋮ Identities in upper triangular tropical matrix semigroups and the bicyclic monoid ⋮ Cofree coalgebras and multivariable recursiveness. ⋮ Deriving generic bounds for time-series constraints based on regular expressions characteristics ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ A spectral algorithm for learning hidden Markov models ⋮ Recognizable formal power series on trees ⋮ Derivatives of rational expressions and related theorems. ⋮ On aperiodic and star-free formal power series in partially commuting variables ⋮ Representation theory of finite semigroups over semirings. ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ Recognizable languages in concurrency monoids ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ Relations on words ⋮ \(\mathbb{N}\)-rationality of zeta functions ⋮ The ring of \(k\)-regular sequences ⋮ Rational relations and rational series ⋮ Weighted automata and logics for infinite nested words ⋮ The operation \(\uparrow\) on formal power series ⋮ Constructions of standard bases of right \(K\langle A\rangle\)- modules ⋮ Colored operads, series on colored operads, and combinatorial generating systems ⋮ Quantitative Kleene coalgebras ⋮ Weighted automata with discounting ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Weak MSO with the unbounding quantifier ⋮ Branching automata with costs -- a way of reflecting parallelism in costs ⋮ Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton ⋮ On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series ⋮ Progress in free associative algebras ⋮ Bilinear system interconnections and generating series of weighted Petri nets ⋮ Transductions des langages de Chomsky ⋮ Quantitative analysis of weighted transition systems ⋮ Algebraic realization theory of bilinear discrete-time input-output maps ⋮ On some questions of rationality and decidability ⋮ Noncommutative polynomials describing convex sets ⋮ On finite semigroups of matrices ⋮ Singularities of rational functions and minimal factorizations: the noncommutative and the commutative setting ⋮ A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties ⋮ Weighted restarting automata ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Outlier eigenvalues for non-Hermitian polynomials in independent i.i.d. matrices and deterministic matrices ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Weighted asynchronous cellular automata ⋮ Characterizations of recognizable picture series ⋮ Probabilistic automata of bounded ambiguity ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ What's decidable about weighted automata? ⋮ Principal abstract families of weighted tree languages ⋮ Weighted operator precedence languages ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Automata and rational expressions ⋮ Weighted automata ⋮ The design principles of a weighted finite-state transducer library ⋮ Image-binary automata ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields ⋮ The Kleene-Schützenberger theorem for formal power series in partially commuting variables. ⋮ A robust class of linear recurrence sequences ⋮ Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions ⋮ On cancellation properties of languages which are supports of rational power series ⋮ Modelization of deterministic rational relations ⋮ Noncommutative rational functions and boundary links ⋮ Some properties of recognizable \(\mathcal Z\)-subsets ⋮ The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
This page was built for publication: On the definition of a family of automata
