Zobrazeno 1 - 10
of 83
pro vyhledávání: '"twinning property"'
Publikováno v:
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16)
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.857--866, ⟨10.1145/2933575.2934549⟩
LICS
Proc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.857--866, ⟨10.1145/2933575.2934549⟩
LICS
Weighted automata (WA) extend finite-state automata by associating with transitions weights from a semiring $\mathbb {S}$, defining functions from words to S. Recently, cost register automata (CRA) have been introduced as an alternative model to desc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::610124322b1442c08a8550fb2894edf3
https://hal.science/hal-01475441
https://hal.science/hal-01475441
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the 2015 30th Annual ACM,IEEE Symposium on Logic in Computer Science; 7/5/2016, p857-866, 10p
Publikováno v:
From Normal Functors to Logarithmic Space Queries
46th International Colloquium on Automata, Languages, and Programming
46th International Colloquium on Automata, Languages, and Programming, Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.123⟩
46th International Colloquium on Automata, Languages, and Programming
46th International Colloquium on Automata, Languages, and Programming, Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.123⟩
International audience; Transducers extend finite state automata with outputs, and describe transformations from strings to strings. Sequential transducers, which have a deterministic behaviour regarding their input, are of particular interest. Howev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b56f2bc40a5ccebd68bc308cbcf9cfa
Autor:
villevalois, didier
Publikováno v:
Formal Languages and Automata Theory [cs.FL]. Aix-Marseille Université (AMU), 2019. English. ⟨NNT : ⟩
Formal Languages and Automata Theory [cs.FL]. Aix-Marseille Université (AMU), 2019. English
Formal Languages and Automata Theory [cs.FL]. Aix-Marseille Université (AMU), 2019. English
Synthesis is a field of computer science that consists in generating programs from abstract specifications. Specifications are often described via a logical formalism and programs are obtained as models of transformation. While, in the specifications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::69a1d145223c6d15cb82f35603c7b58f
https://hal.science/tel-02436759/document
https://hal.science/tel-02436759/document
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2006, 356, pp.224--244. ⟨10.1016/j.tcs.2006.01.028⟩
Theoretical Computer Science, Elsevier, 2006, 356, pp.224--244. ⟨10.1016/j.tcs.2006.01.028⟩
This paper is a survey where we try to organise the known answers to the question whether a given finite automaton with multiplicity in a semiring K is equivalent to a sequential, or input deterministic, one. We shall see that depending on K, the que
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d69b80e57fd9c7c59d4cf3cf73662a98
https://hal.archives-ouvertes.fr/hal-00069863
https://hal.archives-ouvertes.fr/hal-00069863
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the semantics is gi
Externí odkaz:
http://arxiv.org/abs/1701.04632