Automata and languages generalized to -continuous semirings
From MaRDI portal
Publication:2640344
DOI10.1016/0304-3975(91)90147-TzbMATH Open0719.68034MaRDI QIDQ2640344FDOQ2640344
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
Cited In (23)
- On the generative power of \(\omega \)-grammars and \(\omega \)-automata
- Accepting conditions for automata on \(\omega\)-languages
- On Lindenmayerian algebraic sequences
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)
- On limits in complete semirings
- The algebraic equivalent of AFL theory
- Title not available (Why is that?)
- On Lindenmayerian algebraic power series
- The equational logic of fixed points
- On syntactic nuclei of rational languages
- Title not available (Why is that?)
- An iteration property of Lindenmayerian power series
- Semitopological semirings and pushdown automata
- The validity of weighted automata
- Unique, guarded fixed points in an additive setting: extended abstract
- Title not available (Why is that?)
- On transductions of formal power series over complete semirings
- On D0L power series
- Title not available (Why is that?)
- The net automaton of a rational expression
- Representations and complete semiring morphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Automata and languages generalized to \(\omega\)-continuous semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640344)
