- Author:
- Peter Linz
No abstract available.
Cited By
- Franconi E, Mosca A, Oriol X, Rull G and Teniente E (2019). $$\hbox {OCL}_\textsf {FO}$$OCLFO, Software and Systems Modeling (SoSyM), 18:4, (2655-2678), Online publication date: 1-Aug-2019.
- Nagy B On efficient algorithms for SAT Proceedings of the 13th international conference on Membrane Computing, (295-310)
- Cetinkaya A Regular expression generation through grammatical evolution Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, (2643-2646)
- Donaldson A and Gay S ETCH Proceedings of the 12th international conference on Model Checking Software, (266-271)
- Singh A, Barman S and Shukla K Secure two-party context free language recognition Proceedings of the Second international conference on Distributed Computing and Internet Technology, (117-124)
- Najaf-Abadi H A procedure for obtaining a behavioral description for the control logic of a non-linear pipeline Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (86-91)
- Goldstine J Formal languages Encyclopedia of Computer Science, (716-720)
- Alfonseca E (1998). Writing a compilers compiler in APL, ACM SIGAPL APL Quote Quad, 29:3, (69-75), Online publication date: 1-Mar-1999.
- Alfonseca E Writing a compilers compiler in APL Proceedings of the APL98 conference on Array Processing Languages, (69-75)
- Rodger S (1995). An interactive lecture approach to teaching computer science, ACM SIGCSE Bulletin, 27:1, (278-282), Online publication date: 15-Mar-1995.
- Rodger S An interactive lecture approach to teaching computer science Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (278-282)
- Blythe S, James M and Rodger S LLparse and LRparse Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (208-212)
- Blythe S, James M and Rodger S (1994). LLparse and LRparse, ACM SIGCSE Bulletin, 26:1, (208-212), Online publication date: 12-Mar-1994.
Index Terms
- An introduction to formal languages and automata
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 ...
Deterministic Pushdown Automata and Unary Languages
CIAA '08: Proceedings of the 13th international conference on Implementation and Applications of AutomataThe simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be ...
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07: Proceedings of the 18th international conference on Concurrency TheoryWe investigate various classes of alternating automata for visibly pushdown languages (VPL) over infinite words. First, we show that alternating visibly pushdown automata (AVPA) are exactly as expressive as their nondeterministic counterpart (NVPA) but ...