On some questions of rationality and decidability

DOI10.1016/S0022-0000(75)80058-4zbMath0357.68064OpenAlexW2134382620MaRDI QIDQ1239001

No author found.

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80058-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Algorithms in computer science (68W99)

Related Items (13)

Rational languages and the Burnside problem ⋮ A note on the equivalence problem of rational formal power series ⋮ Definable transductions and weighted logics for texts ⋮ An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable ⋮ Rational and Recognisable Power Series ⋮ Unnamed Item ⋮ Series formelles et algèbres syntactiques ⋮ An algebraic characterization of semirings for which the support of every recognizable series is recognizable ⋮ The complete realization problem for hidden Markov models: a survey and some new results ⋮ Quantum learning of classical stochastic processes: The completely positive realization problem ⋮ Weighted automata ⋮ On cancellation properties of languages which are supports of rational power series ⋮ Some remarks on recognizable treeseries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrices de Hankel
• On the definition of a family of automata
• On linear systems and noncommutative rings
• On discrete-time polynomial systems

This page was built for publication: On some questions of rationality and decidability