Switching and finite automata theory:
Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2010
|
| Ausgabe: | Third edition |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 617 pages) |
| ISBN: | 9780511816239 |
| DOI: | 10.1017/CBO9780511816239 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043942958 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2010 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511816239 |c Online |9 978-0-511-81623-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511816239 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511816239 | ||
| 035 | |a (OCoLC)967777517 | ||
| 035 | |a (DE-599)BVBBV043942958 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511.3/5 |2 22 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Kohavi, Zvi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Switching and finite automata theory |c Zvi Kohavi, Niraj K. Jha |
| 246 | 1 | 3 | |a Switching & Finite Automata Theory |
| 250 | |a Third edition | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2010 | |
| 300 | |a 1 online resource (xii, 617 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index | |
| 520 | |a Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions | ||
| 650 | 4 | |a Sequential machine theory | |
| 650 | 4 | |a Switching theory | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Schaltung |0 (DE-588)4052056-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Schaltalgebra |0 (DE-588)4179375-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Schaltung |0 (DE-588)4052056-0 |D s |
| 689 | 0 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Schaltalgebra |0 (DE-588)4179375-4 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Jha, Niraj K. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-85748-2 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511816239 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351928 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511816239 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511816239 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176886415228928 |
|---|---|
| any_adam_object | |
| author | Kohavi, Zvi |
| author_facet | Kohavi, Zvi |
| author_role | aut |
| author_sort | Kohavi, Zvi |
| author_variant | z k zk |
| building | Verbundindex |
| bvnumber | BV043942958 |
| classification_rvk | ST 136 |
| collection | ZDB-20-CBO |
| contents | Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index |
| ctrlnum | (ZDB-20-CBO)CR9780511816239 (OCoLC)967777517 (DE-599)BVBBV043942958 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/CBO9780511816239 |
| edition | Third edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04148nmm a2200625zc 4500</leader><controlfield tag="001">BV043942958</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2010 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511816239</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-81623-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511816239</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511816239</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967777517</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942958</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kohavi, Zvi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Switching and finite automata theory</subfield><subfield code="c">Zvi Kohavi, Niraj K. Jha</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Switching & Finite Automata Theory</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 617 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Switching theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltung</subfield><subfield code="0">(DE-588)4052056-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltalgebra</subfield><subfield code="0">(DE-588)4179375-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Schaltung</subfield><subfield code="0">(DE-588)4052056-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Schaltalgebra</subfield><subfield code="0">(DE-588)4179375-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jha, Niraj K.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-85748-2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511816239</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351928</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511816239</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511816239</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942958 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:18Z |
| institution | BVB |
| isbn | 9780511816239 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351928 |
| oclc_num | 967777517 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xii, 617 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Kohavi, Zvi Verfasser aut Switching and finite automata theory Zvi Kohavi, Niraj K. Jha Switching & Finite Automata Theory Third edition Cambridge Cambridge University Press 2010 1 online resource (xii, 617 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions Sequential machine theory Switching theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Schaltung (DE-588)4052056-0 gnd rswk-swf Schaltalgebra (DE-588)4179375-4 gnd rswk-swf Schaltung (DE-588)4052056-0 s Automatentheorie (DE-588)4003953-5 s 1\p DE-604 Schaltalgebra (DE-588)4179375-4 s 2\p DE-604 Endlicher Automat (DE-588)4224518-7 s 3\p DE-604 Jha, Niraj K. Sonstige oth Erscheint auch als Druckausgabe 978-0-521-85748-2 https://doi.org/10.1017/CBO9780511816239 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kohavi, Zvi Switching and finite automata theory Preface -- Part I. Preliminaries: 1. Number systems and codes -- 2. Sets, relations, and lattices -- Part II. Combinational Logic: 3. Switching algebra and its applications -- 4. Minimization of switching functions -- 5. Logic design -- 6. Multilevel logic synthesis -- 7. Threshold logic for nanotechnologies- -- 8. Testing of combinational circuits -- Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks -- 10. Capabilities, minimization, and transformation of sequential machines -- 11. Asynchronous sequential circuits -- 12. Structure of sequential machines -- 13. State-identification experiments and testing of sequential circuits -- 14. Memory, definiteness, and information losslessness of finite automata -- 15. Linear sequential machines -- 16. Finite-state recognisers -- Index Sequential machine theory Switching theory Automatentheorie (DE-588)4003953-5 gnd Endlicher Automat (DE-588)4224518-7 gnd Schaltung (DE-588)4052056-0 gnd Schaltalgebra (DE-588)4179375-4 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4224518-7 (DE-588)4052056-0 (DE-588)4179375-4 |
| title | Switching and finite automata theory |
| title_alt | Switching & Finite Automata Theory |
| title_auth | Switching and finite automata theory |
| title_exact_search | Switching and finite automata theory |
| title_full | Switching and finite automata theory Zvi Kohavi, Niraj K. Jha |
| title_fullStr | Switching and finite automata theory Zvi Kohavi, Niraj K. Jha |
| title_full_unstemmed | Switching and finite automata theory Zvi Kohavi, Niraj K. Jha |
| title_short | Switching and finite automata theory |
| title_sort | switching and finite automata theory |
| topic | Sequential machine theory Switching theory Automatentheorie (DE-588)4003953-5 gnd Endlicher Automat (DE-588)4224518-7 gnd Schaltung (DE-588)4052056-0 gnd Schaltalgebra (DE-588)4179375-4 gnd |
| topic_facet | Sequential machine theory Switching theory Automatentheorie Endlicher Automat Schaltung Schaltalgebra |
| url | https://doi.org/10.1017/CBO9780511816239 |
| work_keys_str_mv | AT kohavizvi switchingandfiniteautomatatheory AT jhanirajk switchingandfiniteautomatatheory AT kohavizvi switchingfiniteautomatatheory AT jhanirajk switchingfiniteautomatatheory |