75 citations
- Université Paris CitéFR78 papers
- Centre National de la Recherche ScientifiqueFR42 papers
- Délégation Paris 7FR14 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR11 papers
- Sorbonne UniversitéFR6 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR5 papers
- École Normale Supérieure de LyonFR4 papers
- Université Paris 8FR4 papers
- Computer Algorithms for MedicineAT3 papers
- École Normale Supérieure - PSLFR3 papers
- École PolytechniqueFR3 papers
Showing 2011 · cs.FLShow all
2 papers · 2 filters
cs.FL2011★ 2 cited
Pushing undecidability of the isolation problem for probabilistic automata
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable…
cs.FL2011
Splicing systems and the Chomsky hierarchy
Jean Berstel, Luc Boasson, Isabelle Fagnot
In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. Th…