From Hadamard expressions to weighted rotating automata and back

DOI10.1016/j.tcs.2018.09.017zbMath1429.68107OpenAlexW2892655259WikidataQ129247458 ScholiaQ129247458MaRDI QIDQ5919578

Louis-Marie Dando, Sylvain Lombardy

Publication date: 20 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.017

zbMATH Keywords

Hadamard productweighted automatarational seriesrotating automata

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Size complexity of rotating and sweeping automata
• Follow automata.
• Derivatives of rational expressions with multiplicity
• On Determinism and Unambiguity of Weighted Two-Way Automata
• Two-way representations and weighted automata
• On the definition of a family of automata
• From Regular Weighted Expressions to Finite Automata
• Glushkov Construction For Series: The Non Commutative Case
• Nondeterminism and the size of two way finite automata
• Boolean Matrices and the Stability of Neural Nets

This page was built for publication: From Hadamard expressions to weighted rotating automata and back