Weighted omega-Restricted One Counter Automata
Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ${((S \ll \Sigma...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Logical Methods in Computer Science e.V.
2018-03-01
|
| Serier: | Logical Methods in Computer Science |
| Fag: | |
| Online adgang: | https://lmcs.episciences.org/3105/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|