Travelled to:1 × Austria
1 × Denmark
1 × France
1 × Germany
1 × Hungary
1 × The Netherlands
2 × Finland
2 × USA
Collaborated with:C.Choffrut R.Radicioni G.Mauri F.D'Alessandro B.Palano N.Sabadini ∅ C.Mereghetti P.Miglioli M.Torelli M.A.Alberti P.Campadelli G.Grossi R.Posenato
Talks about:problem (8) languag (7) context (5) free (5) automata (4) approxim (4) quantum (4) comput (3) trace (3) some (3)
Person: Alberto Bertoni
DBLP: Bertoni:Alberto
Contributed to:
20132014200920112007200820062003
1995
1982
1981197919771972Wrote 14 papers:
- DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum
- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
- DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum
- On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
- DLT-2009-BertoniCR #context-free grammar #problem
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 103–112.
- DLT-J-2009-BertoniCR11 #context-free grammar #problem
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 289–299.
- DLT-2007-BertoniR #monad
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (AB, RR), pp. 72–83.
- DLT-J-2007-BertoniR08 #approximate #monad
- Approximating the Mean Speedup in Trace Monoids (AB, RR), pp. 497–511.
- DLT-2006-BertoniCP #context-free grammar #xml
- Context-Free Grammars and XML Languages (AB, CC, BP), pp. 108–119.
- DLT-2003-BertoniMP #automaton #quantum
- Quantum Computing: 1-Way Quantum Automata (AB, CM, BP), pp. 1–20.
- PDP-1995-AlbertiBCGP #problem #satisfiability
- A neural circuit for the maximum 2-satisfiability problem (MAA, AB, PC, GG, RP), pp. 319–323.
- ICALP-1982-BertoniMS #equivalence #problem
- Equivalence and Membership Problems for Regular Trace Languages (AB, GM, NS), pp. 61–71.
- STOC-1981-BertoniMS #polynomial #random
- A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines (AB, GM, NS), pp. 168–176.
- ICALP-1979-BertoniMM #invariant
- A Characterization of Abstract Data as Model-Theoretic Invariants (AB, GM, PM), pp. 26–37.
- ICALP-1977-BertoniMT #automaton #probability #problem #recursion
- Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata (AB, GM, MT), pp. 87–94.
- ICALP-1972-Bertoni #approximate #complexity #probability #problem
- Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines (AB), pp. 507–516.