Skip header Section
Skip Bibliometrics Section
Formal languages and their relation to automataJanuary 1969
- Authors:
- John E. Hopcroft,
- Jeffrey D. Ullman
Abstract
No abstract available.
Cited By
- Xie J and Hunt H (2023). On the undecidability and descriptional complexity of synchronized regular expressions, Acta Informatica, 60:3, (257-278), Online publication date: 1-Sep-2023.
- Stanford C and Veanes M Incremental Dead State Detection in Logarithmic Time Computer Aided Verification, (241-264)
- Brotherston J, Brunet P, Gorogiannis N and Kanovich M A compositional deadlock detector for Android Java Proceedings of the 36th IEEE/ACM International Conference on Automated Software Engineering, (955-966)
- Lye A Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete Language and Automata Theory and Applications, (97-108)
- Mahalingam K, Pandoh P and Maity A Theta Palindromes in Theta Conjugates Theory and Practice of Natural Computing, (145-156)
- Yu D, Xu Z, Pedrycz W and Wang W (2017). Information sciences 19682016, Information Sciences: an International Journal, 418:C, (619-634), Online publication date: 1-Dec-2017.
Fang Y, Zou C, Elmore A and Chien A UDP Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture, (55-68)- Zaytsev V Language design with intent Proceedings of the ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems, (45-52)
- Pra D and Reinhardt K (2017). Undecidability of the emptiness problem for context-free picture languages, Theoretical Computer Science, 679:C, (118-125), Online publication date: 30-May-2017.
- D'Antoni L and Veanes M Forward Bisimulations for Nondeterministic Symbolic Finite Automata Proceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10205, (518-534)
- Gogte V, Kolli A, Cafarella M, D'Antoni L and Wenisch T HARE The 49th Annual IEEE/ACM International Symposium on Microarchitecture, (1-12)
- Ramos M, Queiroz R, Moreira N and Almeida J On the Formalization of Some Results of Context-Free Language Theory Proceedings of the 23rd International Workshop on Logic, Language, Information, and Computation - Volume 9803, (338-357)
- Rodriguez A and Granger R (2016). The grammar of mammalian brain capacity, Theoretical Computer Science, 633:C, (100-111), Online publication date: 20-Jun-2016.
- Fang Y, Hoang T, Becchi M and Chien A Fast support for unstructured data processing Proceedings of the 48th International Symposium on Microarchitecture, (533-545)
- Tang J, Luo M and Tang J (2014). Results on the use of category theory for the study of lattice-valued finite state machines, Information Sciences: an International Journal, 288:C, (279-289), Online publication date: 20-Dec-2014.
- Kyusakov R, Pereira P, Eliasson J and Delsing J (2014). EXIP, ACM Transactions on the Web, 8:4, (1-29), Online publication date: 6-Nov-2014.
- Mennicke S, Lochau M, Schroeter J and Winkelmann T Automated verification of feature model configuration processes based on workflow Petri nets Proceedings of the 18th International Software Product Line Conference - Volume 1, (62-71)
- Mytkowicz T, Musuvathi M and Schulte W (2014). Data-parallel finite-state machines, ACM SIGARCH Computer Architecture News, 42:1, (529-542), Online publication date: 5-Apr-2014.
- Mytkowicz T, Musuvathi M and Schulte W (2014). Data-parallel finite-state machines, ACM SIGPLAN Notices, 49:4, (529-542), Online publication date: 5-Apr-2014.
- Mytkowicz T, Musuvathi M and Schulte W Data-parallel finite-state machines Proceedings of the 19th international conference on Architectural support for programming languages and operating systems, (529-542)
- Mendivelso J, Pinzón Y and Lee I Finding overlaps within regular expressions with variable-length gaps Proceedings of the 2013 Research in Adaptive and Convergent Systems, (16-21)
- Reghizzi S and San Pietro P Deterministic counter machines and parallel matching computations Proceedings of the 18th international conference on Implementation and Application of Automata, (280-291)
- Kelemen J Turing's three pioneering initiatives and their interplays Proceedings of the 13th international conference on Membrane Computing, (36-46)
- Průša D and Mráz F Two-dimensional sgraffito automata Proceedings of the 16th international conference on Developments in Language Theory, (251-262)
- Winter J, Bonsangue M and Rutten J Context-free languages, coalgebraically Proceedings of the 4th international conference on Algebra and coalgebra in computer science, (359-376)
- Wu C, Zhang X and Urban C A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl) Proceedings of the Second international conference on Interactive theorem proving, (341-356)
- Taşdemir N and Say A Models of pushdown automata with reset Proceedings of the 15th international conference on Developments in language theory, (417-428)
- Černo P and Mráz F Δ-clearing restarting automata and CFL Proceedings of the 15th international conference on Developments in language theory, (153-164)
- Androutsopoulos K, Binkley D, Clark D, Gold N, Harman M, Lano K and Li Z Model projection Proceedings of the 33rd International Conference on Software Engineering, (291-300)
- Csuhaj-Varjú E, Masopust T and Vaszil G (2011). Blackhole Pushdown Automata, Fundamenta Informaticae, 112:2-3, (137-156), Online publication date: 1-Apr-2011.
- Giegerich R and Hoener zu Siederdissen C (2011). Semantics and Ambiguity of Stochastic RNA Family Models, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8:2, (499-516), Online publication date: 1-Mar-2011.
- Magniez F, Mathieu C and Nayak A Recognizing well-parenthesized expressions in the streaming model Proceedings of the forty-second ACM symposium on Theory of computing, (261-270)
- Masopust T (2010). Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case, Fundamenta Informaticae, 104:1-2, (111-124), Online publication date: 1-Jan-2010.
- Armoni M and Ben-Ari M (2009). The concept of nondeterminism, ACM SIGCSE Bulletin, 41:2, (141-160), Online publication date: 25-Jun-2009.
- Masopust T and Medunac A (2009). On pure multi-pushdown automata that perform complete pushdown pops, Acta Cybernetica, 19:2, (537-552), Online publication date: 1-Feb-2009.
- Unold O (2008). Grammar-based classifier system, WSEAS Transactions on Computers, 7:10, (1584-1593), Online publication date: 1-Oct-2008.
- Lange S, Zeugmann T and Zilles S (2008). Learning indexed families of recursive languages from positive data, Theoretical Computer Science, 397:1-3, (194-232), Online publication date: 10-May-2008.
- Goldin D and Wegner P (2008). The Interactive Nature of Computing, Minds and Machines, 18:1, (17-38), Online publication date: 1-Mar-2008.
- Thomas W Church's problem and a tour through automata theory Pillars of computer science, (635-655)
- Han Y, Wang Y and Wood D (2007). Prefix-free regular languages and pattern matching, Theoretical Computer Science, 389:1-2, (307-317), Online publication date: 10-Dec-2007.
- Curilem S, Barbosa A and de Azevedo F (2007). Intelligent tutoring systems, Computers & Education, 49:3, (545-561), Online publication date: 1-Nov-2007.
- Recalde L, Haddad S and Silva M Continuous Petri nets Proceedings of the 5th international conference on Automated technology for verification and analysis, (362-377)
- Recalde L, Haddad S and Silva M Continuous Petri Nets: Expressive Power and Decidability Issues Automated Technology for Verification and Analysis, (362-377)
- Finkel O and Lecomte D There exist some ω-powers of any Borel rank Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (115-129)
- Valtolina S, Mussio P, Bagnasco G, Mazzoleni P, Franzoni S, Geroli M and Ridi C Media for knowledge creation and dissemination Proceedings of the 6th ACM SIGCHI conference on Creativity & cognition, (107-116)
- Berstel J and Perrin D (2007). The origins of combinatorics on words, European Journal of Combinatorics, 28:3, (996-1022), Online publication date: 1-Apr-2007.
- Van Hung K and Van D Prime decomposition problem for several kinds of regular codes Proceedings of the Third international conference on Theoretical Aspects of Computing, (213-227)
- Muchnick S (2006). The Vectorized Grzegorczyk Hierarchy, Mathematical Logic Quarterly, 22:1, (441-480), Online publication date: 13-Nov-2006.
- Haddad S, Recalde L and Silva M On the computational power of timed differentiable petri nets Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems, (230-244)
- Cenzer D and Uddin Z Logspace complexity of functions and structures Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers, (75-84)
- Gruber H and Holzer M Finding lower bounds for nondeterministic state complexity is hard Proceedings of the 10th international conference on Developments in Language Theory, (363-374)
- Bertoni A, Choffrut C and Palano B Context-Free grammars and XML languages Proceedings of the 10th international conference on Developments in Language Theory, (108-119)
- Johnson T and Eigenmann R Context-sensitive domain-independent algorithm composition and selection Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, (181-192)
- Johnson T and Eigenmann R (2006). Context-sensitive domain-independent algorithm composition and selection, ACM SIGPLAN Notices, 41:6, (181-192), Online publication date: 11-Jun-2006.
- Zeugmann T Inductive inference and language learning Proceedings of the Third international conference on Theory and Applications of Models of Computation, (464-473)
- Bárány V, Löding C and Serre O Regularity problems for visibly pushdown languages Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (420-431)
- Kelemen J May embodiment cause hyper-computation? Proceedings of the 8th European conference on Advances in Artificial Life, (31-36)
- Galassi U and Giordana A Learning regular expressions from noisy sequences Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation, (92-106)
- Han Y, Wang Y and Wood D Prefix-Free regular-expression matching Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (298-309)
- Knoblauch A, Markert H and Palm G An associative cortical model of language understanding and action planning Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II, (405-414)
- Goldin D and Wegner P The church-turing thesis Proceedings of the First international conference on Computability in Europe: new Computational Paradigms, (152-168)
- Bousquet-Mélou M Algebraic generating functions in enumerative combinatorics and context-free languages Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (18-35)
- Markert H, Knoblauch A and Palm G Detecting sequences and understanding language with neural associative memories and cell assemblies Biomimetic Neural Learning for Intelligent Robots, (107-117)
- Snoeck M, Lemahieu W, Goethals F, Dedene G and Vandenbulcke J (2004). Events as atomic contracts for component integration, Data & Knowledge Engineering, 51:1, (81-107), Online publication date: 1-Oct-2004.
- Berstel J and Carton O On the complexity of hopcroft’s state minimization algorithm Proceedings of the 9th international conference on Implementation and Application of Automata, (35-44)
- Michaelson G, Hammond K and Serot J FSM-Hume Proceedings of the 2004 ACM symposium on Applied computing, (1455-1461)
- Jackson P, Al-Kofahi K, Tyrrell A and Vachher A (2003). Information extraction from case law and retrieval of prior cases, Artificial Intelligence, 150:1-2, (239-290), Online publication date: 1-Nov-2003.
- Hemaspaandra L, Mukherji P and Tantau T Computation with absolutely no space overhead Proceedings of the 7th international conference on Developments in language theory, (325-336)
- Johnson H and Martin J Unsupervised learning of morphology for English and Inuktitut Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume of the Proceedings of HLT-NAACL 2003--short papers - Volume 2, (43-45)
- Lange S and Grieser G (2003). Variants of iterative learning, Theoretical Computer Science, 292:2, (359-376), Online publication date: 27-Jan-2003.
- Finkel O (2003). Borel hierarchy and omega context free languages, Theoretical Computer Science, 290:3, (1385-1405), Online publication date: 3-Jan-2003.
- Silva P (2002). The homomorphism problem for the free monoid, Discrete Mathematics, 259:1-3, (189-200), Online publication date: 28-Dec-2002.
- Kopeček I and Novotný M (2002). On Equations Including Strings, Fundamenta Informaticae, 51:4, (391-398), Online publication date: 1-Dec-2002.
- Chen Y, Che D and Aberer K On the efficient evaluation of relaxed queries in biological databases Proceedings of the eleventh international conference on Information and knowledge management, (227-236)
- Silva P and Steinberg B (2002). Extensions and submonoids of automatic monoids, Theoretical Computer Science, 289:1, (727-754), Online publication date: 23-Oct-2002.
- Blondel V, Cassaigne J and Nichitiu C (2002). On the presence of periodic configurations in Turing machines and in counter machines, Theoretical Computer Science, 289:1, (573-590), Online publication date: 23-Oct-2002.
- Lange S and Grieser G (2002). On the power of incremental learning, Theoretical Computer Science, 288:2, (277-307), Online publication date: 16-Oct-2002.
- Ricci G (2002). Some analytic features of algebraic data, Discrete Applied Mathematics, 122:1-3, (235-249), Online publication date: 15-Oct-2002.
- Pucella R and Weissman V A Logic for Reasoning about Digital Rights Proceedings of the 15th IEEE workshop on Computer Security Foundations
- Gamarnik D (2002). On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems, Mathematics of Operations Research, 27:2, (272-293), Online publication date: 1-May-2002.
- Trentini A (2002). A Java-based framework to support computer-assisted creation of structured XML documents, ACM SIGAPP Applied Computing Review, 10:1, (48-53), Online publication date: 1-Apr-2002.
- Kopeček I and Novotný M (2002). On Equations Including Strings, Fundamenta Informaticae, 51:4, (391-398), Online publication date: 30-Mar-2002.
- Ostravský J (2001). Prelanguages Versus Submonoids, Fundamenta Informaticae, 46:4, (343-348), Online publication date: 1-Dec-2001.
- Ostravský J (2001). Prelanguages Versus Submonoids, Fundamenta Informaticae, 46:4, (343-348), Online publication date: 15-Aug-2001.
- Rossmanith P and Zeugmann T (2001). Stochastic Finite Learning of the Pattern Languages, Machine Language, 44:1-2, (67-91), Online publication date: 1-Jul-2001.
- Erlebach T, Rossmanith P, Stadtherr H, Steger A and Zeugmann T (2001). Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Theoretical Computer Science, 261:1, (119-156), Online publication date: 20-Jun-2001.
- Gamarnik D (2001). On deciding stability of constrained random walks and queueing systems, ACM SIGMETRICS Performance Evaluation Review, 28:4, (39-40), Online publication date: 1-Mar-2001.
- Uchihira N, Kawata H and Tamura F (2000). Scenario-Based Hypersequential Programming, International Journal of Parallel Programming, 28:2, (155-157), Online publication date: 1-Apr-2000.
- Gamarnik D On deciding stability of scheduling policies in queueing systems Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (467-476)
- Ostravský J (1998). Pregrammars Versus Submonoids, Fundamenta Informaticae, 36:4, (337-343), Online publication date: 1-Dec-1998.
- Jackson P, Al-Kofahi K, Kreilick C and Grom B Information extraction from case law and retrieval of prior cases by partial parsing and query generation Proceedings of the seventh international conference on Information and knowledge management, (60-67)
- Novotný M (1998). Reduction of Pregrammars, Fundamenta Informaticae, 33:3, (295-307), Online publication date: 1-Aug-1998.
- Naumovich G, Clarke L and Osterweil L (1998). Efficient composite data flow analysis applied to concurrent programs, ACM SIGPLAN Notices, 33:7, (51-58), Online publication date: 1-Jul-1998.
- Naumovich G, Clarke L and Osterweil L Efficient composite data flow analysis applied to concurrent programs Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, (51-58)
- Snoeck M and Dedene G (1998). Existence Dependency, IEEE Transactions on Software Engineering, 24:4, (233-251), Online publication date: 1-Apr-1998.
- Birkendorf A, Böker A and Simon H Learning deterministic finite automata from smallest counterexamples Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (599-608)
- Pirolli P Computational models of information scent-following in a very large browsable text collection Proceedings of the ACM SIGCHI Conference on Human factors in computing systems, (3-10)
- Ferrandi F, Fummi F, Macii E, Poncino M and Sciuto D Symbolic optimization of FSM networks based on sequential ATPG techniques Proceedings of the 33rd annual Design Automation Conference, (467-470)
- Turner D SNACC Proceedings of the 1996 ACM symposium on Applied Computing, (401-407)
- Chiang T, Su K and Lin Y (1995). Robust learning, smoothing, and parameter tying on syntactic ambiguity resolution, Computational Linguistics, 21:3, (321-349), Online publication date: 1-Sep-1995.
- Frasconi P, Gori M, Maggini M and Soda G (1995). Unified Integration of Explicit Knowledge and Learning by Example in Recurrent Networks, IEEE Transactions on Knowledge and Data Engineering, 7:2, (340-346), Online publication date: 1-Apr-1995.
- Nestor J and Lee E Prerequisite confidentiality Proceedings of the 2nd ACM Conference on Computer and communications security, (282-293)
- Cabasino S, Paolucci P and Todesco G (1992). Dynamic parsers and evolving grammars, ACM SIGPLAN Notices, 27:11, (39-48), Online publication date: 1-Nov-1992.
- Ginsburg S and Wang X Pattern matching by Rs-operations Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (293-300)
- Wang Y and Pavlidis T (1990). Optimal Correspondence of String Subsequences, IEEE Transactions on Pattern Analysis and Machine Intelligence, 12:11, (1080-1087), Online publication date: 1-Nov-1990.
- Shiroshita T (1990). A data processing performance model for the OSI application layer protocols, ACM SIGCOMM Computer Communication Review, 20:4, (60-68), Online publication date: 1-Aug-1990.
- Shiroshita T A data processing performance model for the OSI application layer protocols Proceedings of the ACM symposium on Communications architectures & protocols, (60-68)
- Haas A (1989). A parsing algorithm for unification grammar, Computational Linguistics, 15:4, (219-232), Online publication date: 1-Dec-1989.
- Fraser P and Lamb D (1989). An annotated bibliography on user interface design, ACM SIGCHI Bulletin, 21:1, (17-28), Online publication date: 1-Aug-1989.
- Geffert V (1988). A representation of recursively enumerable languages by two homomorphisms and a quotient, Theoretical Computer Science, 62:3, (235-249), Online publication date: 12-Dec-1988.
- Chua Y and Winton C (1988). Undergraduate theory of computation: an approach using simulation tools, ACM SIGCSE Bulletin, 20:1, (78-82), Online publication date: 1-Feb-1988.
- Chua Y and Winton C Undergraduate theory of computation: an approach using simulation tools Proceedings of the nineteenth SIGCSE technical symposium on Computer science education, (78-82)
- Chua Y and Winton C (1987). Teaching theory of computation at the junior level, ACM SIGAPL APL Quote Quad, 17:4, (69-78), Online publication date: 1-May-1987.
- Chua Y and Winton C Teaching theory of computation at the junior level Proceedings of the international conference on APL: APL in transition, (69-78)
- Okumura K A formal protocol conversion method Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols, (30-37)
- Chytil M and Karlgren H Categorial grammars for strata of non-CF languages and their parsers Proceedings of the 11th coference on Computational linguistics, (208-210)
- Chaudhuri R and Rao A (1986). Approximating grammar probabilities, Journal of the ACM, 33:4, (702-705), Online publication date: 10-Aug-1986.
- Okumura K (1986). A formal protocol conversion method, ACM SIGCOMM Computer Communication Review, 16:3, (30-37), Online publication date: 1-Aug-1986.
- Baccelli F and Mussi P (1986). An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation, IEEE Transactions on Computers, 35:3, (245-256), Online publication date: 1-Mar-1986.
- Stearns R and Hunt III H (1985). On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata, SIAM Journal on Computing, 14:3, (598-611), Online publication date: 1-Aug-1985.
- Kung C (1985). On verification of database temporal constraints, ACM SIGMOD Record, 14:4, (169-179), Online publication date: 1-May-1985.
- Kung C On verification of database temporal constraints Proceedings of the 1985 ACM SIGMOD international conference on Management of data, (169-179)
- Myers D The random access hierarchy Proceedings of the fifteenth annual ACM symposium on Theory of computing, (355-364)
- Chaudhuri R, Son Pham and Garcia O (1983). Solution of an Open Problem on Probabilistic Grammars, IEEE Transactions on Computers, 32:8, (748-750), Online publication date: 1-Aug-1983.
- Ibarra O and Moran S (1983). Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’s, SIAM Journal on Computing, 12:2, (388-394), Online publication date: 1-May-1983.
- Choffrut C and Culik II K (1983). Properties of Finite and Pushdown Transducers, SIAM Journal on Computing, 12:2, (300-315), Online publication date: 1-May-1983.
- Iwama K (1983). The universe problem for unrestricted flow languages, Acta Informatica, 19:1, (85-96), Online publication date: 1-Apr-1983.
- Olsen D (1983). A subset algorithm for deterministic FSMs within determinisitic PDAs, ACM SIGPLAN Notices, 18:1, (29-34), Online publication date: 1-Jan-1983.
- Balzer R, Goldman N and Wile D (1982). Operational specification as the basis for rapid prototyping, ACM SIGSOFT Software Engineering Notes, 7:5, (3-16), Online publication date: 1-Dec-1982.
- Mandrioli D (1982). On teaching theoretical foundations of Computer Science, ACM SIGACT News, 14:4, (58-69), Online publication date: 1-Sep-1982.
- Hong J (1982). On Some Deterministic Space Complexity Problems, SIAM Journal on Computing, 11:3, (591-601), Online publication date: 1-Aug-1982.
- Demers A, Keleman C and Reusch B (1982). On some decidable properties of finite state translations, Acta Informatica, 17:3, (349-364), Online publication date: 1-Aug-1982.
- Lu D (1982). Watchdog Processors and Structural Integrity Checking, IEEE Transactions on Computers, 31:7, (681-685), Online publication date: 1-Jul-1982.
- Blattner M and Ginsburg S (1982). Position-restricted grammar forms and grammars, Theoretical Computer Science, 17:1, (1-27), Online publication date: 1-Jun-1982.
- Inoue K, Takanami I and Taniguchi H Two-dimensional alternating Turing machines Proceedings of the fourteenth annual ACM symposium on Theory of computing, (37-46)
- Dûriš P and Galil Z Two tapes are better than one for nondeterministic machines Proceedings of the fourteenth annual ACM symposium on Theory of computing, (1-7)
- Balzer R, Goldman N and Wile D Operational specification as the basis for rapid prototyping Proceedings of the workshop on Rapid prototyping, (3-16)
- Gischer J (1981). Shuffle languages, Petri nets, and context-sensitive grammars, Communications of the ACM, 24:9, (597-605), Online publication date: 1-Sep-1981.
- Colbourn C and Colbourn M (1981). Deciding Hadamard equivalence of Hadamard matrices, BIT, 21:3, (374-376), Online publication date: 1-Sep-1981.
- Lipton R and Sedgewick R Lower bounds for VLSI Proceedings of the thirteenth annual ACM symposium on Theory of computing, (300-307)
- Dûriš P and Galil Z Fooling a two-way automaton or one pushdown store is better than one counter for two way machines (Preliminary Version) Proceedings of the thirteenth annual ACM symposium on Theory of computing, (177-188)
- Chan T Reversal complexity of counter machines Proceedings of the thirteenth annual ACM symposium on Theory of computing, (146-157)
- Wang P (1981). Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages, IEEE Transactions on Computers, 30:5, (366-370), Online publication date: 1-May-1981.
- Snyder L (1981). Formal Models of Capability-Based Protection Systems, IEEE Transactions on Computers, 30:3, (172-181), Online publication date: 1-Mar-1981.
- Crespi-Reghizzi S, Guida G and Mandrioli D (1981). Operator Precedence Grammars and the Noncounting Property, SIAM Journal on Computing, 10:1, (174-191), Online publication date: 1-Feb-1981.
- Liu K (1981). On String Pattern Matching, SIAM Journal on Computing, 10:1, (118-140), Online publication date: 1-Feb-1981.
- Greibach S (1981). Comments on the roots of theorems and languages both easy and hard, ACM SIGACT News, 13:1, (26-29), Online publication date: 1-Jan-1981.
- Book R and Brandenburg F (1980). Equality Sets and Complexity Classes, SIAM Journal on Computing, 9:4, (729-743), Online publication date: 1-Nov-1980.
- Howell J, Smith T and Waterman M (1980). Computation of Generating Functions for Biological Molecules, SIAM Journal on Applied Mathematics, 39:1, (119-133), Online publication date: 1-Aug-1980.
- Hunt III H, Constable R and Sahni S (1980). On the Computational Complexity of Program Scheme Equivalence, SIAM Journal on Computing, 9:2, (396-416), Online publication date: 1-May-1980.
- Gurari E and Ibarra O (1980). Path Systems, SIAM Journal on Computing, 9:2, (348-374), Online publication date: 1-May-1980.
- Jia-wei H On some deterministic space complexity problems Proceedings of the twelfth annual ACM symposium on Theory of computing, (310-317)
- Cohen N (1980). Gödel numbers, ACM SIGPLAN Notices, 15:4, (70-74), Online publication date: 1-Apr-1980.
- Liang Y A parsing method on l-1 bounded context parsing Proceedings of the 18th annual Southeast regional conference, (88-97)
- Budd T, DeMillo R, Lipton R and Sayward F Theoretical and empirical studies on using program mutation to test the functional correctness of programs Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (220-233)
- Leeuwen J (1979). A useful lemma for context-free programmed grammars, Acta Informatica, 11:4, (373-386), Online publication date: 1-Dec-1979.
- Kasai T, Adachi A and Iwata S (1979). Classes of Pebble Games and Complete Problems, SIAM Journal on Computing, 8:4, (574-586), Online publication date: 1-Nov-1979.
- Bauer J and Finger A Test plan generation using formal grammars Proceedings of the 4th international conference on Software engineering, (425-432)
- Pflasterer D (1979). Application of a remote code generator, ACM SIGPLAN Notices, 14:9, (50-58), Online publication date: 1-Sep-1979.
- Alt H (1979). Lower bounds on space complexity for contextfree recognition, Acta Informatica, 12:1, (33-61), Online publication date: 1-Jun-1979.
- Stockmeyer L and Chandra A (1979). Provably Difficult Combinatorial Games, SIAM Journal on Computing, 8:2, (151-174), Online publication date: 1-May-1979.
- Chandra A and Harel D Computable queries for relational data bases (Preliminary Report) Proceedings of the eleventh annual ACM symposium on Theory of computing, (309-318)
- Beeri C and Bernstein P (1979). Computational problems related to the design of normal form relational schemas, ACM Transactions on Database Systems, 4:1, (30-59), Online publication date: 1-Mar-1979.
- Prodinger H (1979). On a generalization of the dyck-language over a two letter alphabet, Discrete Mathematics, 28:3, (269-276), Online publication date: 1-Jan-1979.
- Aho A and Ullman J Universality of data retrieval languages Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (110-119)
- Pour-El M Computer Science And Recursion Theory Proceedings of the 1978 annual conference, (15-20)
- Ibarra O (1978). The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications, SIAM Journal on Computing, 7:4, (524-532), Online publication date: 1-Nov-1978.
- Rosenkrantz D and Hunt III H (1978). Polynomial Algorithms for Deterministic Pushdown Automata, SIAM Journal on Computing, 7:4, (405-412), Online publication date: 1-Nov-1978.
- Harrow K How to show something is not Proceedings of the ninth SIGCSE technical symposium on Computer science education, (27-30)
- Harrow K (1978). How to show something is not, ACM SIGCSE Bulletin, 10:3, (27-30), Online publication date: 1-Aug-1978.
- Flemming U Representation and generation of rectangular dissections Proceedings of the 15th Design Automation Conference, (138-144)
- Hendrix G, Sacerdoti E, Sagalowicz D and Slocum J (1978). Developing a natural language interface to complex data, ACM Transactions on Database Systems, 3:2, (105-147), Online publication date: 1-Jun-1978.
- Kozen D Indexing of subrecursive classes Proceedings of the tenth annual ACM symposium on Theory of computing, (287-295)
- Lewis J On the complexity of the Maximum Subgraph Problem Proceedings of the tenth annual ACM symposium on Theory of computing, (265-274)
- Bruss A and Meyer A On time-space classes and their relation to the theory of real addition Proceedings of the tenth annual ACM symposium on Theory of computing, (233-239)
- Wrathall C (1978). Rudimentary Predicates and Relative Computation, SIAM Journal on Computing, 7:2, (194-209), Online publication date: 1-May-1978.
- Hunt, III H and Rosenkrantz D (1978). Computational Parallels between the Regular and Context-Free Languages, SIAM Journal on Computing, 7:1, (99-114), Online publication date: 1-Feb-1978.
- Kasai T, Adachi A and Iwata S Classes of pebble games and complete problems Proceedings of the 1978 annual conference - Volume 2, (914-918)
- Pennello T and DeRemer F A forward move algorithm for LR error recovery Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (241-254)
- Thompson R and Gray F (1978). Universal Modular Trees, IEEE Transactions on Computers, 27:1, (53-63), Online publication date: 1-Jan-1978.
- Bonczek R, Cash J and Whinston A (1977). A transformational grammar-based query processor for access control in a planning system, ACM Transactions on Database Systems, 2:4, (326-338), Online publication date: 1-Dec-1977.
- Borodin A (1977). On Relating Time and Space to Size and Depth, SIAM Journal on Computing, 6:4, (733-744), Online publication date: 1-Dec-1977.
- Gill J (1977). Computational Complexity of Probabilistic Turing Machines, SIAM Journal on Computing, 6:4, (675-695), Online publication date: 1-Dec-1977.
- Harangozó J An approach to describing a data link level protocol with a formal language Proceedings of the fifth symposium on Data communications, (4.37-4.49)
- Minker J (1977). Information storage and retrieval, ACM SIGIR Forum, 12:2, (12-108), Online publication date: 1-Sep-1977.
- Ladner R (1977). The Computational Complexity of Provability in Systems of Modal Propositional Logic, SIAM Journal on Computing, 6:3, (467-480), Online publication date: 1-Sep-1977.
- Igarashi Y (1977). The Tape Comilexity of Some Classes of Szilard Languages, SIAM Journal on Computing, 6:3, (460-466), Online publication date: 1-Sep-1977.
- Sickel S Formal grammars as models of logic derivations Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1, (544-551)
- Maryanski F and Booth T (1977). Inference of Finite-State Probabilistic Grammars, IEEE Transactions on Computers, 26:6, (521-536), Online publication date: 1-Jun-1977.
- Sudborough I Separating tape bounded auxiliary pushdown automata classes Proceedings of the ninth annual ACM symposium on Theory of computing, (208-217)
- Kozen D Complexity of finitely presented algebras Proceedings of the ninth annual ACM symposium on Theory of computing, (164-177)
- Wang P Recognition of two-dimensional patterns Proceedings of the 1977 annual conference, (484-489)
- Wetherell C (1977). Why automatic error correctors fail, Computer Languages, 2:4, (179-186), Online publication date: 1-Jan-1977.
- Williams K (1976). An experimental course in advanced programming methods, ACM SIGCSE Bulletin, 8:4, (15-18), Online publication date: 1-Dec-1976.
- Wang P Formal properties of sequential/parallel matrix languages Proceedings of the 1976 annual conference, (12-16)
- Fosdick L and Osterweil L The detection of anomalous interprocedural data flow Proceedings of the 2nd international conference on Software engineering, (624-628)
- Hartmanis J and Hopcroft J (1976). Independence results in computer science, ACM SIGACT News, 8:4, (13-24), Online publication date: 1-Oct-1976.
- Manna Z and Shamir A (1976). The Theoretical Aspects of the Optimal Fixedpoint, SIAM Journal on Computing, 5:3, (414-426), Online publication date: 1-Sep-1976.
- Harrison M, Ruzzo W and Ullman J (1976). Protection in operating systems, Communications of the ACM, 19:8, (461-471), Online publication date: 1-Aug-1976.
- Sickel S (1976). A Search Technique for Clause Interconnectivity Graphs, IEEE Transactions on Computers, 25:8, (823-835), Online publication date: 1-Aug-1976.
- Wang P and Grosky W (1976). A language for two-dimensional digital picture processing, ACM SIGPLAN Notices, 11:6, (106-112), Online publication date: 1-Jun-1976.
- Sudborough I and Zalcberg A (1976). On Families of Languages Defined by Time-Bounded Random Access Machines, SIAM Journal on Computing, 5:2, (217-230), Online publication date: 1-Jun-1976.
- Sudborough I On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store Proceedings of the eighth annual ACM symposium on Theory of computing, (141-148)
- Ibarra O and Kim C A useful device for showing the solvability of some decision problems Proceedings of the eighth annual ACM symposium on Theory of computing, (135-140)
- Hunt H and Szymanski T Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract) Proceedings of the eighth annual ACM symposium on Theory of computing, (126-134)
- Wang P and Grosky W (1976). A language for two-dimensional digital picture processing, ACM SIGGRAPH Computer Graphics, 10:1, (106-112), Online publication date: 1-May-1976.
- Howard J (1976). Proving monitors, Communications of the ACM, 19:5, (273-279), Online publication date: 1-May-1976.
- Wang P and Grosky W A language for two-dimensional digital picture processing The papers of the ACM symposium on Graphic languages, (106-112)
- Zaiontz C Circular automata Proceedings of the 14th annual ACM Southeast Regional Conference, (350-354)
- Thompson R (1976). Language Correction Using Probabilistic Grammars, IEEE Transactions on Computers, 25:3, (275-286), Online publication date: 1-Mar-1976.
- Hunt H A complexity theory of grammar problems Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (12-18)
- Leong B and Wotschke D The influence of productions on derivations and parsing (Extended Abstract) Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (1-11)
- Mickunas M (1976). On the Complete Covering Problem for LR(k)Grammars, Journal of the ACM, 23:1, (17-30), Online publication date: 1-Jan-1976.
- Jazayeri M, Ogden W and Rounds W (1975). The intrinsically exponential complexity of the circularity problem for attribute grammars, Communications of the ACM, 18:12, (697-706), Online publication date: 1-Dec-1975.
- Baker T, Gill J and Solovay R (1975). Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question, SIAM Journal on Computing, 4:4, (431-442), Online publication date: 1-Dec-1975.
- Thomason M (1975). Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages, IEEE Transactions on Computers, 24:12, (1211-1216), Online publication date: 1-Dec-1975.
- Harrison M, Ruzzo W and Ullman J On protection in operating systems Proceedings of the fifth ACM symposium on Operating systems principles, (14-24)
- Alt H and Mehlhorn K (1975). A language over a one symbol alphabet requiring only O (log log n) space, ACM SIGACT News, 7:4, (31-33), Online publication date: 1-Nov-1975.
- Harrison M, Ruzzo W and Ullman J (1975). On protection in operating systems, ACM SIGOPS Operating Systems Review, 9:5, (14-24), Online publication date: 1-Nov-1975.
- Schreiber F (1975). Some linguistical problems about colloquies, ACM SIGCOMM Computer Communication Review, 5:4, (8-23), Online publication date: 1-Oct-1975.
- Kosaraju S (1975). Speed of Recognition of Context-Free Languages by Array Automata, SIAM Journal on Computing, 4:3, (331-340), Online publication date: 1-Sep-1975.
- Sethi R (1975). Complete Register Allocation Problems, SIAM Journal on Computing, 4:3, (226-248), Online publication date: 1-Sep-1975.
- Aho A, Johnson S and Ullman J (1975). Deterministic parsing of ambiguous grammars, Communications of the ACM, 18:8, (441-452), Online publication date: 1-Aug-1975.
- Lai-Wo Fung and King-Sun Fu (1975). Stochastic Syntactic Decoding for Pattern Classification, IEEE Transactions on Computers, 24:6, (662-667), Online publication date: 1-Jun-1975.
- Feng H and Pavlidis T (1975). Decomposition of Polygons into Simpler Components, IEEE Transactions on Computers, 24:6, (636-650), Online publication date: 1-Jun-1975.
- Wotschke D Degree-languages, polynomial time recognition, and the LBA problem Proceedings of the seventh annual ACM symposium on Theory of computing, (145-152)
- Ehrenfeucht A and Rozenberg G On (un)predictability of formal languages (Extended Abstract) Proceedings of the seventh annual ACM symposium on Theory of computing, (117-120)
- Machtey M (1975). On the density of honest subrecursive classes, Journal of Computer and System Sciences, 10:2, (183-199), Online publication date: 1-Apr-1975.
- Hartmanis J and Baker T (1975). On Simple Goedel Numberings and Translations, SIAM Journal on Computing, 4:1, (1-11), Online publication date: 1-Mar-1975.
- Ibarra O and Sahni S (1975). Polynomially Complete Fault Detection Problems, IEEE Transactions on Computers, 24:3, (242-249), Online publication date: 1-Mar-1975.
- Solomon M Modes, values and expressions Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (149-159)
- Jazayeri M, Ogden W and Rounds W On the complexity of the circularity test for attribute grammars Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (119-129)
- Jones N and Muchnick S Even simple programs are hard to analyze Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (106-118)
- Thomason M and Gonzalez R (1975). Syntactic Recognition of Imperfectly Specified Patterns, IEEE Transactions on Computers, 24:1, (93-95), Online publication date: 1-Jan-1975.
- Sahni S (1974). Computationally Related Problems, SIAM Journal on Computing, 3:4, (262-279), Online publication date: 1-Dec-1974.
- Purdom P (1974). The size of LALR (1) parsers, BIT, 14:3, (326-337), Online publication date: 1-Sep-1974.
- Abramson H (1974). A syntax directed macro processor, BIT, 14:3, (261-272), Online publication date: 1-Sep-1974.
- Thompson R (1974). Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages, IEEE Transactions on Computers, 23:6, (603-614), Online publication date: 1-Jun-1974.
- Thomason M (1974). Errors in Regular Languages, IEEE Transactions on Computers, 23:6, (597-602), Online publication date: 1-Jun-1974.
- Kosaraju S (1974). On Some Open Problems in the Theory of Cellular Automata, IEEE Transactions on Computers, 23:6, (561-565), Online publication date: 1-Jun-1974.
- Hart J (1974). A Class of Push-Down Acceptors for Adjunct Languages, IEEE Transactions on Computers, 23:5, (449-455), Online publication date: 1-May-1974.
- Leeuwen J A partial solution to the reachability-problem for vector-addition systems Proceedings of the sixth annual ACM symposium on Theory of computing, (303-309)
- Greibach S Some restrictions on W-grammars Proceedings of the sixth annual ACM symposium on Theory of computing, (256-265)
- Mehlhorn K Polynomial and abstract subrecursive classes Proceedings of the sixth annual ACM symposium on Theory of computing, (96-109)
- Jones N and Laaser W Complete problems for deterministic polynomial time Proceedings of the sixth annual ACM symposium on Theory of computing, (40-46)
- Cook C (1974). First Order Graph Grammars, SIAM Journal on Computing, 3:1, (90-99), Online publication date: 1-Mar-1974.
- Lyon G (1974). Syntax-directed least-errors analysis for context-free languages, Communications of the ACM, 17:1, (3-14), Online publication date: 1-Jan-1974.
- Seiferas J (1974). A note on prefixes of regular languages, ACM SIGACT News, 6:1, (25-29), Online publication date: 1-Jan-1974.
- Ellis C (1973). On the probability of deadlock in computer systems, ACM SIGOPS Operating Systems Review, 7:4, (88-95), Online publication date: 1-Oct-1973.
- Aho A, Johnson S and Ullman J Deterministic parsing of ambiguous grammars Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (1-21)
- Gates G and Poplawski D (1973). A simple technique for structured variable lookup, Communications of the ACM, 16:9, (561-565), Online publication date: 1-Sep-1973.
- Ibaraki T (1973). Finite State Representations of Discrete Optimization Problems, SIAM Journal on Computing, 2:3, (193-210), Online publication date: 1-Sep-1973.
- Savitch W (1973). How to Make Arbitrary Grammars Look Like Context-Free Grammars, SIAM Journal on Computing, 2:3, (174-182), Online publication date: 1-Sep-1973.
- LeBeux P Selection processes and their relation to automata Proceedings of the ACM annual conference, (336-341)
- Peterson W, Kasami T and Tokura N (1973). On the capabilities of while, repeat, and exit statements, Communications of the ACM, 16:8, (503-512), Online publication date: 1-Aug-1973.
- Hall P (1973). Equivalence between AND/OR graphs and context-free grammars, Communications of the ACM, 16:7, (444-445), Online publication date: 1-Jul-1973.
- Gabrielian A and Ginsburg S (1973). Structured Storage AFA, IEEE Transactions on Computers, 22:5, (534-537), Online publication date: 1-May-1973.
- Booth T and Thompson R (1973). Applying Probability Measures to Abstract Languages, IEEE Transactions on Computers, 22:5, (442-450), Online publication date: 1-May-1973.
- Sethi R Complete register allocation problems Proceedings of the fifth annual ACM symposium on Theory of computing, (182-195)
- Lewis P, Rosenkrantz D and Stearns R Attributed translations(Extended Abstract) Proceedings of the fifth annual ACM symposium on Theory of computing, (160-171)
- Hunt H On the time and tape complexity of languages I Proceedings of the fifth annual ACM symposium on Theory of computing, (10-19)
- Stockmeyer L and Meyer A Word problems requiring exponential time(Preliminary Report) Proceedings of the fifth annual ACM symposium on Theory of computing, (1-9)
- Roth R and LaFrance J (1973). Computer science for liberal arts colleges a report of a workshop held at Wheaton College, Wheaton, Illinois july 12-14, 1972, ACM SIGCSE Bulletin, 5:1, (70-76), Online publication date: 1-Feb-1973.
- Gimpel J (1973). A theory of discrete patterns and their implementation in SNOBOL4, Communications of the ACM, 16:2, (91-100), Online publication date: 1-Feb-1973.
- Roth R and LaFrance J Computer science for liberal arts colleges a report of a workshop held at Wheaton College, Wheaton, Illinois july 12-14, 1972 Proceedings of the third SIGCSE technical symposium on Computer science education, (70-76)
- Ellis C On the probability of deadlock in computer systems Proceedings of the fourth ACM symposium on Operating system principles, (88-95)
- Harrison M and Havel I (1972). Real-Time Strict Deterministic Languages, SIAM Journal on Computing, 1:4, (333-349), Online publication date: 1-Dec-1972.
- Hartmanis J (1972). On non-determinancy in simple computing devices, Acta Informatica, 1:4, (336-344), Online publication date: 1-Dec-1972.
- Brown S, Gries D and Szymanski T (1972). Program Schemes with Pushdown Stores, SIAM Journal on Computing, 1:3, (242-268), Online publication date: 1-Sep-1972.
- Gilbert I and Cohen J A simple hardware model of a Turing machine Proceedings of the ACM annual conference - Volume 1, (324-329)
- Smith B (1972). Letters to the editor, ACM SIGMIS Database: the DATABASE for Advances in Information Systems, 4:2, (10-11), Online publication date: 1-Jul-1972.
- Denning P (1972). Operating systems principles and undergraduate computer science curricula, ACM SIGMIS Database: the DATABASE for Advances in Information Systems, 4:2, (5-10), Online publication date: 1-Jul-1972.
- Lee H and King-Sun Fu (1972). A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification, IEEE Transactions on Computers, 21:7, (660-666), Online publication date: 1-Jul-1972.
- Fischer P Theory of computing in computer science education Proceedings of the May 16-18, 1972, spring joint computer conference, (857-864)
- Denning P Operating systems principles and undergraduate computer science curricula Proceedings of the May 16-18, 1972, spring joint computer conference, (849-855)
- Savitch W Maze recognizing automata (Extended Abstract) Proceedings of the fourth annual ACM symposium on Theory of computing, (151-156)
- Cook S and Reckhow R Time-bounded random access machines Proceedings of the fourth annual ACM symposium on Theory of computing, (73-80)
- Garland S and Luckham D On the equivalence of schemes Proceedings of the fourth annual ACM symposium on Theory of computing, (65-72)
- Chandra A and Manna Z Program schemas with equality Proceedings of the fourth annual ACM symposium on Theory of computing, (52-64)
- Constable R and David G (1972). On Classes of Program Schemata, SIAM Journal on Computing, 1:1, (66-118), Online publication date: 1-Mar-1972.
- Garland S and Luckham D Translating recursion schemes into program schemes Proceedings of ACM conference on Proving assertions about programs, (83-96)
- Paterson M Decision problems in computational models Proceedings of ACM conference on Proving assertions about programs, (74-82)
- Garland S and Luckham D (1972). Translating recursion schemes into program schemes, ACM SIGACT News:14, (83-96), Online publication date: 1-Jan-1972.
- Paterson M (1972). Decision problems in computational models, ACM SIGACT News:14, (74-82), Online publication date: 1-Jan-1972.
- Garland S and Luckham D (1972). Translating recursion schemes into program schemes, ACM SIGPLAN Notices, 7:1, (83-96), Online publication date: 1-Jan-1972.
- Paterson M (1972). Decision problems in computational models, ACM SIGPLAN Notices, 7:1, (74-82), Online publication date: 1-Jan-1972.
- Pavlidis T (1972). Linear and Context-Free Graph Grammars, Journal of the ACM, 19:1, (11-22), Online publication date: 1-Jan-1972.
- Menninga L A syntax-directed approach to pattern recognition and description Proceedings of the November 16-18, 1971, fall joint computer conference, (145-151)
- DeRemer F (1971). Simple LR(k) grammars, Communications of the ACM, 14:7, (453-460), Online publication date: 1-Jul-1971.
- Amarel S (1971). Computer science, Communications of the ACM, 14:6, (391-401), Online publication date: 1-Jun-1971.
- Cook S The complexity of theorem-proving procedures Proceedings of the third annual ACM symposium on Theory of computing, (151-158)
- Rajlich V Absolutely parallel grammars and two-way deterministic finite-state transducers Proceedings of the third annual ACM symposium on Theory of computing, (132-137)
- Aiken R (1970). A course on the relationship of formal language theory to automata, ACM SIGCSE Bulletin, 2:3, (34-40), Online publication date: 1-Nov-1970.
- Lewis D Closure of families of languages under substitution operators Proceedings of the second annual ACM symposium on Theory of computing, (100-108)
- Book R, Greibach S and Wegbreit B Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract) Proceedings of the second annual ACM symposium on Theory of computing, (92-99)
- Burkhard W Complexity problems in real time computation Proceedings of the second annual ACM symposium on Theory of computing, (62-69)
- Cudia D The degree hierarchy of undecidable problems of formal grammars Proceedings of the second annual ACM symposium on Theory of computing, (10-21)
- Aiken R A course on the Relationship of Formal Language Theory to Automata Proceedings of the first SIGCSE technical symposium on Education in computer science, (34-40)
- Cudia D (1969). The degree diagram of undecidable problems of formal grammars, ACM SIGACT News:3, (7-8), Online publication date: 1-Oct-1969.
- Fischer M Some properties of precedence languages Proceedings of the first annual ACM symposium on Theory of computing, (181-190)
Index Terms
- Formal languages and their relation to 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 ...