- Author:
- Peter Linz
Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of
Cited By
Xingyan Y, Peifeng H and Zhao L Equivalent State of Finite Automata and Its Judgment Theorem Proceedings of the 2nd International Conference on Algorithms, Computing and Systems, (232-237)- Javaheri Javid M, Alghamdi W, Ursyn A, Zimmer R and Al-Rifaie M (2017). Swarmic approach for symmetry detection of cellular automata behaviour, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 21:19, (5585-5599), Online publication date: 1-Oct-2017.
- Fagin R, Kimelfeld B, Reiss F and Vansummeren S (2015). Document Spanners, Journal of the ACM, 62:2, (1-51), Online publication date: 6-May-2015.
- Fagin R, Kimelfeld B, Reiss F and Vansummeren S Spanners Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, (37-48)
- GüleşIr G, Berg K, Bergmans L and Akşit M (2009). Experimental evaluation of a tool for the verification and transformation of source code in event-driven systems, Empirical Software Engineering, 14:6, (720-777), Online publication date: 1-Dec-2009.
- De Leeuw B and Hoogewijs A (2018). Management and object behavior of statecharts through statechart DNA, WSEAS Transactions on Information Science and Applications, 6:5, (859-871), Online publication date: 1-May-2009.
- De Leeuw B and Hoogewijs A Statechart DNA Proceedings of the 10th WSEAS international conference on Automation & information, (293-299)
- Polycarpou I Induction as a tool for conceptual coherence in computer science Proceedings of the 46th Annual Southeast Regional Conference on XX, (440-445)
- Tran Q (2007). Interactive symbolic software for teaching formal languages, automata and beyond, Journal of Computing Sciences in Colleges, 22:4, (129-136), Online publication date: 1-Apr-2007.
- Tran Q (2006). Interactive computer algebra software for teaching and helping students to study foundations of computer science, Journal of Computing Sciences in Colleges, 22:1, (131-143), Online publication date: 1-Oct-2006.
- Jun W, Lei H, Chunlei N and Haoran Z High performance SOAP processing driven by data mapping template Proceedings of the 6th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems, (152-168)
- Jun W, Lei H and Chunlei N Speed-up SOAP processing by data mapping template Proceedings of the 2006 international workshop on Service-oriented software engineering, (40-46)
- Bedregal B and Figueira S Classical computability and fuzzy turing machines Proceedings of the 7th Latin American conference on Theoretical Informatics, (154-165)
- Rosenberg A State Theoretical Computer Science, (375-398)
- Kim M, Jeong J and Park S (2005). From product lines to self-managed systems, ACM SIGSOFT Software Engineering Notes, 30:4, (1-7), Online publication date: 1-Jul-2005.
- Baeten J (2005). A brief history of process algebra, Theoretical Computer Science, 335:2-3, (131-146), Online publication date: 23-May-2005.
- Kim M, Jeong J and Park S From product lines to self-managed systems Proceedings of the 2005 workshop on Design and evolution of autonomic application software, (1-7)
- Cavalcante R, Finley T and Rodger S A visual and interactive automata theory course with JFLAP 4.0 Proceedings of the 35th SIGCSE technical symposium on Computer science education, (140-144)
- Cavalcante R, Finley T and Rodger S (2004). A visual and interactive automata theory course with JFLAP 4.0, ACM SIGCSE Bulletin, 36:1, (140-144), Online publication date: 1-Mar-2004.
- Beaubouef T (2003). Why computer science students need language, ACM SIGCSE Bulletin, 35:4, (51-54), Online publication date: 1-Dec-2003.
- Beaubouef T (2019). Why computer science students need math, ACM SIGCSE Bulletin, 34:4, (57-59), Online publication date: 1-Dec-2002.
Recommendations
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications VLimited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
Languages as libraries
PLDI '11Programming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...
Languages as libraries
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationProgramming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...