Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(27)
Carlo Mereghetti
15
Viliam Geffert
11
Danilo Bruschi
6
Alberto Bertoni
4
Jeffrey O. Shallit
4
Conferences
(8)
MFCS
5
DLT
3
STACS
2
CIAA(WIA)
2
FCT
2
Journals
(14)
IANDC
5
CORR
5
IPL
4
TCS
4
IJFCS
3
Keywords
(47)
Embed
Subscribe
Academic
Authors
Giovanni Pighizzini
Giovanni Pighizzini,Università degli Studi di Milano,Algorithms & Theory,Scientific Computing,Data Mining
Edit
Giovanni Pighizzini
Università degli Studi di Milano
Publications:
58
|
Citations:
249
Fields:
Algorithms & Theory
,
Scientific Computing
,
Data Mining
View FAQ about top research areas and Fields of study
Collaborated with
27 co-authors
from 1988 to 2011
|
Cited by
157 authors
Cumulative
Annual
Sort by:
Publications
(58)
BibTeX
|
RIS
|
RefWorks
Download
Optimal simulation of self-verifying automata by deterministic automata
(
Citations: 1
)
Galina Jirásková
,
Giovanni Pighizzini
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 3, pp. 528-535, 2011
Two-Way Automata Making Choices Only at the Endmarkers
Viliam Geffert
,
Bruno Guillon
,
Giovanni Pighizzini
Published in 2011.
Two-way unary automata versus logarithmic space
Viliam Geffert
,
Giovanni Pighizzini
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 7, pp. 1016-1025, 2011
Two-Way Unary Automata versus Logarithmic Space
(
Citations: 2
)
Viliam Geffert
,
Giovanni Pighizzini
Conference:
Developments in Language Theory - DLT
, pp. 197-208, 2010
One Pebble Versus epsilon * log n Bits
Viliam Geffert
,
Giovanni Pighizzini
,
Carlo Mereghetti
Journal:
Fundamenta Informaticae - FUIN
, vol. 104, no. 1-2, pp. 55-69, 2010
Sort by:
Citations
(249 times by 162 publications)
Undecidability of state complexity
Arto Salomaa
,
Kai Salomaa
,
Sheng Yu
Journal:
International Journal of Computer Mathematics - IJCM
, vol. ahead-of-p, no. ahead-of-p, pp. 1-11, 2012
Descriptional and computational complexity of finite automata - A survey
(
Citations: 2
)
Markus Holzer
,
Martin Kutrib
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 3, pp. 456-470, 2011
Optimal simulation of self-verifying automata by deterministic automata
(
Citations: 1
)
Galina Jirásková
,
Giovanni Pighizzini
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 3, pp. 528-535, 2011
Complexity of multi-head finite automata: Origins and directions
(
Citations: 1
)
Markus Holzer
,
Martin Kutrib
,
Andreas Malcher
Journal:
Theoretical Computer Science - TCS
, vol. 412, no. 1-2, pp. 83-96, 2011
Some results on the structure of unary unambiguous automata
(
Citations: 1
)
Marcella Anselmo
,
Maria Madonia
Journal:
Advances in Applied Mathematics - ADVAN APPL MATH
, vol. 47, no. 1, pp. 88-101, 2011
Comments