Filters








46,553 Hits in 2.2 sec

Automata and Formal Languages [chapter]

2014 Computing  
and Formal Languages Peter Wood Motivation and Background Automata Grammars Regular Expressions Example of Research Conclusion Other approaches Automata and Formal Languages  ...  power Automata and Formal Languages Peter Wood Motivation and Background Automata Grammars Regular Expressions Example of Research Conclusion Examples of Language Hierarchy varying  ... 
doi:10.1201/b17011-24 fatcat:lady5wjc4vebrhfge4co3pwhpm

A Bialgebraic Approach to Automata and Formal Language Theory [article]

James Worthington
2009 arXiv   pre-print
For example, formal languages correspond to elements of dual algebras of coalgebras, automata are "pointed representation objects" of algebras, automaton morphisms are instances of linear intertwiners,  ...  We also show how to associate an automaton with an arbitrary algebra, which in the classical case yields the automaton whose states are formal languages and whose transitions are given by language differentiation  ...  Introduction Automata and formal languages are fundamental objects of study in theoretical computer science.  ... 
arXiv:0807.4553v4 fatcat:tmkt6hbznzeblf2im25gvuf3za

Preface [chapter]

2022 Automata Theory and Formal Languages  
Automata theory and formal languages are the cornerstone of computer science and all information processing pursuits.  ...  These fundamentals are at the center of any computer science, computer engineering and information technologies curriculum. Writing a textbook in this area is a challenging endeavor.  ...  We hope that the textbook will appeal to a broad audience of undergraduate and graduate students and all of those interested in the systematic and concise exposure to the fundamentals of automata and formal  ... 
doi:10.1515/9783110752304-202 fatcat:hhmfiy4afnbmnja2vlok67glpi

Languages, Automata, and Logic [chapter]

Wolfgang Thomas
1997 Handbook of Formal Languages  
Central points are the connection between nite automata and monadic second-order logic, the Ehrenfeucht-Fra ss e technique in the context of formal language theory, nite automata on !  ...  A modi ed version of the paper will be a chapter of the \Handbook of Formal Language Theory", edited by G. Rozenberg and A. Salomaa, to appear in Springer-Verlag.  ...  Finally, I thank the members of the theory group in Kiel for e cient help and support, and G. Rozenberg for his encouragement to write and nish this paper.  ... 
doi:10.1007/978-3-642-59126-6_7 fatcat:3ak2gtvtvnbbffvgeniim7f3mi

Constructively Formalizing Automata Theory [chapter]

2000 Proof, Language, and Interaction  
We present a constructive formalization of the Myhill-Nerode theorem on the minimization of nite automata that follows the account in Hopcroft and Ullman's book Formal Languages and Their Relation to Automata  ...  Nuprl borrows an implementation of the ML language from the LCF system of Milner, Gordon, and Wadsworth, and makes heavy use of the notion of tactic pioneered by Milner in LCF.  ...  Recently, we have been considering whether we could formalize a whole book on automata theory such as Hopcroft and Ullman's Formal Languages and their Relation to Automata 15] .  ... 
doi:10.7551/mitpress/5641.003.0014 fatcat:5ch7hcsi4fgfjitwr5fowttwsu

A prolog toolkit for formal languages and automata

Michel Wermelinger, Artur Miguel Dias
2005 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education - ITiCSE '05  
This paper describes the first version of P (read "P flat"), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms taught in Formal Languages and  ...  In both cases the goal is to make students more confident in defining and manipulating the various kinds of languages and automata at a level beyond the one provided by visual simulators of automata.  ...  INTRODUCTION Formal languages and automata theory (FLAT) lies at the very core of Computer Science.  ... 
doi:10.1145/1067445.1067536 dblp:conf/iticse/WermelingerD05 fatcat:dgebml5rcranphnbe3p4hkiltq

A prolog toolkit for formal languages and automata

Michel Wermelinger, Artur Miguel Dias
2005 ACM SIGCSE Bulletin  
This paper describes the first version of P (read "P flat"), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms taught in Formal Languages and  ...  In both cases the goal is to make students more confident in defining and manipulating the various kinds of languages and automata at a level beyond the one provided by visual simulators of automata.  ...  INTRODUCTION Formal languages and automata theory (FLAT) lies at the very core of Computer Science.  ... 
doi:10.1145/1151954.1067536 fatcat:iyu4jukkanbr5jhx3xfctxedei

Context-Free Languages and Pushdown Automata [chapter]

Jean-Michel Autebert, Jean Berstel, Luc Boasson
1997 Handbook of Formal Languages  
Introduction This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize grammatical properties of natural languages 9] .  ...  A simple formal proof will be given below.  ... 
doi:10.1007/978-3-642-59136-5_3 fatcat:5ikmp6unurdwbl773xucv4v3ni

A Bialgebraic Approach to Automata and Formal Language Theory [chapter]

James Worthington
2008 Lecture Notes in Computer Science  
We then treat automata as certain representation objects of algebras and formal languages as elements of dual algebras of coalgebras.  ...  Finally, we show that there is an adjunction between the category of "algebraic" automata and the category of deterministic automata.  ...  Introduction Automata and formal languages are fundamental objects of study in theoretical computer science.  ... 
doi:10.1007/978-3-540-92687-0_31 fatcat:lapdyiao2bdkdiy4ebmj6p2y2i

A bialgebraic approach to automata and formal language theory

James Worthington
2012 Annals of Pure and Applied Logic  
We then treat automata as certain representation objects of algebras and formal languages as elements of dual algebras of coalgebras.  ...  Finally, we show that there is an adjunction between the category of "algebraic" automata and the category of deterministic automata.  ...  Acknowledgements The author would like to thank Anil Nerode for many inspiring discussions and the anonymous reviewers of LFCS'09 for their helpful comments and suggestions.  ... 
doi:10.1016/j.apal.2011.09.019 fatcat:tc36r5rksffqhkiifosaeaa2o4

Symbolic Dynamics and Finite Automata [chapter]

Marie-Pierre Béal, Dominique Perrin
1997 Handbook of Formal Languages  
doi:10.1007/978-3-662-07675-0_10 fatcat:dg2p7phrqbgxhglhlhxab6uscu

L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory [article]

Paulo Moura, Artur Miguel Dias
2011 arXiv   pre-print
We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory.  ...  Supported mechanisms include predicates, regular expressions, finite automata, context-free grammars, Turing machines, and push-down automata.  ...  Our goal is to ensure a stable foundation for future development and to provide teachers and students with a reliable and friendly tool for teaching and learning Formal Languages and Automata Theory.  ... 
arXiv:1112.3783v1 fatcat:weafasipire2vmqdcbuibj2xzm

Semigroups and Automata on Infinite Words [chapter]

Dominique Perrin, Jean-Eric Pin
1995 Semigroups, Formal Languages and Groups  
Acknowledgements The authors would like to thank Olivier Carton and Pascal Weil for their comments on a preliminary version of this article.  ...  Büchi automata are defined in section 4, deterministic Büchi automata in section 5 and Muller automata in section 6.  ...  sets of the form − → L where L is a star-free language.  ... 
doi:10.1007/978-94-011-0149-3_3 fatcat:baawnkgzrbdenmohs5wv3mgr6y

Using theoretical computer simulators for formal languages and automata theory

Carlos I. Chesñevar, María L. Cobo, William Yurcik
2003 ACM SIGCSE Bulletin  
Both formal languages and automata theory (FLAT) are core to the CS curricula but are difficult to teach and to learn.  ...  Based on our practical experience, the tradeoffs between different FLAT software tools is analyzed and discussed.  ...  Introduction Many students find it difficult to grasp the concepts within formal languages and automata theory because the abstract formal notation overwhelms them.  ... 
doi:10.1145/782941.782975 fatcat:jgl47n7ykrbkdcescfu2fybv2e

VisA: A Tool for Visualizing and Animating Automata and Formal Languages [chapter]

Markus Holzer, Muriel Quenzer
1998 Lecture Notes in Computer Science  
in proofs) provide an easy and flexible access to automata theory and formal languages [2] .  ...  Due to the wide range of the material of a complete undergraduate course in automata theory and formal languages, we have restricted the first implementation phase to finite automata only.  ...  Since we are interested in step-bystep simulations of algorithms as well as interactive manipulations of the input objects (the automata) we need algorithms for incremental graph drawing.  ... 
doi:10.1007/3-540-37623-2_41 fatcat:4y7se4zevfcxvaivueilo4d5by
« Previous Showing results 1 — 15 out of 46,553 results