New types of automata to solve fixed point problems

DOI10.1016/S0304-3975(99)00335-7zbMath0973.68122OpenAlexW4300836029MaRDI QIDQ5941275

Ines Klimann

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00335-7

zbMATH Keywords

invarianceleft-cutmulti-automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Unnamed Item ⋮ A solution to the problem of (\(A\),\(B\))-invariance for series

Cites Work

• Maximal and minimal solutions to language equations
• On generalized language equations
• Geometric state-space theory in linear multivariable control: A status report
• On language equations with invertible operations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New types of automata to solve fixed point problems