Recognizable sets of power series over finite fields

DOI10.1016/J.CRMA.2015.12.015zbMath1387.03035OpenAlexW2209966527MaRDI QIDQ1695187

Luc Bélair, Françoise Point, Maxime Gélinas

Publication date: 7 February 2018

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2015.12.015

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cites Work

• The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
• LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD
• On Omega-Languages Defined by Mean-Payoff Conditions
• Un principe d'ax-kochen-ershov pour des structures intermédiates entre groupes et corps valués
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizable sets of power series over finite fields