Descriptional and computational complexity of finite automata—A survey

Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages. Over the last half century, a vast literature documenting the importance of deterministic, nondeterm...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 209; no. 3; pp. 456 - 470
Main Authors:	Holzer, Markus, Kutrib, Martin
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Amsterdam Elsevier Inc 01.03.2011 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Alternation Applied sciences Computational complexity Computer science; control theory; systems Descriptional complexity Determinism Exact sciences and technology Finite automata Miscellaneous Nondeterminism Survey Theoretical computing Determinism Descriptional complexity Survey Alternation Finite automata Nondeterminism Computational complexity Linear grammar Approximation Computer theory Language family Deterministic automaton Minimization Finite automaton Regular language Non determinism Non deterministic automaton Simulation Context free grammar
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages. Over the last half century, a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept has been developed. In the present paper, we tour a fragment of this literature. Mostly, we discuss developments relevant to finite automata related problems like, for example, (i) simulation of and by several types of finite automata, (ii) standard automata problems such as fixed and general membership, emptiness, universality, equivalence, and related problems, and (iii) minimization and approximation. We thus come across descriptional and computational complexity issues of finite automata. We do not prove these results but we merely draw attention to the big picture and some of the main ideas involved.
AbstractList	Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages. Over the last half century, a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept has been developed. In the present paper, we tour a fragment of this literature. Mostly, we discuss developments relevant to finite automata related problems like, for example, (i) simulation of and by several types of finite automata, (ii) standard automata problems such as fixed and general membership, emptiness, universality, equivalence, and related problems, and (iii) minimization and approximation. We thus come across descriptional and computational complexity issues of finite automata. We do not prove these results but we merely draw attention to the big picture and some of the main ideas involved.
Author	Kutrib, Martin Holzer, Markus
Author_xml	– sequence: 1 givenname: Markus surname: Holzer fullname: Holzer, Markus email: holzer@informatik.uni-giessen.de – sequence: 2 givenname: Martin surname: Kutrib fullname: Kutrib, Martin email: kutrib@informatik.uni-giessen.de
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24010417$$DView record in Pascal Francis
BookMark	eNp9kL1OwzAUhS1UJNrCzpiFscE3cZyYrSo_RarEArPl3NiSqzSJbLeiGw_BE_IkJEpZkGC5f7rfkc6ZkUnTNpqQa6AxUOC329hinNBhhZhCekamQAVdJDyDCZnSop8zRuGCzLzfUgqQMT4l63vt0dku2LZRdaSaKsJ21-2DOl2GrdbvNhyj1kTGNjboSO1Du1NBfX18LiO_dwd9vCTnRtVeX536nLw9Pryu1ovNy9PzarlZYCpo6GtaYs55pYTAgomqLDMmVMpzzEtkCdVlykpRlrwqAI3ROacFz0QOJs-BqXRObkbdTnlUtXGqQetl5-xOuaNMeouUQd7_8fEPXeu900aiHU0Fp2wtgcohN7mVFuWQmwSQfW49SH-BP9r_IHcjonvjB6ud9Gh1g7qyTmOQVWv_hr8BiUeIDg
CODEN	INFCEC
CitedBy_id	crossref_primary_10_1016_j_ic_2021_104744 crossref_primary_10_1155_2014_687517 crossref_primary_10_1142_S0129054124430032 crossref_primary_10_1007_s00037_014_0089_9 crossref_primary_10_1016_j_tcs_2025_115280 crossref_primary_10_1016_j_tcs_2024_114506 crossref_primary_10_1007_s00224_020_10028_3 crossref_primary_10_1016_j_ic_2025_105336 crossref_primary_10_1007_s41635_018_0047_0 crossref_primary_10_1016_j_ic_2025_105337 crossref_primary_10_1007_s00236_015_0245_y crossref_primary_10_1016_j_ic_2025_105357 crossref_primary_10_1016_j_tcs_2012_03_043 crossref_primary_10_1016_j_ic_2017_09_003 crossref_primary_10_1016_j_tcs_2023_113710 crossref_primary_10_1016_j_jcss_2025_103681 crossref_primary_10_1016_j_tcs_2019_06_021 crossref_primary_10_1109_TFUZZ_2014_2315620 crossref_primary_10_1007_s10626_021_00344_2 crossref_primary_10_1016_j_jcss_2017_05_011 crossref_primary_10_1016_j_ic_2021_104778 crossref_primary_10_1016_j_jcss_2025_103634 crossref_primary_10_1016_j_ic_2017_06_004 crossref_primary_10_1016_j_tcs_2015_04_017 crossref_primary_10_1016_j_ipl_2017_02_006 crossref_primary_10_1016_j_jcss_2014_12_027 crossref_primary_10_1016_j_tcs_2016_05_018 crossref_primary_10_1007_s00224_014_9603_3 crossref_primary_10_1016_j_ic_2020_104615 crossref_primary_10_1016_j_dam_2025_04_023 crossref_primary_10_1016_j_tcs_2015_07_006 crossref_primary_10_3390_a10010024 crossref_primary_10_1007_s11432_018_9739_9 crossref_primary_10_1016_j_tcs_2011_12_048 crossref_primary_10_1016_j_jcss_2017_07_011 crossref_primary_10_1109_TAC_2017_2726582 crossref_primary_10_1016_j_ic_2021_104690 crossref_primary_10_1016_j_tcs_2014_11_015 crossref_primary_10_1016_j_tcs_2017_03_007 crossref_primary_10_3390_app14041490 crossref_primary_10_1016_j_tcs_2025_115249 crossref_primary_10_1016_j_tcs_2025_115063 crossref_primary_10_1080_00207160_2012_704994 crossref_primary_10_1016_j_tcs_2012_04_028 crossref_primary_10_1016_j_ic_2023_105080 crossref_primary_10_1016_j_tcs_2014_02_013 crossref_primary_10_3390_math13020313
Cites_doi	10.1016/j.tcs.2009.07.049 10.1016/0022-0000(79)90002-3 10.1016/S0022-0000(76)80038-4 10.1016/0304-3975(80)90069-9 10.1016/0304-3975(79)90044-6 10.1007/BF00276023 10.1016/S0304-3975(81)80005-9 10.1016/j.ic.2008.06.007 10.1109/T-C.1971.223108 10.1137/0214044 10.1016/0020-0190(92)90198-5 10.1016/S0020-0190(05)80006-7 10.1007/BF00263744 10.1016/0020-0190(96)00095-6 10.1137/0222067 10.1016/S0019-9958(85)80058-9 10.1016/0022-0000(89)90037-8 10.1016/0304-3975(81)90057-8 10.1016/0304-3975(93)90252-O 10.1016/S0022-0000(71)80003-X 10.1142/S012905419100011X 10.1016/0304-3975(91)90075-D 10.1016/S0022-0000(75)80050-X 10.1145/322234.322243 10.1147/rd.32.0114 10.1137/0217058 10.1016/S0890-5401(03)00090-7 10.1007/BF00299636 10.1016/0022-0000(90)90022-D 10.1016/0304-3975(86)90142-8 10.1007/BF01691341 10.1142/S0129054109006747 10.1137/S009753979935431X 10.1016/0022-0000(80)90034-3 10.1137/0207007 10.1016/S0019-9958(78)90562-4 10.1016/0168-0072(83)90038-6 10.1080/00207169008803893 10.1007/BF01212963 10.1016/0890-5401(92)90002-W 10.1016/S0019-9958(65)90108-7 10.1007/BF01744431 10.1016/j.tcs.2004.03.070 10.1145/800125.804030 10.1145/48014.63138 10.1145/322017.322020 10.1016/0304-3975(85)90215-4 10.1016/S0019-9958(64)90120-2 10.1016/S0304-3975(03)00136-1 10.1142/S0129054103002199
ContentType	Journal Article Conference Proceeding
Copyright	2010 Elsevier Inc. 2015 INIST-CNRS
Copyright_xml	– notice: 2010 Elsevier Inc. – notice: 2015 INIST-CNRS
DBID	6I. AAFTH AAYXX CITATION IQODW
DOI	10.1016/j.ic.2010.11.013
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Applied Sciences
EISSN	1090-2651
EndPage	470
ExternalDocumentID	24010417 10_1016_j_ic_2010_11_013 S0890540110001999
GroupedDBID	--K --M --Z -~X .~1 0R~ 1B1 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 DM4 DU5 E3Z EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ H~9 IHE IXB J1W KOM LG5 LX9 M41 MHUIS MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSW SSZ T5K TN5 WH7 WUQ XJT XPP ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH
ID	FETCH-LOGICAL-c390t-c33bc766da99c849dbb549a367c7bc420eb34b9bb6d81cffe760865971f7714a3
ISICitedReferencesCount	108
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000287382300014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0890-5401
IngestDate	Mon Jul 21 09:14:11 EDT 2025 Sat Nov 29 01:56:32 EST 2025 Tue Nov 18 20:50:47 EST 2025 Fri Feb 23 02:25:06 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Determinism Descriptional complexity Survey Alternation Finite automata Nondeterminism Computational complexity Linear grammar Approximation Computer theory Language family Deterministic automaton Minimization Finite automaton Regular language Non determinism Non deterministic automaton Simulation Context free grammar
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MeetingName	3rd International Conference on Langage and Automata Theory and Applications (LATA 2009)
MergedId	FETCHMERGED-LOGICAL-c390t-c33bc766da99c849dbb549a367c7bc420eb34b9bb6d81cffe760865971f7714a3
OpenAccessLink	https://dx.doi.org/10.1016/j.ic.2010.11.013
PageCount	15
ParticipantIDs	pascalfrancis_primary_24010417 crossref_citationtrail_10_1016_j_ic_2010_11_013 crossref_primary_10_1016_j_ic_2010_11_013 elsevier_sciencedirect_doi_10_1016_j_ic_2010_11_013
PublicationCentury	2000
PublicationDate	2011-03-01
PublicationDateYYYYMMDD	2011-03-01
PublicationDate_xml	– month: 03 year: 2011 text: 2011-03-01 day: 01
PublicationDecade	2010
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Information and computation
PublicationYear	2011
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Damm, Holzer, Lange (b0100) 1992; vol. 629 Barrington (b0035) 1989; 38 Stockmeyer, Meyer (b0415) 1973 Ibarra, Ravikumar (b0255) 1986; vol. 210 McNaughton, Papert (b0345) 1971; vol. 65 Glaister, Shallit (b0135) 1996; 59 Hopcroft (b0200) 1971 Hunt, Rosenkrantz (b0240) 1978; 7 Landau (b0310) 1903; 3 Rivest, Schapire (b0380) 1987 Schützenberger (b0390) 1965; 8 Barrington, Immerman, Straubing (b0040) 1990; 41 Yu (b0435) 2001; 6 Kao, Malton, Rampersad, Shallit (b0290) 2009; 410 Garey, Johnson (b0130) 1979 Hromkovic, Schnitger (b0215) 2008; vol. 5257 L.J. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic, Ph.D. Thesis, MIT, Cambridge, Massasuchets, USA, 1974. H.B. Hunt III, On the time and tape complexity of languages, Ph.D. Thesis, Cornell University, Ithaca, New York, USA, 1973. Furst, Saxe, Sipser (b0120) 1984; 17 Sipser (b0395) 1980; 21 Jones (b0285) 1975; 11 Monien (b0365) 1981; vol. 117 Szelepcsényi (b0420) 1988; 26 Fellah, Jürgensen, Yu (b0115) 1990; 35 Leiss (b0325) 1981; 13 Adorna (b0005) 2005 Ajtai (b0020) 1983; 24 Kozen (b0300) 1977 Gramlich, Schnitger (b0150) 2005; vol. 3404 Gold (b0140) 1978; 37 Birget (b0050) 1992; 43 Valiant (b0430) 1979; 8 Rozenberg, Salomaa (b0385) 1980; vol. 90 Gruber, Holzer (b0160) 2006; vol. 4036 Huynh (b0250) 1992 Hopcroft, Ullman (b0205) 1979 Jiang, Ravikumar (b0275) 1991; 40 Köbler, Schöning, Torán (b0295) 1989; 26 Álvarez, Jenner (b0015) 1993; 107 Rabin, Scott (b0375) 1959; 3 Immerman (b0265) 1988; 17 Malcher (b0335) 2004; 327 Hunt, Rosenkrantz (b0235) 1977; 24 Björklund, Martens (b0055) 2008; vol. 5126 Hromkovič (b0210) 1997 Aho, Hopcroft, Ullman (b0010) 1974 Kuroda (b0305) 1964; 7 Jiang, Ravikumar (b0280) 1993; 22 Moore (b0370) 1971; 20 Stearns, Hunt (b0400) 1985; 14 Chrobak (b0085) 1986; 47 Stern (b0405) 1985; 66 Lange, Rossmanith (b0320) 1992; vol. 629 Meyer, Fischer (b0355) 1971 Damm, Holzer, Lange, Rossmanith (b0105) 1994 Holzer, Kutrib (b0190) 2009; 20 Landau (b0315) 1909 Holzer, Kutrib (b0185) 2003; 14 Hunt (b0225) 1973 Chrobak (b0090) 2003; 302 Brzozowski, Shallit, Xu (b0060) 2009; vol. 5457 Cohen, Brzozowski (b0095) 1971; 5 Gramlich (b0145) 2003; vol. 2747 Gruber, Holzer (b0170) 2007; vol. 4588 Ilie, Yu (b0260) 2003; 186 Jiang, McDowell, Ravikumar (b0270) 1991; 2 Mereghetti, Pighizzini (b0350) 2001; 30 Brzozowski, Leiss (b0065) 1980; 10 Yu (b0440) 1997; 1 Galil (b0125) 1976; 6 Greibach (b0155) 1968; 2 Hunt III, Rosenkrantz, Szymanski (b0245) 1976; 12 Hunt III (b0230) 1979; 19 Amilhastre, Janssen, Vilarem (b0025) 2001; vol. 2214 Leiss (b0330) 1985; 38 Eilenberg (b0110) 1976 Holzer (b0180) 1996 Holzer, Salomaa, Yu (b0195) 2001; 6 McKenzie, Péladeau, Thérien (b0340) 1991; 1 H. Gruber, M. Holzer, Computational complexity of NFA minimization for finite and unary languages, in: Language and Automata Theory and Applications (LATA 2007), Technical Report 35/07, Universitat Rovira i Virgili, Tarragona, 2007, pp. 261–272. Chandra, Kozen, Stockmeyer (b0070) 1981; 21 Thérien (b0425) 1981; 14 Hartmanis, J., Hunt III, H.B., The LBA problem and its importance in the theory of computing, in: SIAM AMS Vol. 7 on Complexity of Computing, 1974, 1–26. Anderson, Loftus, Rampersad, Santean, Shallit (b0030) 2009; 207 Barrington, Thérien (b0045) 1988; 35 Cho, Huynh (b0075) 1991; 88 Cho, Huynh (b0080) 1992; 97 Meyer, Stockmeyer (b0360) 1972 10.1016/j.ic.2010.11.013_b0220 Malcher (10.1016/j.ic.2010.11.013_b0335) 2004; 327 Brzozowski (10.1016/j.ic.2010.11.013_b0065) 1980; 10 Valiant (10.1016/j.ic.2010.11.013_b0430) 1979; 8 Gruber (10.1016/j.ic.2010.11.013_b0170) 2007; vol. 4588 Meyer (10.1016/j.ic.2010.11.013_b0355) 1971 Ibarra (10.1016/j.ic.2010.11.013_b0255) 1986; vol. 210 Jiang (10.1016/j.ic.2010.11.013_b0275) 1991; 40 Leiss (10.1016/j.ic.2010.11.013_b0330) 1985; 38 Moore (10.1016/j.ic.2010.11.013_b0370) 1971; 20 Chrobak (10.1016/j.ic.2010.11.013_b0090) 2003; 302 Barrington (10.1016/j.ic.2010.11.013_b0035) 1989; 38 Jiang (10.1016/j.ic.2010.11.013_b0280) 1993; 22 Hromkovic (10.1016/j.ic.2010.11.013_b0215) 2008; vol. 5257 Mereghetti (10.1016/j.ic.2010.11.013_b0350) 2001; 30 Landau (10.1016/j.ic.2010.11.013_b0315) 1909 Lange (10.1016/j.ic.2010.11.013_b0320) 1992; vol. 629 Kozen (10.1016/j.ic.2010.11.013_b0300) 1977 Garey (10.1016/j.ic.2010.11.013_b0130) 1979 Ajtai (10.1016/j.ic.2010.11.013_b0020) 1983; 24 Szelepcsényi (10.1016/j.ic.2010.11.013_b0420) 1988; 26 Rabin (10.1016/j.ic.2010.11.013_b0375) 1959; 3 Holzer (10.1016/j.ic.2010.11.013_b0180) 1996 10.1016/j.ic.2010.11.013_b0410 McNaughton (10.1016/j.ic.2010.11.013_b0345) 1971; vol. 65 Anderson (10.1016/j.ic.2010.11.013_b0030) 2009; 207 Barrington (10.1016/j.ic.2010.11.013_b0040) 1990; 41 Gruber (10.1016/j.ic.2010.11.013_b0160) 2006; vol. 4036 10.1016/j.ic.2010.11.013_b0175 Chrobak (10.1016/j.ic.2010.11.013_b0085) 1986; 47 Galil (10.1016/j.ic.2010.11.013_b0125) 1976; 6 Damm (10.1016/j.ic.2010.11.013_b0100) 1992; vol. 629 Gold (10.1016/j.ic.2010.11.013_b0140) 1978; 37 Hunt (10.1016/j.ic.2010.11.013_b0225) 1973 Álvarez (10.1016/j.ic.2010.11.013_b0015) 1993; 107 McKenzie (10.1016/j.ic.2010.11.013_b0340) 1991; 1 Hopcroft (10.1016/j.ic.2010.11.013_b0205) 1979 Hromkovič (10.1016/j.ic.2010.11.013_b0210) 1997 Gramlich (10.1016/j.ic.2010.11.013_b0145) 2003; vol. 2747 Amilhastre (10.1016/j.ic.2010.11.013_b0025) 2001; vol. 2214 Schützenberger (10.1016/j.ic.2010.11.013_b0390) 1965; 8 Jiang (10.1016/j.ic.2010.11.013_b0270) 1991; 2 Leiss (10.1016/j.ic.2010.11.013_b0325) 1981; 13 Eilenberg (10.1016/j.ic.2010.11.013_b0110) 1976 Holzer (10.1016/j.ic.2010.11.013_b0190) 2009; 20 Yu (10.1016/j.ic.2010.11.013_b0440) 1997; 1 Köbler (10.1016/j.ic.2010.11.013_b0295) 1989; 26 Rivest (10.1016/j.ic.2010.11.013_b0380) 1987 10.1016/j.ic.2010.11.013_b0165 Fellah (10.1016/j.ic.2010.11.013_b0115) 1990; 35 Immerman (10.1016/j.ic.2010.11.013_b0265) 1988; 17 Meyer (10.1016/j.ic.2010.11.013_b0360) 1972 Monien (10.1016/j.ic.2010.11.013_b0365) 1981; vol. 117 Birget (10.1016/j.ic.2010.11.013_b0050) 1992; 43 Damm (10.1016/j.ic.2010.11.013_b0105) 1994 Sipser (10.1016/j.ic.2010.11.013_b0395) 1980; 21 Barrington (10.1016/j.ic.2010.11.013_b0045) 1988; 35 Thérien (10.1016/j.ic.2010.11.013_b0425) 1981; 14 Chandra (10.1016/j.ic.2010.11.013_b0070) 1981; 21 Greibach (10.1016/j.ic.2010.11.013_b0155) 1968; 2 Brzozowski (10.1016/j.ic.2010.11.013_b0060) 2009; vol. 5457 Cohen (10.1016/j.ic.2010.11.013_b0095) 1971; 5 Huynh (10.1016/j.ic.2010.11.013_b0250) 1992 Hunt III (10.1016/j.ic.2010.11.013_b0245) 1976; 12 Stockmeyer (10.1016/j.ic.2010.11.013_b0415) 1973 Landau (10.1016/j.ic.2010.11.013_b0310) 1903; 3 Furst (10.1016/j.ic.2010.11.013_b0120) 1984; 17 Aho (10.1016/j.ic.2010.11.013_b0010) 1974 Yu (10.1016/j.ic.2010.11.013_b0435) 2001; 6 Hopcroft (10.1016/j.ic.2010.11.013_b0200) 1971 Cho (10.1016/j.ic.2010.11.013_b0080) 1992; 97 Holzer (10.1016/j.ic.2010.11.013_b0185) 2003; 14 Hunt III (10.1016/j.ic.2010.11.013_b0230) 1979; 19 Ilie (10.1016/j.ic.2010.11.013_b0260) 2003; 186 Stern (10.1016/j.ic.2010.11.013_b0405) 1985; 66 Gramlich (10.1016/j.ic.2010.11.013_b0150) 2005; vol. 3404 Björklund (10.1016/j.ic.2010.11.013_b0055) 2008; vol. 5126 Hunt (10.1016/j.ic.2010.11.013_b0235) 1977; 24 Hunt (10.1016/j.ic.2010.11.013_b0240) 1978; 7 Stearns (10.1016/j.ic.2010.11.013_b0400) 1985; 14 Adorna (10.1016/j.ic.2010.11.013_b0005) 2005 Cho (10.1016/j.ic.2010.11.013_b0075) 1991; 88 Jones (10.1016/j.ic.2010.11.013_b0285) 1975; 11 Glaister (10.1016/j.ic.2010.11.013_b0135) 1996; 59 Kuroda (10.1016/j.ic.2010.11.013_b0305) 1964; 7 Rozenberg (10.1016/j.ic.2010.11.013_b0385) 1980; vol. 90 Holzer (10.1016/j.ic.2010.11.013_b0195) 2001; 6 Kao (10.1016/j.ic.2010.11.013_b0290) 2009; 410
References_xml	– reference: Hartmanis, J., Hunt III, H.B., The LBA problem and its importance in the theory of computing, in: SIAM AMS Vol. 7 on Complexity of Computing, 1974, 1–26. – volume: vol. 210 start-page: 171 year: 1986 end-page: 179 ident: b0255 article-title: On sparseness ambiguity and other decision problems for acceptors and transducers publication-title: Symposium on Theoretical Aspects of Computer Science (STACS 1986) – volume: 327 start-page: 375 year: 2004 end-page: 390 ident: b0335 article-title: Minimizing finite automata is computationally hard publication-title: Theoret. Comput. Sci. – start-page: 1 year: 1973 end-page: 9 ident: b0415 article-title: Word problems requiring exponential time publication-title: Symposium on Theory of Computing (STOC 1973) – volume: 17 start-page: 13 year: 1984 end-page: 27 ident: b0120 article-title: Parity, circuits, and the polynomial-time hierarchy publication-title: Math. Systems Theory – year: 1996 ident: b0180 publication-title: On Emptiness and Counting for Alternating Finite Automata – volume: 14 start-page: 195 year: 1981 end-page: 208 ident: b0425 article-title: Classification of finite monoids: the language approach publication-title: Theoret. Comput. Sci. – volume: vol. 629 start-page: 227 year: 1992 end-page: 235 ident: b0100 article-title: The parallel complexity of iterated morphisms and the arithmetic of small numbers publication-title: Mathematical Foundations of Computer Science (MFCS 1992) – start-page: 188 year: 1971 end-page: 191 ident: b0355 article-title: Economy of description by automata, grammars, and formal systems publication-title: IEEE Symposium on Switching and Automata Theory (SWAT 1971) – volume: vol. 5257 start-page: 34 year: 2008 end-page: 55 ident: b0215 article-title: On the hardness of determining small NFA’s and of proving lower bounds on their sizesm publication-title: Developments in Language Theory (DLT 2008) – volume: 7 start-page: 207 year: 1964 end-page: 223 ident: b0305 article-title: Classes of languages and linear bounded automata publication-title: Inform. Control – volume: 38 start-page: 150 year: 1989 end-page: 164 ident: b0035 article-title: Bounded-width polynomial-size branching programs recognize exactly those languages in publication-title: J. Comput. System Sci. – volume: vol. 4036 start-page: 363 year: 2006 end-page: 374 ident: b0160 article-title: Finding lower bounds for nondeterministic state complexity is hard (extended abstract) publication-title: Developments in Language Theory (DLT 2006) – volume: 19 start-page: 222 year: 1979 end-page: 236 ident: b0230 article-title: Observations on the complexity of regular expressions problems publication-title: J. Comput. System Sci. – year: 1992 ident: b0250 article-title: Complexity of Closeness Sparseness and Segment Equivalence for Context-free and Regular Languages publication-title: Informatik Festschrift zum 60 – volume: vol. 2747 start-page: 460 year: 2003 end-page: 469 ident: b0145 article-title: Probabilistic and nondeterministic unary automata publication-title: Mathematical Foundations of Computer Science (MFCS 2003) – volume: 410 start-page: 5010 year: 2009 end-page: 5021 ident: b0290 article-title: On NFA’s where all states are final, initial, or both publication-title: Theoret. Comput. Sci. – volume: 66 start-page: 163 year: 1985 end-page: 176 ident: b0405 article-title: Complexity of some problems from the theory of automata publication-title: Inform. Control – volume: vol. 629 start-page: 346 year: 1992 end-page: 354 ident: b0320 article-title: The emptiness problem for intersections of regular languages publication-title: Mathematical Foundations of Computer Science (MFCS 1992) – volume: 14 start-page: 598 year: 1985 end-page: 611 ident: b0400 article-title: On the equivalence and containment problems for unambiguous regular expressions, regular grammars, and finite automata publication-title: SIAM J. Comput. – year: 1909 ident: b0315 article-title: Handbuch der Lehre von der Verteilung der Primzahlen – volume: 24 start-page: 1 year: 1983 end-page: 48 ident: b0020 article-title: formulae on finite structures publication-title: Ann. Pure. Appl. Logic – volume: 186 start-page: 140 year: 2003 end-page: 162 ident: b0260 article-title: Follow automata publication-title: Inform. and Comput. – volume: vol. 90 year: 1980 ident: b0385 publication-title: The Mathematical Theory of L Systems – volume: 207 start-page: 1096 year: 2009 end-page: 1118 ident: b0030 article-title: Detecting palindroms, patterns, and borders in regular languages publication-title: Inform. and Comput. – volume: 10 start-page: 19 year: 1980 end-page: 35 ident: b0065 article-title: On equations for regular languages, finite automata, and sequential networks publication-title: Theoret. Comput. Sci. – reference: H.B. Hunt III, On the time and tape complexity of languages, Ph.D. Thesis, Cornell University, Ithaca, New York, USA, 1973. – reference: L.J. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic, Ph.D. Thesis, MIT, Cambridge, Massasuchets, USA, 1974. – volume: 47 start-page: 149 year: 1986 end-page: 158 ident: b0085 article-title: Finite automata and unary languages publication-title: Theoret. Comput. Sci. – reference: H. Gruber, M. Holzer, Computational complexity of NFA minimization for finite and unary languages, in: Language and Automata Theory and Applications (LATA 2007), Technical Report 35/07, Universitat Rovira i Virgili, Tarragona, 2007, pp. 261–272. – start-page: 10 year: 1973 end-page: 19 ident: b0225 article-title: On the time and tape complexity of languages I publication-title: Symposium on Theory of Computing (STOC 1973) – year: 2005 ident: b0005 publication-title: Some descriptional complexity problems in finite automata theory – volume: 6 start-page: 77 year: 1976 end-page: 88 ident: b0125 article-title: Hierarchies of complete problems publication-title: Acta Inform. – volume: 11 start-page: 68 year: 1975 end-page: 85 ident: b0285 article-title: Space-bounded reducibility among combinatorial problems publication-title: J. Comput. System Sci. – volume: 35 start-page: 117 year: 1990 end-page: 132 ident: b0115 article-title: Constructions for alternating finite automata publication-title: Int. J. Comput. Math. – volume: 302 start-page: 497 year: 2003 end-page: 498 ident: b0090 article-title: Errata to “finite automata and unary languages” publication-title: Theoret. Comput. Sci. – volume: 17 start-page: 935 year: 1988 end-page: 938 ident: b0265 article-title: Nondeterministic space is closed under complementation publication-title: SIAM J. Comput. – volume: 22 start-page: 1117 year: 1993 end-page: 1141 ident: b0280 article-title: Minimal NFA problems are hard publication-title: SIAM J. Comput. – volume: 12 start-page: 222 year: 1976 end-page: 268 ident: b0245 article-title: On the equivalence, containment, and covering problems for the regular and context-free languages publication-title: J. Comput. System Sci. – volume: 40 start-page: 25 year: 1991 end-page: 31 ident: b0275 article-title: A note on the space complexity of some decision problems for finite automata publication-title: Inform. Process. Lett. – volume: 26 start-page: 363 year: 1989 end-page: 379 ident: b0295 article-title: On counting and approximation publication-title: Acta Inform. – volume: 13 start-page: 323 year: 1981 end-page: 330 ident: b0325 article-title: Succinct representation of regular languages by Boolean automata publication-title: Theoret. Comput. Sci. – volume: 3 start-page: 114 year: 1959 end-page: 125 ident: b0375 article-title: Finite automata and their decision problems publication-title: IBM J. Res. Dev. – volume: vol. 117 start-page: 265 year: 1981 end-page: 280 ident: b0365 article-title: On the LBA problem publication-title: Fundamentals on Computation Theory (FCT 1981) – volume: 20 start-page: 1211 year: 1971 end-page: 1214 ident: b0370 article-title: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata publication-title: IEEE Trans. Comput. – year: 1976 ident: b0110 article-title: Automata, Languages, and Machines (Volume 59-B) – volume: 5 start-page: 1 year: 1971 end-page: 16 ident: b0095 article-title: Dot-depth of star-free events publication-title: J. Comput. System Sci. – volume: 97 start-page: 1 year: 1992 end-page: 22 ident: b0080 article-title: The parallel complexity of finite-state automata problems publication-title: Inform. and Comput. – volume: 6 start-page: 221 year: 2001 end-page: 234 ident: b0435 article-title: State complexity of regular languages publication-title: J. Autom. Lang. Comb. – volume: 41 start-page: 274 year: 1990 end-page: 306 ident: b0040 article-title: On uniformity within publication-title: J. Comput. System Sci. – year: 1979 ident: b0130 publication-title: Computers and Intractability – year: 1987 ident: b0380 article-title: Diversity-based Inference of Finite Automata (Extended Abstract) publication-title: Foundations of Computer Science (FOCS 1987) – volume: vol. 3404 start-page: 399 year: 2005 end-page: 411 ident: b0150 article-title: Minimizing NFA’s and regular expressions publication-title: Symposium on Theoretical Aspects of Computer Science (STACS 2005) – volume: 2 start-page: 163 year: 1991 end-page: 182 ident: b0270 article-title: The structure and complexity of minimal NFAs over a unary alphabet publication-title: Internat. J. Found. Comput. Sci. – year: 1994 ident: b0105 article-title: Deterministic 0L Languages are of very Low Complexity: D0L is in publication-title: Developments in Language Theory (DLT 1994) – year: 1974 ident: b0010 article-title: The Design and Analysis of Computer Algorithms – volume: 14 start-page: 1087 year: 2003 end-page: 1102 ident: b0185 article-title: Nondeterministic descriptional complexity of regular languages publication-title: Int. J. Found. Comput. Sci. – volume: 30 start-page: 1976 year: 2001 end-page: 1992 ident: b0350 article-title: Optimal simulations between unary automata publication-title: SIAM J. Comput. – start-page: 125 year: 1972 end-page: 129 ident: b0360 article-title: The equivalence problem for regular expressions with squaring requires exponential time publication-title: Symposium on Switching and Automata Theory (SWAT 1972) – volume: 2 start-page: 1 year: 1968 end-page: 6 ident: b0155 article-title: A note on undecidable properties of formal languages publication-title: Math. Systems Theory – volume: 1 start-page: 330 year: 1991 end-page: 359 ident: b0340 article-title: : The automata-theoretical viewpoint publication-title: Comput. Complexity – volume: 8 start-page: 190 year: 1965 end-page: 194 ident: b0390 article-title: On finite monoids having only trivial subgroups publication-title: Inform. Control – volume: 38 start-page: 133 year: 1985 end-page: 136 ident: b0330 article-title: Succinct representation of regular languages by Boolean automata. II publication-title: Theoret. Comput. Sci. – volume: 26 start-page: 279 year: 1988 end-page: 284 ident: b0420 article-title: The method of forced enumeration for nondeterministic automata publication-title: Acta Inform. – volume: vol. 5126 start-page: 27 year: 2008 end-page: 38 ident: b0055 article-title: The tractability frontier for NFA minimization publication-title: International Colloqium on Automata, Languages and Programming (ICALP 2008) – volume: 37 start-page: 302 year: 1978 end-page: 320 ident: b0140 article-title: Complexity of automaton identification from given data publication-title: Inform. Control – year: 1979 ident: b0205 publication-title: Introduction to Automata Theory, Languages and Computation – volume: 35 start-page: 941 year: 1988 end-page: 952 ident: b0045 article-title: Finite monoids and the fine structure of publication-title: J. ACM – volume: 8 start-page: 189 year: 1979 end-page: 201 ident: b0430 article-title: The complexity of computing the permanent publication-title: Theoret. Comput. Sci. – volume: 24 start-page: 387 year: 1977 end-page: 396 ident: b0235 article-title: On equivalence and contaiment problems for formal languages publication-title: J. ACM – year: 1971 ident: b0200 publication-title: An – volume: 59 start-page: 75 year: 1996 end-page: 77 ident: b0135 article-title: A lower bound technique for the size of nondeterministic finite automata publication-title: Inform. Process. Lett. – volume: 107 start-page: 3 year: 1993 end-page: 30 ident: b0015 article-title: A very hard log-space counting class publication-title: Theoret. Comput. Sci. – volume: 3 start-page: 92 year: 1903 end-page: 103 ident: b0310 article-title: Über die Maximalordnung der Permutationen gegebenen Grades publication-title: Archiv der Math. und Phys. – year: 1997 ident: b0210 article-title: Communication Complexity and Parallel Computing – year: 1977 ident: b0300 publication-title: Lower Bounds for Natural Proof Systems – volume: 20 start-page: 563 year: 2009 end-page: 580 ident: b0190 article-title: Nondeterministic finite automata – recent results on the descriptional and computational complexity publication-title: Int. J. Found. Comput. Sci. – volume: vol. 5457 start-page: 247 year: 2009 end-page: 258 ident: b0060 article-title: Decision problems for convex languages publication-title: Language and Automata Theory and Applications (LATA 2009) – volume: 7 start-page: 99 year: 1978 end-page: 114 ident: b0240 article-title: Computational parallels between the regular and context-free languages publication-title: SIAM J. Comput. – volume: 21 start-page: 114 year: 1981 end-page: 133 ident: b0070 article-title: Alternation publication-title: J. ACM – volume: 88 start-page: 99 year: 1991 end-page: 116 ident: b0075 article-title: Finite-automaton aperiodicity is PSPACE-complete publication-title: Theoret. Comput. Sci. – volume: vol. 65 year: 1971 ident: b0345 publication-title: Counter-free Automata – volume: vol. 2214 start-page: 1 year: 2001 end-page: 12 ident: b0025 article-title: FA minimisation heuristics for a class of finite languages publication-title: Workshop on Implementing Automata (WIA 2001) – volume: 6 start-page: 453 year: 2001 end-page: 466 ident: b0195 article-title: On the state complexity of publication-title: J. Autom. Lang. Comb. – volume: vol. 4588 start-page: 205 year: 2007 end-page: 216 ident: b0170 article-title: Inapproximability of nondeterministic state and transition complexity assuming publication-title: Developments in Language Theory (DLT 2007) – volume: 21 start-page: 195 year: 1980 end-page: 202 ident: b0395 article-title: Lower bounds on the size of sweeping automata publication-title: J. Comput. System Sci. – volume: 43 start-page: 85 year: 1992 end-page: 190 ident: b0050 article-title: Intersection and union of regular languages and state complexity publication-title: Inform. Process. Lett. – volume: 1 year: 1997 ident: b0440 article-title: Regular Languages publication-title: Handbook of Formal Languages – year: 2005 ident: 10.1016/j.ic.2010.11.013_b0005 – volume: 410 start-page: 5010 year: 2009 ident: 10.1016/j.ic.2010.11.013_b0290 article-title: On NFA’s where all states are final, initial, or both publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2009.07.049 – volume: vol. 90 year: 1980 ident: 10.1016/j.ic.2010.11.013_b0385 – volume: 19 start-page: 222 year: 1979 ident: 10.1016/j.ic.2010.11.013_b0230 article-title: Observations on the complexity of regular expressions problems publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(79)90002-3 – volume: vol. 2747 start-page: 460 year: 2003 ident: 10.1016/j.ic.2010.11.013_b0145 article-title: Probabilistic and nondeterministic unary automata – volume: 12 start-page: 222 year: 1976 ident: 10.1016/j.ic.2010.11.013_b0245 article-title: On the equivalence, containment, and covering problems for the regular and context-free languages publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(76)80038-4 – volume: 10 start-page: 19 year: 1980 ident: 10.1016/j.ic.2010.11.013_b0065 article-title: On equations for regular languages, finite automata, and sequential networks publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(80)90069-9 – ident: 10.1016/j.ic.2010.11.013_b0175 – volume: 8 start-page: 189 issue: 2 year: 1979 ident: 10.1016/j.ic.2010.11.013_b0430 article-title: The complexity of computing the permanent publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(79)90044-6 – volume: 26 start-page: 363 year: 1989 ident: 10.1016/j.ic.2010.11.013_b0295 article-title: On counting and approximation publication-title: Acta Inform. doi: 10.1007/BF00276023 – volume: 13 start-page: 323 year: 1981 ident: 10.1016/j.ic.2010.11.013_b0325 article-title: Succinct representation of regular languages by Boolean automata publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(81)80005-9 – volume: 207 start-page: 1096 year: 2009 ident: 10.1016/j.ic.2010.11.013_b0030 article-title: Detecting palindroms, patterns, and borders in regular languages publication-title: Inform. and Comput. doi: 10.1016/j.ic.2008.06.007 – volume: 20 start-page: 1211 year: 1971 ident: 10.1016/j.ic.2010.11.013_b0370 article-title: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata publication-title: IEEE Trans. Comput. doi: 10.1109/T-C.1971.223108 – year: 1987 ident: 10.1016/j.ic.2010.11.013_b0380 article-title: Diversity-based Inference of Finite Automata (Extended Abstract) – volume: 14 start-page: 598 year: 1985 ident: 10.1016/j.ic.2010.11.013_b0400 article-title: On the equivalence and containment problems for unambiguous regular expressions, regular grammars, and finite automata publication-title: SIAM J. Comput. doi: 10.1137/0214044 – volume: 43 start-page: 85 year: 1992 ident: 10.1016/j.ic.2010.11.013_b0050 article-title: Intersection and union of regular languages and state complexity publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(92)90198-5 – volume: 40 start-page: 25 year: 1991 ident: 10.1016/j.ic.2010.11.013_b0275 article-title: A note on the space complexity of some decision problems for finite automata publication-title: Inform. Process. Lett. doi: 10.1016/S0020-0190(05)80006-7 – volume: 6 start-page: 77 year: 1976 ident: 10.1016/j.ic.2010.11.013_b0125 article-title: Hierarchies of complete problems publication-title: Acta Inform. doi: 10.1007/BF00263744 – volume: 59 start-page: 75 year: 1996 ident: 10.1016/j.ic.2010.11.013_b0135 article-title: A lower bound technique for the size of nondeterministic finite automata publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(96)00095-6 – volume: 6 start-page: 221 year: 2001 ident: 10.1016/j.ic.2010.11.013_b0435 article-title: State complexity of regular languages publication-title: J. Autom. Lang. Comb. – volume: 22 start-page: 1117 year: 1993 ident: 10.1016/j.ic.2010.11.013_b0280 article-title: Minimal NFA problems are hard publication-title: SIAM J. Comput. doi: 10.1137/0222067 – year: 1909 ident: 10.1016/j.ic.2010.11.013_b0315 – year: 1977 ident: 10.1016/j.ic.2010.11.013_b0300 – volume: 66 start-page: 163 year: 1985 ident: 10.1016/j.ic.2010.11.013_b0405 article-title: Complexity of some problems from the theory of automata publication-title: Inform. Control doi: 10.1016/S0019-9958(85)80058-9 – volume: 3 start-page: 92 year: 1903 ident: 10.1016/j.ic.2010.11.013_b0310 article-title: Über die Maximalordnung der Permutationen gegebenen Grades publication-title: Archiv der Math. und Phys. – volume: 38 start-page: 150 year: 1989 ident: 10.1016/j.ic.2010.11.013_b0035 article-title: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(89)90037-8 – year: 1974 ident: 10.1016/j.ic.2010.11.013_b0010 – year: 1971 ident: 10.1016/j.ic.2010.11.013_b0200 – volume: 14 start-page: 195 year: 1981 ident: 10.1016/j.ic.2010.11.013_b0425 article-title: Classification of finite monoids: the language approach publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(81)90057-8 – volume: 107 start-page: 3 year: 1993 ident: 10.1016/j.ic.2010.11.013_b0015 article-title: A very hard log-space counting class publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(93)90252-O – volume: 5 start-page: 1 year: 1971 ident: 10.1016/j.ic.2010.11.013_b0095 article-title: Dot-depth of star-free events publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(71)80003-X – year: 1976 ident: 10.1016/j.ic.2010.11.013_b0110 – volume: vol. 210 start-page: 171 year: 1986 ident: 10.1016/j.ic.2010.11.013_b0255 article-title: On sparseness ambiguity and other decision problems for acceptors and transducers – volume: vol. 629 start-page: 346 year: 1992 ident: 10.1016/j.ic.2010.11.013_b0320 article-title: The emptiness problem for intersections of regular languages – volume: 2 start-page: 163 year: 1991 ident: 10.1016/j.ic.2010.11.013_b0270 article-title: The structure and complexity of minimal NFAs over a unary alphabet publication-title: Internat. J. Found. Comput. Sci. doi: 10.1142/S012905419100011X – volume: 88 start-page: 99 year: 1991 ident: 10.1016/j.ic.2010.11.013_b0075 article-title: Finite-automaton aperiodicity is PSPACE-complete publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(91)90075-D – year: 1992 ident: 10.1016/j.ic.2010.11.013_b0250 article-title: Complexity of Closeness Sparseness and Segment Equivalence for Context-free and Regular Languages – volume: 11 start-page: 68 year: 1975 ident: 10.1016/j.ic.2010.11.013_b0285 article-title: Space-bounded reducibility among combinatorial problems publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(75)80050-X – start-page: 125 year: 1972 ident: 10.1016/j.ic.2010.11.013_b0360 article-title: The equivalence problem for regular expressions with squaring requires exponential time – volume: 21 start-page: 114 year: 1981 ident: 10.1016/j.ic.2010.11.013_b0070 article-title: Alternation publication-title: J. ACM doi: 10.1145/322234.322243 – year: 1997 ident: 10.1016/j.ic.2010.11.013_b0210 – volume: 3 start-page: 114 year: 1959 ident: 10.1016/j.ic.2010.11.013_b0375 article-title: Finite automata and their decision problems publication-title: IBM J. Res. Dev. doi: 10.1147/rd.32.0114 – start-page: 1 year: 1973 ident: 10.1016/j.ic.2010.11.013_b0415 article-title: Word problems requiring exponential time – volume: vol. 5457 start-page: 247 year: 2009 ident: 10.1016/j.ic.2010.11.013_b0060 article-title: Decision problems for convex languages – volume: vol. 5257 start-page: 34 year: 2008 ident: 10.1016/j.ic.2010.11.013_b0215 article-title: On the hardness of determining small NFA’s and of proving lower bounds on their sizesm – volume: 17 start-page: 935 year: 1988 ident: 10.1016/j.ic.2010.11.013_b0265 article-title: Nondeterministic space is closed under complementation publication-title: SIAM J. Comput. doi: 10.1137/0217058 – volume: 186 start-page: 140 year: 2003 ident: 10.1016/j.ic.2010.11.013_b0260 article-title: Follow automata publication-title: Inform. and Comput. doi: 10.1016/S0890-5401(03)00090-7 – volume: vol. 2214 start-page: 1 year: 2001 ident: 10.1016/j.ic.2010.11.013_b0025 article-title: FA minimisation heuristics for a class of finite languages – year: 1979 ident: 10.1016/j.ic.2010.11.013_b0130 – volume: 26 start-page: 279 year: 1988 ident: 10.1016/j.ic.2010.11.013_b0420 article-title: The method of forced enumeration for nondeterministic automata publication-title: Acta Inform. doi: 10.1007/BF00299636 – volume: 41 start-page: 274 year: 1990 ident: 10.1016/j.ic.2010.11.013_b0040 article-title: On uniformity within NC1 publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(90)90022-D – volume: 47 start-page: 149 year: 1986 ident: 10.1016/j.ic.2010.11.013_b0085 article-title: Finite automata and unary languages publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(86)90142-8 – volume: 2 start-page: 1 issue: 1 year: 1968 ident: 10.1016/j.ic.2010.11.013_b0155 article-title: A note on undecidable properties of formal languages publication-title: Math. Systems Theory doi: 10.1007/BF01691341 – ident: 10.1016/j.ic.2010.11.013_b0410 – volume: 20 start-page: 563 year: 2009 ident: 10.1016/j.ic.2010.11.013_b0190 article-title: Nondeterministic finite automata – recent results on the descriptional and computational complexity publication-title: Int. J. Found. Comput. Sci. doi: 10.1142/S0129054109006747 – volume: 30 start-page: 1976 year: 2001 ident: 10.1016/j.ic.2010.11.013_b0350 article-title: Optimal simulations between unary automata publication-title: SIAM J. Comput. doi: 10.1137/S009753979935431X – volume: 21 start-page: 195 year: 1980 ident: 10.1016/j.ic.2010.11.013_b0395 article-title: Lower bounds on the size of sweeping automata publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(80)90034-3 – volume: 7 start-page: 99 year: 1978 ident: 10.1016/j.ic.2010.11.013_b0240 article-title: Computational parallels between the regular and context-free languages publication-title: SIAM J. Comput. doi: 10.1137/0207007 – volume: 37 start-page: 302 year: 1978 ident: 10.1016/j.ic.2010.11.013_b0140 article-title: Complexity of automaton identification from given data publication-title: Inform. Control doi: 10.1016/S0019-9958(78)90562-4 – volume: 24 start-page: 1 year: 1983 ident: 10.1016/j.ic.2010.11.013_b0020 article-title: Σ11 formulae on finite structures publication-title: Ann. Pure. Appl. Logic doi: 10.1016/0168-0072(83)90038-6 – volume: 1 year: 1997 ident: 10.1016/j.ic.2010.11.013_b0440 article-title: Regular Languages – volume: 35 start-page: 117 year: 1990 ident: 10.1016/j.ic.2010.11.013_b0115 article-title: Constructions for alternating finite automata publication-title: Int. J. Comput. Math. doi: 10.1080/00207169008803893 – volume: 1 start-page: 330 year: 1991 ident: 10.1016/j.ic.2010.11.013_b0340 article-title: NC1: The automata-theoretical viewpoint publication-title: Comput. Complexity doi: 10.1007/BF01212963 – volume: 97 start-page: 1 year: 1992 ident: 10.1016/j.ic.2010.11.013_b0080 article-title: The parallel complexity of finite-state automata problems publication-title: Inform. and Comput. doi: 10.1016/0890-5401(92)90002-W – volume: 8 start-page: 190 year: 1965 ident: 10.1016/j.ic.2010.11.013_b0390 article-title: On finite monoids having only trivial subgroups publication-title: Inform. Control doi: 10.1016/S0019-9958(65)90108-7 – volume: vol. 629 start-page: 227 year: 1992 ident: 10.1016/j.ic.2010.11.013_b0100 article-title: The parallel complexity of iterated morphisms and the arithmetic of small numbers – year: 1996 ident: 10.1016/j.ic.2010.11.013_b0180 – year: 1994 ident: 10.1016/j.ic.2010.11.013_b0105 article-title: Deterministic 0L Languages are of very Low Complexity: D0L is in AC0 – volume: 17 start-page: 13 year: 1984 ident: 10.1016/j.ic.2010.11.013_b0120 article-title: Parity, circuits, and the polynomial-time hierarchy publication-title: Math. Systems Theory doi: 10.1007/BF01744431 – volume: vol. 4036 start-page: 363 year: 2006 ident: 10.1016/j.ic.2010.11.013_b0160 article-title: Finding lower bounds for nondeterministic state complexity is hard (extended abstract) – volume: 327 start-page: 375 year: 2004 ident: 10.1016/j.ic.2010.11.013_b0335 article-title: Minimizing finite automata is computationally hard publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2004.03.070 – ident: 10.1016/j.ic.2010.11.013_b0220 doi: 10.1145/800125.804030 – start-page: 188 year: 1971 ident: 10.1016/j.ic.2010.11.013_b0355 article-title: Economy of description by automata, grammars, and formal systems – volume: 35 start-page: 941 year: 1988 ident: 10.1016/j.ic.2010.11.013_b0045 article-title: Finite monoids and the fine structure of NC1 publication-title: J. ACM doi: 10.1145/48014.63138 – year: 1979 ident: 10.1016/j.ic.2010.11.013_b0205 – volume: vol. 117 start-page: 265 year: 1981 ident: 10.1016/j.ic.2010.11.013_b0365 article-title: On the LBA problem – volume: 24 start-page: 387 year: 1977 ident: 10.1016/j.ic.2010.11.013_b0235 article-title: On equivalence and contaiment problems for formal languages publication-title: J. ACM doi: 10.1145/322017.322020 – volume: 6 start-page: 453 year: 2001 ident: 10.1016/j.ic.2010.11.013_b0195 article-title: On the state complexity of k-entry deterministic finite automata publication-title: J. Autom. Lang. Comb. – start-page: 10 year: 1973 ident: 10.1016/j.ic.2010.11.013_b0225 article-title: On the time and tape complexity of languages I – volume: 38 start-page: 133 year: 1985 ident: 10.1016/j.ic.2010.11.013_b0330 article-title: Succinct representation of regular languages by Boolean automata. II publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(85)90215-4 – volume: vol. 5126 start-page: 27 year: 2008 ident: 10.1016/j.ic.2010.11.013_b0055 article-title: The tractability frontier for NFA minimization – volume: 7 start-page: 207 year: 1964 ident: 10.1016/j.ic.2010.11.013_b0305 article-title: Classes of languages and linear bounded automata publication-title: Inform. Control doi: 10.1016/S0019-9958(64)90120-2 – volume: vol. 4588 start-page: 205 year: 2007 ident: 10.1016/j.ic.2010.11.013_b0170 article-title: Inapproximability of nondeterministic state and transition complexity assuming P≠NP – volume: vol. 65 year: 1971 ident: 10.1016/j.ic.2010.11.013_b0345 – volume: 302 start-page: 497 year: 2003 ident: 10.1016/j.ic.2010.11.013_b0090 article-title: Errata to “finite automata and unary languages” publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(03)00136-1 – ident: 10.1016/j.ic.2010.11.013_b0165 – volume: 14 start-page: 1087 year: 2003 ident: 10.1016/j.ic.2010.11.013_b0185 article-title: Nondeterministic descriptional complexity of regular languages publication-title: Int. J. Found. Comput. Sci. doi: 10.1142/S0129054103002199 – volume: vol. 3404 start-page: 399 year: 2005 ident: 10.1016/j.ic.2010.11.013_b0150 article-title: Minimizing NFA’s and regular expressions
SSID	ssj0011546
Score	2.352277
Snippet	Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	456
SubjectTerms	Algorithmics. Computability. Computer arithmetics Alternation Applied sciences Computational complexity Computer science; control theory; systems Descriptional complexity Determinism Exact sciences and technology Finite automata Miscellaneous Nondeterminism Survey Theoretical computing
Title	Descriptional and computational complexity of finite automata—A survey
URI	https://dx.doi.org/10.1016/j.ic.2010.11.013
Volume	209
WOSCitedRecordID	wos000287382300014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2651 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011546 issn: 0890-5401 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jb9QwFLag5QBCAkoRZal84IKqQBaPHR8HVDRFqFRoKo24RLZjS1NVmdEkU82RH8Ev5JfwMrYTh0IRB3KwoidnUd6Xt9hvQegVGNECFLGKVB6TCDS0iWSqaQTKSSgi4NBq22yCnZ7msxk_c-UJ6m07AVZV-WbDl_-V1UADZreps__A7u6mQIBzYDqMwHYYrzP-t_rHpRg1PtJYbTs3BFvudhq4nF5kuIIBwcRt2ZC2cvDGxWyYeWudHol1s4BbCx8kQcZH9Xp1pbuV-cnnT19tdEWbBrTu94rOp19O3jm6r_dd9uunWbjc4PNgQjHF4za8IgllahrzADxZICHJiAbKltiuIdfkuF1SuHgzVzb6ri20anNWhyWzf1FlXYAh2CngZybsNtpNM5qD6NsdnxzPPnYbTInL4fIv73awbejf8Kl_sljuL0UN_5GxDVACq2T6EO33-Zr4rEPCI3RLV3vogXMwsBPfNZB8Dw9P20P3goKUj9FkgAkMmMADTOAeE3hhsMUE9pj48e37GFs07KPzD8fT95PI9dqIVMbjBsZMKkZpKThXOeGllCPCRUaZYlKRNNYyI5JLScs8UcZoRsEZBm80MYwlRGRP0E61qPRThHWpczCsBdiuhFBjRMJ0OsrhG4BtKVN6gN7671koV4i-7YdyWfiIw4tiroqWA-CfFsCBA_S6u2Jpi7DcMDfzLCqcEWmNwwKwdcNVhwNudo_xQHr2twnP0d3-d3mBdprVWr9Ed9RVM69Xhw5-PwGwdJtF
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Information+and+computation&rft.atitle=Descriptional+and+computational+complexity+of+finite+automata%E2%80%94A+survey&rft.au=HOLZER%2C+Markus&rft.au=KUTRIB%2C+Martin&rft.date=2011-03-01&rft.pub=Elsevier&rft.issn=0890-5401&rft.volume=209&rft.issue=3&rft.spage=456&rft.epage=470&rft_id=info:doi/10.1016%2Fj.ic.2010.11.013&rft.externalDBID=n%2Fa&rft.externalDocID=24010417
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon