Browse Books

Kihara Y and Seki S (2023). Programmable single-stranded architectures for computing, Natural Computing: an international journal, 22:3, (563-585), Online publication date: 1-Sep-2023.

Salo V (2023). On von Neumann regularity of cellular automata, Natural Computing: an international journal, 22:3, (527-538), Online publication date: 1-Sep-2023.

Cotumaccio N, D’Agostino G, Policriti A and Prezza N (2023). Co-lexicographically Ordering Automata and Regular Languages - Part I, Journal of the ACM, 70:4, (1-73), Online publication date: 31-Aug-2023.

Evgin A, Solovev M and Padaryan V (2022). A Model and Declarative Language for Specifying Binary Data Formats, Programming and Computing Software, 48:7, (469-483), Online publication date: 1-Dec-2022.

Krogmeier P, Lin Z, Murali A and Madhusudan P (2022). Synthesizing axiomatizations using logic learning, Proceedings of the ACM on Programming Languages, 6:OOPSLA2, (1697-1725), Online publication date: 31-Oct-2022.

Pavlogiannis A (2022). CFL/Dyck Reachability, ACM SIGLOG News, 9:4, (5-25), Online publication date: 1-Oct-2022.

Li Y, Turrini A, Feng W, Vardi M and Zhang L Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition Computer Aided Verification, (152-173)

Soueidi C and Falcone Y Capturing program models with BISM Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, (1857-1861)

Chistikov D, Majumdar R and Schepper P (2022). Subcubic certificates for CFL reachability, Proceedings of the ACM on Programming Languages, 6:POPL, (1-29), Online publication date: 16-Jan-2022.

Sangiorgi D (2022). From enhanced coinduction towards enhanced induction, Proceedings of the ACM on Programming Languages, 6:POPL, (1-29), Online publication date: 16-Jan-2022.

Kakarla S, Beckett R, Millstein T and Varghese G How Complex is DNS? Proceedings of the 20th ACM Workshop on Hot Topics in Networks, (116-122)

Ganty P, Ranzato F and Valero P (2021). Complete Abstractions for Checking Language Inclusion, ACM Transactions on Computational Logic, 22:4, (1-40), Online publication date: 31-Oct-2021.

Cheon H, Hahn J, Han Y and Ko S Most Pseudo-copy Languages Are Not Context-Free Computing and Combinatorics, (189-200)

Mereghetti C and Palano B (2021). Guest Column, ACM SIGACT News, 52:3, (38-59), Online publication date: 17-Oct-2021.

Oliva C and Lago-Fernández L Separation of Memory and Processing in Dual Recurrent Neural Networks Artificial Neural Networks and Machine Learning – ICANN 2021, (360-371)

Xu Z, Wu B, Ojha A, Neider D and Topcu U Active Finite Reward Automaton Inference and Reinforcement Learning Using Queries and Counterexamples Machine Learning and Knowledge Extraction, (115-135)

Habib A, Shinnar A, Hirzel M and Pradel M Finding data compatibility bugs with JSON subschema checking Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis, (620-632)

Borboudakis G and Tsamardinos I (2021). Extending greedy feature selection algorithms to multiple solutions, Data Mining and Knowledge Discovery, 35:4, (1393-1434), Online publication date: 1-Jul-2021.

Chaudhuri D, Ike R, Rahmani H, Shell D, Becker A and O’Kane J Conditioning Style on Substance: Plans for Narrative Observation 2021 IEEE International Conference on Robotics and Automation (ICRA), (2687-2693)

Cotumaccio N and Prezza N On indexing and compressing finite automata Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2585-2599)

Bolander T and Lequen A Parameterized Complexity of Dynamic Belief Updates Dynamic Logic. New Trends and Applications, (87-102)

Costa G, Galletta L, Degano P, Basin D and Bodei C (2020). Natural Projection as Partial Model Checking, Journal of Automated Reasoning, 64:7, (1445-1481), Online publication date: 1-Oct-2020.

de Souza Amorim L and Visser E Multi-purpose Syntax Definition with SDF3 Software Engineering and Formal Methods, (1-23)

Kalenkova A, Polyvyanyy A and La Rosa M A Framework for Estimating Simplicity of Automatically Discovered Process Models Based on Structural and Behavioral Characteristics Business Process Management, (129-146)

Orachev E, Epelbaum I, Azimov R and Grigorev S Context-Free Path Querying by Kronecker Product Advances in Databases and Information Systems, (49-59)

Marcus P and Törmä I Descriptional Complexity of Winning Sets of Regular Languages Descriptional Complexity of Formal Systems, (130-141)

Goncharov S, Milius S and Silva A (2020). Toward a Uniform Theory of Effectful State Machines, ACM Transactions on Computational Logic, 21:3, (1-63), Online publication date: 31-Jul-2020.

Djidjev H Automaton-based methodology for implementing optimization constraints for quantum annealing Proceedings of the 17th ACM International Conference on Computing Frontiers, (118-125)

Fleischer L and Shallit J The State Complexity of Lexicographically Smallest Words and Computing Successors Developments in Language Theory, (83-95)

Attiya H and Rajsbaum S (2020). Indistinguishability, Communications of the ACM, 63:5, (90-99), Online publication date: 20-Apr-2020.

Asinowski A, Bacher A, Banderier C and Gittenberger B (2019). Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata, Algorithmica, 82:3, (386-428), Online publication date: 1-Mar-2020.

Yu N and Wirsing M The Application of Continuous Time SRML Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering, (99-103)

Sulzmann M and Lu K Solving of Regular Equations Revisited Theoretical Aspects of Computing – ICTAC 2019, (392-409)

Van Tendeloo Y, Van Mierlo S and Vangheluwe H (2019). A Multi-Paradigm Modelling approach to live modelling, Software and Systems Modeling (SoSyM), 18:5, (2821-2842), Online publication date: 1-Oct-2019.

Bockenek J, Verbeek F, Lammich P and Ravindran B Formal Verification of Memory Preservation of x86-64 Binaries Computer Safety, Reliability, and Security, (35-49)

Bertoglio N, Lamperti G and Zanella M Temporal Diagnosis of Discrete-Event Systems with Dual Knowledge Compilation Machine Learning and Knowledge Extraction, (333-352)

Bavishi R, Yoshida H and Prasad M Phoenix: automated data-driven synthesis of repairs for static analysis violations Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, (613-624)

Pan T, Xu J, Jiang S and Xu F (2019). Cell-like spiking neural P systems with evolution rules, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:14, (5401-5409), Online publication date: 1-Jul-2019.

Chatterjee K and Doyen L Graph planning with expected finite horizon Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)

Bonifati A and Dumbrava S (2019). Graph Queries, ACM SIGMOD Record, 47:4, (5-16), Online publication date: 17-May-2019.

Zhou M, Mark G, Li J and Yang H (2019). Trusting Virtual Agents, ACM Transactions on Interactive Intelligent Systems, 9:2-3, (1-36), Online publication date: 25-Apr-2019.

Desel J, Esparza J and Hoffmann P (2019). Negotiation as concurrency primitive, Acta Informatica, 56:2, (93-159), Online publication date: 1-Mar-2019.

Pontarelli S, Bifulco R, Bonola M, Cascone C, Spaziani M, Bruschi V, Sanvito D, Siracusano G, Capone A, Honda M, Huici F and Bianchi G Flowblaze Proceedings of the 16th USENIX Conference on Networked Systems Design and Implementation, (531-547)

Even G, Medina M and Patt-Shamir B (2019). On-Line Path Computation and Function Placement in SDNs, Theory of Computing Systems, 63:2, (306-325), Online publication date: 1-Feb-2019.

Copeland B and Shagrir O (2018). The Church-Turing thesis, Communications of the ACM, 62:1, (66-74), Online publication date: 19-Dec-2018.

Denzumi S Sequence Sentential Decision Diagrams Combinatorial Optimization and Applications, (592-606)

Van Mierlo S and Vangheluwe H Introduction to statecharts modeling, simulation, testing, and deployment Proceedings of the 2018 Winter Simulation Conference, (306-320)

Friesen A and Domingos P Submodular field grammars Proceedings of the 32nd International Conference on Neural Information Processing Systems, (4312-4322)

Lamali M, Fergani N and Cohen J (2018). Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks, IEEE/ACM Transactions on Networking, 26:6, (2787-2800), Online publication date: 1-Dec-2018.

Rahmani A, Donyanavard B, Mück T, Moazzemi K, Jantsch A, Mutlu O and Dutt N (2018). SPECTR, ACM SIGPLAN Notices, 53:2, (169-183), Online publication date: 30-Nov-2018.

Li Y, Mou X and Chen H Learning Concise Relax NG Schemas Supporting Interleaving from XML Documents Advanced Data Mining and Applications, (303-317)

Newton J and Verna D Recognizing heterogeneous sequences by rational type expression Proceedings of the 3rd ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection, (5-14)

Zhang W, Tang H, Byna S and Chen Y DART Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques, (1-12)

Merayo M, Hierons R and Núñez M (2018). Passive testing with asynchronous communications and timestamps, Distributed Computing, 31:5, (327-342), Online publication date: 1-Oct-2018.

Angles R, Arenas M, Barceló P, Hogan A, Reutter J and Vrgoč D (2017). Foundations of Modern Query Languages for Graph Databases, ACM Computing Surveys, 50:5, (1-40), Online publication date: 30-Sep-2018.

Lamperti G, Zanella M and Zhao X Knowledge Compilation Techniques for Model-Based Diagnosis of Complex Active Systems Machine Learning and Knowledge Extraction, (43-64)

Temkin D Entropy and fatfinger ACM SIGGRAPH 2018 Art Gallery, (405-412)

Moldagaliyev B, Staiger L and Stephan F On the Values for Factor Complexity Implementation and Application of Automata, (274-285)

Guillon B, Pighizzini G and Prigioniero L Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata Implementation and Application of Automata, (186-197)

Fionda V and Pirrò G Fact checking via evidence patterns Proceedings of the 27th International Joint Conference on Artificial Intelligence, (3755-3761)

Narayan A, Cutulenco G, Joshi Y and Fischmeister S (2018). Mining Timed Regular Specifications from System Traces, ACM Transactions on Embedded Computing Systems, 17:2, (1-21), Online publication date: 31-Mar-2018.

Rahmani A, Donyanavard B, Mück T, Moazzemi K, Jantsch A, Mutlu O and Dutt N SPECTR Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, (169-183)

Bhatia A and Kumar A (2018). Quantifying matrix product state, Quantum Information Processing, 17:3, (1-16), Online publication date: 1-Mar-2018.

MacCormick J Strategies for Basing the CS Theory Course on Non-decision Problems Proceedings of the 49th ACM Technical Symposium on Computer Science Education, (521-526)

Dávid I, Ráth I and Varró D (2018). Foundations for Streaming Model Transformations by Complex Event Processing, Software and Systems Modeling (SoSyM), 17:1, (135-162), Online publication date: 1-Feb-2018.

Yaghmazadeh N, Wang X and Dillig I (2018). Automated migration of hierarchical data to relational tables using programming-by-example, Proceedings of the VLDB Endowment, 11:5, (580-593), Online publication date: 1-Jan-2018.

Yaghmazadeh N, Wang X and Dillig I (2018). Automated migration of hierarchical data to relational tables using programming-by-example, Proceedings of the VLDB Endowment, 11:5, (580-593), Online publication date: 1-Jan-2018.

Arafailova E, Beldiceanu N and Simonis H (2018). Deriving generic bounds for time-series constraints based on regular expressions characteristics, Constraints, 23:1, (44-86), Online publication date: 1-Jan-2018.

Nguyen V and Kim K Estimating the Evaluation Cost of Regular Path Queries on Large Graphs Proceedings of the 8th International Symposium on Information and Communication Technology, (92-99)

Pyshkin E Liberal arts in a digitally transformed world Proceedings of the 13th Central & Eastern European Software Engineering Conference in Russia, (1-7)

VanDeGrift T (2017). Implementation projects in a computing theory course, Journal of Computing Sciences in Colleges, 33:1, (148-155), Online publication date: 1-Oct-2017.

Zaytsev V Language design with intent Proceedings of the ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems, (45-52)

Saarikivi O, Veanes M, Mytkowicz T and Musuvathi M (2017). Fusing effectful comprehensions, ACM SIGPLAN Notices, 52:6, (17-32), Online publication date: 14-Sep-2017.

Kusner M, Paige B and Hernández-Lobato J Grammar variational autoencoder Proceedings of the 34th International Conference on Machine Learning - Volume 70, (1945-1954)

Hasuo I (2017). Metamathematics for Systems Design, New Generation Computing, 35:3, (271-305), Online publication date: 1-Jul-2017.

Baschenis F, Gauwin O, Muscholl A and Puppis G Untwisting two-way transducers in elementary time Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)

Pavlovic D and Seidel P Quotients in monadic programming Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)

Saarikivi O, Veanes M, Mytkowicz T and Musuvathi M Fusing effectful comprehensions Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, (17-32)

Lee M, So S and Oh H (2016). Synthesizing regular expressions from examples for introductory automata assignments, ACM SIGPLAN Notices, 52:3, (70-80), Online publication date: 12-May-2017.

Zhang Q and Su Z (2017). Context-sensitive data-dependence analysis via linear conjunctive language reachability, ACM SIGPLAN Notices, 52:1, (344-358), Online publication date: 11-May-2017.

Reed D (2017). Spiraling CS2013 knowledge units across a small CS curriculum, Journal of Computing Sciences in Colleges, 32:5, (125-131), Online publication date: 1-May-2017.

Saberifar F, Mohades A, Razzazi M and O'Kane J (2017). Combinatorial filter reduction, Journal of Computer and System Sciences, 85:C, (74-92), Online publication date: 1-May-2017.

Van Mierlo S, Gomes C and Vangheluwe H Explicit modelling and synthesis of debuggers for hybrid simulation languages Proceedings of the Symposium on Theory of Modeling & Simulation, (1-12)

Bouyer P and Jugé V Dynamic Complexity of the Dyck Reachability Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203, (265-280)

Castro-Schez J, Gallardo J, Miguel R and Vallejo D (2017). Knowledge-based systems to enhance learning, Knowledge-Based Systems, 122:C, (180-198), Online publication date: 15-Apr-2017.

De Felice C, De Prisco R, Malandrino D, Zaccagnino G, Zaccagnino R and Zizza R (2017). Splicing music composition, Information Sciences: an International Journal, 385:C, (196-212), Online publication date: 1-Apr-2017.

Bellaouar S, Cherroun H, Nehar A and Ziadi D Weighted Automata Sequence Kernel Proceedings of the 9th International Conference on Machine Learning and Computing, (48-55)

Sangiorgi D (2017). Equations, Contractions, and Unique Solutions, ACM Transactions on Computational Logic, 18:1, (1-30), Online publication date: 31-Jan-2017.

Zhang Q and Su Z Context-sensitive data-dependence analysis via linear conjunctive language reachability Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (344-358)

Tsankov P, Pistoia M, Tripp O, Vechev M and Ferrara P FASE Proceedings of the 32nd Annual Conference on Computer Security Applications, (471-483)

Gheorghe M, Ipate F and Konur S (2016). Testing based on identifiable P Systems using cover automata and X-machines, Information Sciences: an International Journal, 372:C, (565-578), Online publication date: 1-Dec-2016.

Denzumi S, Yoshinaka R, Arimura H and Minato S (2016). Sequence binary decision diagram, Discrete Applied Mathematics, 212:C, (61-80), Online publication date: 30-Oct-2016.

Yu H, Mao S, Chen F, Xie W, Wang J, Zheng J and Gao Z Protocol design and implementation based on hierarchical state machine for underwater acoustic networks Proceedings of the 11th ACM International Conference on Underwater Networks & Systems, (1-5)

Lee M, So S and Oh H Synthesizing regular expressions from examples for introductory automata assignments Proceedings of the 2016 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, (70-80)

De Masellis R, Di Francescomarino C, Ghidini C and Maggi F Declarative Process Models: Different Ways to Be Hierarchical Service-Oriented Computing, (104-119)

Cutulenco G, Joshi Y, Narayan A and Fischmeister S Mining timed regular expressions from system traces Proceedings of the 5th International Workshop on Software Mining, (3-10)

ToźIăźKa J, JakubźV J, Komenda A and PĕchouăźEk M (2016). Privacy-concerned multiagent planning, Knowledge and Information Systems, 48:3, (581-618), Online publication date: 1-Sep-2016.

Cottone P, Gaglio S, Re G and Ortolani M Gaining insight by structural knowledge extraction Proceedings of the Twenty-second European Conference on Artificial Intelligence, (999-1007)

Knobelsdorf M and Frede C Analyzing Student Practices in Theory of Computation in Light of Distributed Cognition Theory Proceedings of the 2016 ACM Conference on International Computing Education Research, (73-81)

Kopczyński E Invisible Pushdown Languages Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (867-872)

D'Antoni L and Veanes M Minimization of Symbolic Tree Automata Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (873-882)

van Lunteren J Scalable DFA Compilation for High-Performance Regular-Expression Matching Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems, (10-19)

Banerjee A and Roychoudhury A Automated re-factoring of Android apps to enhance energy-efficiency Proceedings of the International Conference on Mobile Software Engineering and Systems, (139-150)

Newton J, Demaille A and Verna D Type-Checking of Heterogeneous Sequences in Common Lisp Proceedings of the 9th European Lisp Symposium on European Lisp Symposium, (13-20)

Chen X, Jones B, Becchi M and Wolf T (2016). Picking Pesky Parameters, IEEE Transactions on Parallel and Distributed Systems, 27:5, (1430-1442), Online publication date: 1-May-2016.

Paolini L, Piccolo M and Roversi L (2016). A Class of Reversible Primitive Recursive Functions, Electronic Notes in Theoretical Computer Science (ENTCS), 322:C, (227-242), Online publication date: 18-Apr-2016.

Esparza J and Hoffmann P Reduction Rules for Colored Workflow Nets Proceedings of the 19th International Conference on Fundamental Approaches to Software Engineering - Volume 9633, (342-358)

Pereira M, Fonseca J and Henriques P (2016). Ontological approach for DSL development, Computer Languages, Systems and Structures, 45:C, (35-52), Online publication date: 1-Apr-2016.

Nassar A, Kurdahi F and Zantout S Topaz Proceedings of the 2016 Conference on Design, Automation & Test in Europe, (1473-1476)

Ramanathan A, Pullum L, Hussain F, Chakrabarty D and Jha S Integrating symbolic and statistical methods for testing intelligent systems applications to machine learning and computer vision Proceedings of the 2016 Conference on Design, Automation & Test in Europe, (786-791)

Garrabrant S and Pak I Permutation patterns are hard to count Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (923-936)

Sangiorgi D The Proof Technique of Unique Solutions of Contractions Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (63-68)

Rodriguez M The Gremlin graph traversal machine and language (invited talk) Proceedings of the 15th Symposium on Database Programming Languages, (1-10)

Alechina N, Bulling N, Logan B and Nguyen H On the boundary of (un)decidability Proceedings of the 24th International Conference on Artificial Intelligence, (1494-1501)

Xue Y, Wang J, Liu Y, Xiao H, Sun J and Chandramohan M Detection and classification of malicious JavaScript via attack behavior modelling Proceedings of the 2015 International Symposium on Software Testing and Analysis, (48-59)

Juayong R and Adorna H (2015). Relating Computations in Non-cooperative Transition P Systems and Evolution-Communication P Systems with Energy, Fundamenta Informaticae, 136:3, (209-217), Online publication date: 1-Jul-2015.

Zhang Y, Chen Z, Wang J, Dong W and Liu Z Regular property guided dynamic symbolic execution Proceedings of the 37th International Conference on Software Engineering - Volume 1, (643-653)

Veanes M, Mytkowicz T, Molnar D and Livshits B (2015). Data-Parallel String-Manipulating Programs, ACM SIGPLAN Notices, 50:1, (139-152), Online publication date: 11-May-2015.

Sangiorgi D (2015). Equations, Contractions, and Unique Solutions, ACM SIGPLAN Notices, 50:1, (421-432), Online publication date: 11-May-2015.

Veanes M, Mytkowicz T, Molnar D and Livshits B Data-Parallel String-Manipulating Programs Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (139-152)

Sangiorgi D Equations, Contractions, and Unique Solutions Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (421-432)

Firsov D and Uustalu T Certified Normalization of Context-Free Grammars Proceedings of the 2015 Conference on Certified Programs and Proofs, (167-174)

Ibarra O and Seki S (2015). Semilinear Sets and Counter Machines, Fundamenta Informaticae, 138:1-2, (61-76), Online publication date: 1-Jan-2015.

Mayr E and Weihmann J (2015). Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms, Fundamenta Informaticae, 137:1, (61-86), Online publication date: 1-Jan-2015.

Vollweiler M (2015). Asynchronous Systems of Parallel Communicating Finite Automata, Fundamenta Informaticae, 136:1-2, (177-197), Online publication date: 1-Jan-2015.

Pighizzini G and Pisoni A (2015). Limited Automata and Context-Free Languages, Fundamenta Informaticae, 136:1-2, (157-176), Online publication date: 1-Jan-2015.

Parr T, Harwell S and Fisher K (2014). Adaptive LL(*) parsing, ACM SIGPLAN Notices, 49:10, (579-598), Online publication date: 31-Dec-2015.

Oberortner E, Bhatia S, Lindgren E and Densmore D (2014). A Rule-Based Design Specification Language for Synthetic Biology, ACM Journal on Emerging Technologies in Computing Systems, 11:3, (1-19), Online publication date: 30-Dec-2015.

Arenas M, Daenen J, Neven F, Ugarte M, Bussche J and Vansummeren S (2014). Discovering XSD Keys from XML Data, ACM Transactions on Database Systems, 39:4, (1-49), Online publication date: 30-Dec-2015.

Soulé R, Basu S, Marandi P, Pedone F, Kleinberg R, Sirer E and Foster N Merlin Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, (213-226)

Fulton N, Omar C and Aldrich J Statically typed string sanitation inside a python Proceedings of the 2014 International Workshop on Privacy & Security in Programming, (3-10)

Karaivanov S, Raychev V and Vechev M Phrase-Based Statistical Translation of Programming Languages Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software, (173-184)

Parr T, Harwell S and Fisher K Adaptive LL(*) parsing Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, (579-598)

Vegdahl S (2014). Visualizing NP-completeness through circuit-based widgets, Journal of Computing Sciences in Colleges, 30:1, (190-198), Online publication date: 1-Oct-2014.

Valmari A (2014). Asymptotic proportion of hard instances of the halting problem, Acta Cybernetica, 21:3, (307-330), Online publication date: 1-Aug-2014.

Maretić G, Dashti M and Basin D Anchored LTL separation Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (1-9)

Buzhinsky I, Chivilikhin D, Ulyantsev V and Tsarev F Improving the quality of supervised finite-state machine construction using real-valued variables Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, (1037-1040)

Madejski G (2014). Infinite Hierarchy of Permutation Languages, Fundamenta Informaticae, 130:3, (263-274), Online publication date: 1-Jul-2014.

Caron P, Flouret M and Mignot L k,l-Unambiguity and Quasi-Deterministic Structures Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (260-272)

D'Antoni L and Veanes M (2014). Minimization of symbolic automata, ACM SIGPLAN Notices, 49:1, (541-553), Online publication date: 13-Jan-2014.

D'Antoni L and Veanes M Minimization of symbolic automata Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (541-553)

Smetanin Y and Ulyanov M (2014). Reconstruction of a Word from a Finite Set of its Subwords under the unit Shift Hypothesis. I. Reconstruction without for Bidden Words1 Please check captured article title, if appropriate., Cybernetics and Systems Analysis, 50:1, (148-156), Online publication date: 1-Jan-2014.

Wang Y, Zhang N, Wu Y and Su B Protocol Specification Inference Based on Keywords Identification Part II of the Proceedings of the 9th International Conference on Advanced Data Mining and Applications - Volume 8347, (443-454)

Gaglio S, Lo Re G, Morana M and Ortolani M Gesture Recognition for Improved UseräExperience in a SmartäEnvironment Proceeding of the XIIIth International Conference on AI*IA 2013: Advances in Artificial Intelligence - Volume 8249, (493-504)

Soulé R, Basu S, Kleinberg R, Sirer E and Foster N Managing the network with Merlin Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks, (1-7)

Xiao H, Sun J, Liu Y, Lin S and Sun C TzuYu Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering, (432-442)

Parameswaran A, Kaushik R and Arasu A Efficient parsing-based search over structured data Proceedings of the 22nd ACM international conference on Information & Knowledge Management, (49-58)

Chen X, Jones B, Becchi M and Wolf T Picking pesky parameters Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems, (203-214)

Amershi S, Mahmud J, Nichols J, Lau T and Ruiz G (2013). LiveAction, ACM Transactions on Interactive Intelligent Systems, 3:3, (1-23), Online publication date: 1-Oct-2013.

Esparza J and Desel J On negotiation as concurrency primitive Proceedings of the 24th international conference on Concurrency Theory, (440-454)

Nelson T, Guha A, Dougherty D, Fisler K and Krishnamurthi S A balance of power Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking, (79-84)

Davidson S, Huang X, Stoyanovich J and Yuan X Search and result presentation in scientific workflow repositories Proceedings of the 25th International Conference on Scientific and Statistical Database Management, (1-12)

Belli F and Beyazıt M Using regular grammars for event-based testing Proceedings of the 18th international conference on Implementation and Application of Automata, (48-59)

Ibarra O and Ravikumar B Some decision problems concerning NPDAs, palindromes, and dyck languages Proceedings of the 18th international conference on Implementation and Application of Automata, (193-207)

Alur R, Durand-Gasselin A and Trivedi A From Monadic Second-Order Definable String Transformations to Transducers Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (458-467)

Yang X, Wang B, Qiu T, Wang Y and Li C Improving regular-expression matching on strings using negative factors Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, (361-372)

Erickson J and Nayyeri A (2013). Tracing Compressed Curves in Triangulated Surfaces, Discrete & Computational Geometry, 49:4, (823-863), Online publication date: 1-Jun-2013.

Chandrikakutty H, Unnikrishnan D, Tessier R and Wolf T High-performance hardware monitors to protect network processors from data plane attacks Proceedings of the 50th Annual Design Automation Conference, (1-6)

Inverardi P and Tivoli M Automatic synthesis of modular connectors via composition of protocol mediation patterns Proceedings of the 2013 International Conference on Software Engineering, (3-12)

Shade E (2013). A pedagogical regular-expression engine, Journal of Computing Sciences in Colleges, 28:5, (160-167), Online publication date: 1-May-2013.

Pighizzini G (2013). Two-Way Finite Automata, Fundamenta Informaticae, 126:2-3, (225-246), Online publication date: 1-Apr-2013.

Devriese D, Sergey I, Clarke D and Piessens F Fixing idioms Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation, (97-106)

Lunteren J, Hagleitner C, Heil T, Biran G, Shvadron U and Atasu K Designing a Programmable Wire-Speed Regular-Expression Matching Accelerator Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture, (461-472)

Garzon M (2012). Ubiquity symposium: Evolutionary computation and the processes of life, Ubiquity, 2012:November, (1-16), Online publication date: 1-Nov-2012.

Yang L, Manadhata P, Horne W, Rao P and Ganapathy V Fast submatch extraction using OBDDs Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems, (163-174)

Jirásková G and Masopust T On properties and state complexity of deterministic state-partition automata Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (164-178)

Bundala D, Ouaknine J and Worrell J On the Magnitude of Completeness Thresholds in Bounded Model Checking Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (155-164)

Losemann K and Martens W The complexity of evaluating path expressions in SPARQL Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, (101-112)

Bližnák M, Dulík T and Jašek R Round-trip software engineering with codedesigner RAD Proceedings of the 5th WSEAS congress on Applied Computing conference, and Proceedings of the 1st international conference on Biologically Inspired Computation, (68-73)

Dennunzio A, Formenti E and Manzoni L (2012). Computing Issues of Asynchronous CA, Fundamenta Informaticae, 120:2, (165-180), Online publication date: 1-Apr-2012.

Erwig M and Gopinath R Explanations for regular expressions Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering, (394-408)

Adámek J, Bonchi F, Hülsbusch M, König B, Milius S and Silva A A coalgebraic perspective on minimization and determinization Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (58-73)

Abdulla P, Atig M and Stenman J The minimal cost reachability problem in priced timed pushdown systems Proceedings of the 6th international conference on Language and Automata Theory and Applications, (58-69)

Dennunzio A, Formenti E and Provillard J Computational complexity of rule distributions of non-uniform cellular automata Proceedings of the 6th international conference on Language and Automata Theory and Applications, (204-215)

Jain S, Zhang C and Scholz B Translating flowcharts to non-deterministic languages Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation, (155-162)

Kotek T and Makowsky J (2012). A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths, Fundamenta Informaticae, 117:1-4, (199-213), Online publication date: 1-Jan-2012.

Rampersad N, Shallit J and Xu Z (2012). The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages, Fundamenta Informaticae, 116:1-4, (223-236), Online publication date: 1-Jan-2012.

Kumar A and Ré C (2011). Probabilistic management of OCR data using an RDBMS, Proceedings of the VLDB Endowment, 5:4, (322-333), Online publication date: 1-Dec-2011.

Leogrande M, Ciminiera L and Risso F Modeling Filtering Predicates Composition with Finite State Automata Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems, (93-94)

Peng K, Tang S, Chen M and Dong Q Chain-Based DFA Deflation for Fast and Scalable Regular Expression Matching Using TCAM Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems, (24-35)

Fowler T The generative power of probabilistic and weighted context-free grammars Proceedings of the 12th biennial conference on The mathematics of language, (57-71)

Ben-David S, Chechik M, Gurfinkel A and Uchitel S CSSL Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, (37-47)

Nessel J and Cimpa B The MovieOracle - Content Based Movie Recommendations Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03, (361-364)

Yli-Jyrä A Compiling simple context restrictions with nondeterministic automata Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, (30-38)

Leidner J and Lieberman M (2011). Detecting geographical references in the form of place names and associated spatial natural language, SIGSPATIAL Special, 3:2, (5-11), Online publication date: 1-Jul-2011.

Esparza J, Ganty P, Kiefer S and Luttenberger M (2011). Parikh's theorem, Information Processing Letters, 111:12, (614-619), Online publication date: 1-Jun-2011.

Yu F, Alkhalaf M and Bultan T Patching vulnerabilities with sanitization synthesis Proceedings of the 33rd International Conference on Software Engineering, (251-260)

Costa D, Niqui M and Rutten J Intentional automata Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, (335-342)

Ahmadi A, Jungers R, Parrilo P and Roozbehani M Analysis of the joint spectral radius via lyapunov functions on path-complete graphs Proceedings of the 14th international conference on Hybrid systems: computation and control, (13-22)

Leupold P and Otto F (2011). On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems, Fundamenta Informaticae, 112:2-3, (219-238), Online publication date: 1-Apr-2011.

Xing G and Parthepan V Efficient schema extraction from a large collection of XML documents Proceedings of the 49th Annual Southeast Regional Conference, (92-96)

Bloomfield A and Wulf W IBCM Proceedings of the 42nd ACM technical symposium on Computer science education, (371-376)

Kuppusamy L, Mahendran A and Krishna S Matrix insertion-deletion systems for bio-molecular structures Proceedings of the 7th international conference on Distributed computing and internet technology, (301-312)

Baeten J, Luttik B and van Tilburg P Computations and interaction Proceedings of the 7th international conference on Distributed computing and internet technology, (35-54)

Maletti A (2011). Survey, Acta Cybernetica, 20:2, (223-250), Online publication date: 1-Feb-2011.

Henglein F and Nielsen L Regular expression containment Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (385-398)

Madhusudan P and Parlato G The tree width of auxiliary storage Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (283-294)

Henglein F and Nielsen L (2011). Regular expression containment, ACM SIGPLAN Notices, 46:1, (385-398), Online publication date: 26-Jan-2011.

Madhusudan P and Parlato G (2011). The tree width of auxiliary storage, ACM SIGPLAN Notices, 46:1, (283-294), Online publication date: 26-Jan-2011.

Ware S and Malik R A process-algebraic semantics for generalised nonblocking Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119, (75-84)

Côté M, Gendron B and Rousseau L (2011). Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling, Management Science, 57:1, (151-163), Online publication date: 1-Jan-2011.

Wehr S and Thiemann P (2011). On the Decidability of Subtyping with Bounded Existential Types and Implementation Constraints, New Generation Computing, 29:1, (87-124), Online publication date: 1-Jan-2011.

Kaminski M and Tan T (2010). A Note on Two-pebble Automata Over Infinite Alphabets, Fundamenta Informaticae, 98:4, (379-390), Online publication date: 1-Dec-2010.

Stilman B, Yakhnis V and Umanskiy O Discovering role of linguistic geometry Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II, (1-21)

Lee J, Pham M, Lee J, Han W, Cho H, Yu H and Lee J Processing SPARQL queries with regular expressions in RDF databases Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics, (23-30)

Stakhanova N, Ren H and Ghorbani A Selective regular expression matching Proceedings of the 13th international conference on Information security, (226-240)

Purandare R, Dwyer M and Elbaum S (2010). Monitor optimization via stutter-equivalent loop transformation, ACM SIGPLAN Notices, 45:10, (270-285), Online publication date: 17-Oct-2010.

Purandare R, Dwyer M and Elbaum S Monitor optimization via stutter-equivalent loop transformation Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (270-285)

Yang L, Karim R, Ganapathy V and Smith R Improving NFA-based signature matching using ordered binary decision diagrams Proceedings of the 13th international conference on Recent advances in intrusion detection, (58-78)

Chandramouli B, Goldstein J and Maier D (2010). High-performance dynamic pattern matching over disordered streams, Proceedings of the VLDB Endowment, 3:1-2, (220-231), Online publication date: 1-Sep-2010.

Mouha N, Velichkov V, De Cannière C and Preneel B The differential analysis of S-functions Proceedings of the 17th international conference on Selected areas in cryptography, (36-56)

Bulling N and Farwer B On the (Un-)Decidability of Model Checking Resource-Bounded Agents Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (567-572)

CANSCID-CUDA Proceedings of the Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign, (95-98)

Kreowski H, Kuske S and von Totth C Combining graph transformation and algebraic specification into model transformation Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques, (193-208)

Mahmud M Constructing states for reinforcement learning Proceedings of the 27th International Conference on International Conference on Machine Learning, (727-734)

Babu A, Limaye N and Varma G Streaming algorithms for some problems in log-space Proceedings of the 7th annual conference on Theory and Applications of Models of Computation, (94-104)

Gelade W, Idziaszek T, Martens W and Neven F Simplifying XML schema Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (251-260)

Xhafa F, Paniagua C, Barolli L and Caballe S (2010). A parallel grid-based implementation for real-time processing of event log data of collaborative applications, International Journal of Web and Grid Services, 6:2, (124-140), Online publication date: 1-Jun-2010.

Milo N, Pinhas T and Ziv-Ukelson M SA-REPC Proceedings of the 4th international conference on Language and Automata Theory and Applications, (451-462)

Mariani L, Pezzè M, Riganelli O and Santoro M SEIM Proceedings of the 2nd International Workshop on Principles of Engineering Service-Oriented Systems, (22-28)

Ginat D The baffling CS notions of "as-if" and "don't-care" Proceedings of the 41st ACM technical symposium on Computer science education, (385-389)

Allender E, Loui M and Regan K Reducibility and completeness Algorithms and theory of computation handbook, (23-23)

Allender E, Loui M and Regan K Complexity classes Algorithms and theory of computation handbook, (22-22)

Jiang T, Li M, Ravikumar B and Regan K Computability Algorithms and theory of computation handbook, (21-21)

Jiang T, Li M, Ravikumar B and Regan K Formal grammars and languages Algorithms and theory of computation handbook, (20-20)

Jiang T, Li M and Ravikumar B Basic notions in computational complexity Algorithms and theory of computation handbook, (19-19)

Cosmadakis S, Foustoucos E and Sidiropoulos A (2010). Undecidability and intractability results concerning datalog programs and their persistency numbers, ACM Transactions on Computational Logic, 11:2, (1-29), Online publication date: 1-Jan-2010.

Sifalakis M, Fry M and Hutchison D (2010). Event detection and correlation for network environments, IEEE Journal on Selected Areas in Communications, 28:1, (60-69), Online publication date: 1-Jan-2010.

Wehr S and Thiemann P On the Decidability of Subtyping with Bounded Existential Types Programming Languages and Systems, (111-127)

Braun M and Winter S (2009). Ad hoc solution of the multicommodity-flow-over-time problem, IEEE Transactions on Intelligent Transportation Systems, 10:4, (658-667), Online publication date: 1-Dec-2009.

Li Y (2009). Lattice-valued fuzzy Turing machines, Fuzzy Sets and Systems, 160:23, (3453-3474), Online publication date: 1-Dec-2009.

DAlessandro F, Intrigila B and Varricchio S (2009). The Parikh counting functions of sparse context-free languages are quasi-polynomials, Theoretical Computer Science, 410:47-49, (5158-5181), Online publication date: 1-Nov-2009.

Kao J, Rampersad N and Shallit J (2009). On NFAs where all states are final, initial, or both, Theoretical Computer Science, 410:47-49, (5010-5021), Online publication date: 1-Nov-2009.

De Felice C, Fici G and Zizza R (2009). A characterization of regular circular languages generated by marked splicing systems, Theoretical Computer Science, 410:47-49, (4937-4960), Online publication date: 1-Nov-2009.

Anderson T, Loftus J, Rampersad N, Santean N and Shallit J (2009). Detecting palindromes, patterns and borders in regular languages, Information and Computation, 207:11, (1096-1118), Online publication date: 1-Nov-2009.

Boullier P and Sagot B Parsing directed acyclic graphs with range concatenation grammars Proceedings of the 11th International Conference on Parsing Technologies, (254-265)

Nederhof M Weighted parsing of trees Proceedings of the 11th International Conference on Parsing Technologies, (13-24)

Vega J and Königsberg Z Modeling the game of Arimaa with linguistic geometry Proceedings of the 5th international conference on Computational Intelligence and Games, (379-386)

Jantke K Dramaturgical design of the narrative in digital games Proceedings of the 5th international conference on Computational Intelligence and Games, (88-95)

Kutrib M, Malcher A and Werlein L (2009). Regulated nondeterminism in pushdown automata, Theoretical Computer Science, 410:37, (3447-3460), Online publication date: 1-Sep-2009.

Mráz F, Otto F and Plátek M (2009). The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages, Theoretical Computer Science, 410:37, (3530-3538), Online publication date: 1-Sep-2009.

Salomaa K, Yu S and Zan J (2009). Deciding determinism of caterpillar expressions, Theoretical Computer Science, 410:37, (3438-3446), Online publication date: 1-Sep-2009.

Carpentieri M On multivariate genetic systems Proceedings of the 18th international conference on Fuzzy Systems, (35-40)

Hund R, Holz T and Freiling F Return-oriented rootkits Proceedings of the 18th conference on USENIX security symposium, (383-398)

James M, Shapiro A, Springer P and Zima H (2009). Adaptive Fault Tolerance for Scalable Cluster Computing in Space, International Journal of High Performance Computing Applications, 23:3, (227-241), Online publication date: 1-Aug-2009.

Shang Y, Lu X and Lu R (2009). Automata theory based on unsharp quantum logic†, Mathematical Structures in Computer Science, 19:4, (737-756), Online publication date: 1-Aug-2009.

Czeizler E, Czeizler E, Kari L and Salomaa K (2009). On the descriptional complexity of Watson-Crick automata, Theoretical Computer Science, 410:35, (3250-3260), Online publication date: 1-Aug-2009.

Qiu D and Yu S (2009). Hierarchy and equivalence of multi-letter quantum finite automata, Theoretical Computer Science, 410:30-32, (3006-3017), Online publication date: 1-Aug-2009.

Biegler F and Salomaa K (2009). On the synchronized derivation depth of context-free grammars, Theoretical Computer Science, 410:35, (3198-3208), Online publication date: 1-Aug-2009.

Ésik Z, Gao Y, Liu G and Yu S (2009). Estimation of state complexity of combined operations, Theoretical Computer Science, 410:35, (3272-3280), Online publication date: 1-Aug-2009.

Felfernig A, Friedrich G, Isak K, Shchekotykhin K, Teppan E and Jannach D (2009). Automated debugging of recommender user interface descriptions, Applied Intelligence, 31:1, (1-14), Online publication date: 1-Aug-2009.

Demaille A, Duret-Lutz A, Lesaint F, Lombardy S, Sakarovitch J and Terrones F An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008, (199-206)

Kasprzik A Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008, (98-109)

Armoni M and Ben-Ari M (2009). The concept of nondeterminism, ACM SIGCSE Bulletin, 41:2, (141-160), Online publication date: 25-Jun-2009.

Ibáñez J and Sánchez A (2009). Constructive reduction, ACM SIGCSE Bulletin, 41:2, (90-94), Online publication date: 25-Jun-2009.

Del-Moral-Hernandez E, Sandmann H and Araújo G Context dependent pattern recognition Proceedings of the 2009 international joint conference on Neural Networks, (3334-3341)

Shen Z, Kawashima H and Kitagawa H (2009). Efficient probabilistic event stream processing with lineage and Kleene-plus, International Journal of Communication Networks and Distributed Systems, 2:4, (355-374), Online publication date: 1-Jun-2009.

Han Y and Salomaa K (2009). State complexity of basic operations on suffix-free regular languages, Theoretical Computer Science, 410:27-29, (2537-2548), Online publication date: 1-Jun-2009.

Nishimura H and Yamakami T (2009). An application of quantum finite automata to interactive proof systems, Journal of Computer and System Sciences, 75:4, (255-269), Online publication date: 1-Jun-2009.

Alur R and Madhusudan P (2009). Adding nesting structure to words, Journal of the ACM, 56:3, (1-43), Online publication date: 1-May-2009.

Rampersad N, Santean N, Shallit J and Ravikumar B (2009). State complexity of unique rational operations, Theoretical Computer Science, 410:24-25, (2431-2441), Online publication date: 1-May-2009.

Pun A, Pun M and Rodríguez-Patón A (2009). On the Hopcroft's minimization technique for DFA and DFCA, Theoretical Computer Science, 410:24-25, (2424-2430), Online publication date: 1-May-2009.

Krieger D, Miller A, Rampersad N, Ravikumar B and Shallit J (2009). Decimations of languages and state complexity, Theoretical Computer Science, 410:24-25, (2401-2409), Online publication date: 1-May-2009.

Câmpeanu C and Santean N (2009). On the intersection of regex languages with regular languages, Theoretical Computer Science, 410:24-25, (2336-2344), Online publication date: 1-May-2009.

Mahmud J, Borodin Y, Ramakrishnan I and Ramakrishnan C Automated construction of web accessibility models from transaction click-streams Proceedings of the 18th international conference on World wide web, (871-880)

Fernau H (2009). Algorithms for learning regular expressions from positive data, Information and Computation, 207:4, (521-541), Online publication date: 1-Apr-2009.

Bonsangue M, Rutten J and Silva A A Kleene Theorem for Polynomial Coalgebras Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504, (122-136)

McMaster K, Rague B and Hadfield S (2009). Two mathematical gestalts for computer theory, ACM SIGCSE Bulletin, 41:1, (251-255), Online publication date: 4-Mar-2009.

McMaster K, Rague B and Hadfield S Two mathematical gestalts for computer theory Proceedings of the 40th ACM technical symposium on Computer science education, (251-255)

Jeon J, Shin K and Han H (2009). Abstracting access patterns of dynamic memory using regular expressions, ACM Transactions on Architecture and Code Optimization, 5:4, (1-28), Online publication date: 1-Mar-2009.

Bhateja P Grammar based asynchronous testing Proceedings of the 2nd India software engineering conference, (105-110)

Chakrabarti S and Sukumaran S Using spreadsheets for finite state modelling Proceedings of the 2nd India software engineering conference, (27-36)

Staines A A compact CPN representation for embedded and control systems fault diagnosis and recovery Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems, (78-83)

Jürgensen H and McQuillan I (2009). Homomorphisms preserving types of density, Acta Cybernetica, 19:2, (499-516), Online publication date: 1-Feb-2009.

Grahne G, Thomo A and Wadge W (2008). Preferential Regular Path Queries, Fundamenta Informaticae, 89:2-3, (259-288), Online publication date: 15-Jan-2009.

Benedikt M and Koch C (2009). XPath leashed, ACM Computing Surveys, 41:1, (1-54), Online publication date: 15-Jan-2009.

Kolman E and Margaliot M (2009). Extracting symbolic knowledge from recurrent neural networks---A fuzzy logic approach, Fuzzy Sets and Systems, 160:2, (145-161), Online publication date: 15-Jan-2009.

Pighizzini G (2009). Nondeterministic one-tape off-line turing machines and their time complexity, Journal of Automata, Languages and Combinatorics, 14:1, (107-124), Online publication date: 1-Jan-2009.

Ludermir T, Souto M and Oliveira W (2009). On a hybrid weightless neural system, International Journal of Bio-Inspired Computation, 1:1/2, (93-104), Online publication date: 1-Jan-2009.

Campana S, Spalazzi L and Spegni F XAL Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01, (862-868)

Casagrande A, Piazza C, Policriti A and Mishra B (2008). Inclusion dynamics hybrid automata, Information and Computation, 206:12, (1394-1424), Online publication date: 1-Dec-2008.

Becchi M and Crowley P Efficient regular expression evaluation Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, (50-59)

Dória T, Ciarlini A and Andreatta A A nondeterministic model for controlling the dramatization of interactive stories Proceedings of the 2nd ACM international workshop on Story representation, mechanism and context, (21-26)

Ghelli G, Colazzo D and Sartiani C Linear time membership in a class of regular expressions with interleaving and counting Proceedings of the 17th ACM conference on Information and knowledge management, (389-398)

do Nascimento A and Hara C A model for XML instance level integration Proceedings of the 23rd Brazilian symposium on Databases, (46-60)

Denis F and Esposito Y (2008). On Rational Stochastic Languages, Fundamenta Informaticae, 86:1,2, (41-77), Online publication date: 1-Oct-2008.

Smith R, Estan C, Jha S and Kong S (2008). Deflating the big bang, ACM SIGCOMM Computer Communication Review, 38:4, (207-218), Online publication date: 1-Oct-2008.

Leivant D (2008). Propositional Dynamic Logic with Program Quantifiers, Electronic Notes in Theoretical Computer Science (ENTCS), 218, (231-240), Online publication date: 1-Oct-2008.

Walkinshaw N and Bogdanov K Inferring Finite-State Models with Temporal Constraints Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering, (248-257)

Dwyer M, Diep M and Elbaum S Reducing the Cost of Path Property Monitoring Through Sampling Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering, (228-237)

Meredith P, Jin D, Chen F and Rosu G Efficient Monitoring of Parametric Context-Free Patterns Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering, (148-157)

Wocjan P, Janzing D and Decker T (2008). Measuring 4-local qubit observables could probabilistically solve PSPACE, Quantum Information & Computation, 8:8, (741-755), Online publication date: 1-Sep-2008.

Liu G, Martin-Vide C, Salomaa A and Yu S (2008). State complexity of basic language operations combined with reversal, Information and Computation, 206:9-10, (1178-1186), Online publication date: 1-Sep-2008.

Han Y and Wood D (2008). Generalizations of 1-deterministic regular languages, Information and Computation, 206:9-10, (1117-1125), Online publication date: 1-Sep-2008.

Di Lena P and Margara L (2008). Computational complexity of dynamical systems, Information and Computation, 206:9-10, (1104-1116), Online publication date: 1-Sep-2008.

Francez N and Kaminski M (2008). Commutation-augmented pregroup grammars and push-down automata with cancellation, Information and Computation, 206:9-10, (1018-1032), Online publication date: 1-Sep-2008.

Izadi M and Bonsangue M Recasting Constraint Automata into Büchi Automata Proceedings of the 5th international colloquium on Theoretical Aspects of Computing, (156-170)

Smith R, Estan C, Jha S and Kong S Deflating the big bang Proceedings of the ACM SIGCOMM 2008 conference on Data communication, (207-218)

Lopez A (2008). Statistical machine translation, ACM Computing Surveys, 40:3, (1-49), Online publication date: 1-Aug-2008.

Li L and Qiu D (2008). Determining the equivalence for one-way quantum finite automata, Theoretical Computer Science, 403:1, (42-51), Online publication date: 1-Aug-2008.

Viide J, Helin A, Laakso M, Pietikäinen P, Seppänen M, Halunen K, Puuperä R and Röning J Experiences with model inference assisted fuzzing Proceedings of the 2nd conference on USENIX Workshop on offensive technologies, (1-6)

Lamperti G and Zanella M Observation-Subsumption Checking in Similarity-Based Diagnosis of Discrete-Event Systems Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (204-208)

Moshe Y (2008). On some questions regarding k -regular and k -context-free sequences, Theoretical Computer Science, 400:1-3, (62-69), Online publication date: 20-Jun-2008.

He H and Singh A Graphs-at-a-time Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (405-418)

Majumder A, Rastogi R and Vanama S Scalable regular expression matching on data streams Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (161-172)

Agrawal J, Diao Y, Gyllstrom D and Immerman N Efficient pattern matching over event streams Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (147-160)

Godefroid P, Kiezun A and Levin M Grammar-based whitebox fuzzing Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, (206-215)

Rieck K and Laskov P (2008). Linear-Time Computation of Similarity Measures for Sequential Data, The Journal of Machine Learning Research, 9, (23-48), Online publication date: 1-Jun-2008.

Bedregal B (2007). Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages, Fundamenta Informaticae, 81:4, (367-377), Online publication date: 1-Jun-2008.

Brabrand C, Møller A and Schwartzbach M (2008). Dual syntax for XML languages, Information Systems, 33:4-5, (385-406), Online publication date: 1-Jun-2008.

Debois S (2008). Imperative-program transformation by instrumented-interpreter specialization, Higher-Order and Symbolic Computation, 21:1-2, (37-58), Online publication date: 1-Jun-2008.

Godefroid P, Kiezun A and Levin M (2008). Grammar-based whitebox fuzzing, ACM SIGPLAN Notices, 43:6, (206-215), Online publication date: 30-May-2008.

Carroll J and Lee T A genetic algorithm for segmentation and information retrieval of SEC regulatory filings Proceedings of the 2008 international conference on Digital government research, (44-52)

Jain S and Kinber E (2008). Learning and extending sublanguages, Theoretical Computer Science, 397:1-3, (233-246), Online publication date: 10-May-2008.

Jarvis J and Lucas J (2008). Understanding the Universal Turing Machine, Journal of Computing Sciences in Colleges, 23:5, (180-188), Online publication date: 1-May-2008.

Benedikt M, Fan W and Geerts F (2008). XPath satisfiability in the presence of DTDs, Journal of the ACM, 55:2, (1-79), Online publication date: 1-May-2008.

Bex G, Gelade W, Neven F and Vansummeren S Learning deterministic regular expressions for the inference of schemas from XML data Proceedings of the 17th international conference on World Wide Web, (825-834)

Grahne G, Thomo A and Wadge W (2008). Preferential Regular Path Queries, Fundamenta Informaticae, 89:2-3, (259-288), Online publication date: 1-Apr-2008.

Denis F and Esposito Y (2008). On Rational Stochastic Languages, Fundamenta Informaticae, 86:1,2, (41-77), Online publication date: 1-Apr-2008.

D'Alessandro F and Varricchio S (2008). On the growth of context-free languages, Journal of Automata, Languages and Combinatorics, 13:2, (95-104), Online publication date: 1-Apr-2008.

Bergstra J and Middelburg C (2008). Maurer computers for pipelined instruction processing†, Mathematical Structures in Computer Science, 18:2, (373-409), Online publication date: 1-Apr-2008.

Scott E (2008). SPPF-Style Parsing From Earley Recognisers, Electronic Notes in Theoretical Computer Science (ENTCS), 203:2, (53-67), Online publication date: 1-Apr-2008.

Farzan A, Chen Y, Clarke E, Tsay Y and Wang B Extending automated compositional verification to the full class of omega-regular languages Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems, (2-17)

Lécué F, Delteil A and Léger A Towards the composition of stateful and independent semantic web services Proceedings of the 2008 ACM symposium on Applied computing, (2279-2285)

Collignon B, Vanderdonckt J and Calvary G An intelligent editor for multi-presentation user interfaces Proceedings of the 2008 ACM symposium on Applied computing, (1634-1641)

Polycarpou I, Pasztor A and Adjouadi M A conceptual approach to teaching induction for computer science Proceedings of the 39th SIGCSE technical symposium on Computer science education, (9-13)

Bombieri N, Deganello N and Fummi F Integrating RTL IPs into TLM designs through automatic transactor generation Proceedings of the conference on Design, automation and test in Europe, (15-20)

Chalopin J and Métivier Y (2007). An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm, Fundamenta Informaticae, 80:1-3, (221-246), Online publication date: 1-Mar-2008.

Fan W and Bohannon P (2008). Information preserving XML schema embedding, ACM Transactions on Database Systems, 33:1, (1-44), Online publication date: 1-Mar-2008.

Yevtushenko N, Villa T, Brayton R, Petrenko A and Sangiovanni-Vincentelli A (2008). Compositionally Progressive Solutions of Synchronous FSM Equations, Discrete Event Dynamic Systems, 18:1, (51-89), Online publication date: 1-Mar-2008.

Polycarpou I, Pasztor A and Adjouadi M (2008). A conceptual approach to teaching induction for computer science, ACM SIGCSE Bulletin, 40:1, (9-13), Online publication date: 29-Feb-2008.

Li Y (2008). Approximation and robustness of fuzzy finite automata, International Journal of Approximate Reasoning, 47:2, (247-257), Online publication date: 1-Feb-2008.

Chaudhuri S (2008). Subcubic algorithms for recursive state machines, ACM SIGPLAN Notices, 43:1, (159-169), Online publication date: 14-Jan-2008.

Chaudhuri S Subcubic algorithms for recursive state machines Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (159-169)

Bouganim L, Ngoc F and Pucheral P (2008). Dynamic access-control policies on XML encrypted data, ACM Transactions on Information and System Security, 10:4, (1-37), Online publication date: 1-Jan-2008.

Martins A, Pinto H and Oliveira A (2008). USING GRAMMATICAL INFERENCE TECHNIQUES TO LEARN ONTOLOGIES THAT DESCRIBE THE STRUCTURE OF DOMAIN INSTANCES, Applied Artificial Intelligence, 22:1-2, (139-167), Online publication date: 1-Jan-2008.

Dupont P, Lambeau B, Damas C and van Lamsweerde A (2008). THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION, Applied Artificial Intelligence, 22:1-2, (77-115), Online publication date: 1-Jan-2008.

Hölscher K, Klempien-Hinrichs R and Knirsch P (2008). Undecidable Control Conditions in Graph Transformation Units, Electronic Notes in Theoretical Computer Science (ENTCS), 195, (95-111), Online publication date: 1-Jan-2008.

Pozdnyakov V (2008). A note on occurrence of gapped patterns in i.i.d. sequences, Discrete Applied Mathematics, 156:1, (93-102), Online publication date: 1-Jan-2008.

Bradford P Quickest path distances on context-free labeled graphs Proceedings of the 6th WSEAS international conference on Information security and privacy, (22-29)

Becchi M and Crowley P A hybrid finite automaton for practical deep packet inspection Proceedings of the 2007 ACM CoNEXT conference, (1-12)

Kumar S, Chandrasekaran B, Turner J and Varghese G Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems, (155-164)

Becchi M and Crowley P An improved algorithm to accelerate regular expression evaluation Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems, (145-154)

Bedregal B (2007). Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages, Fundamenta Informaticae, 81:4, (367-377), Online publication date: 1-Dec-2007.

Blanco Arbe J, Ortega A and Mártinez-Conde J (2007). Formal languages through web forms and regular expressions, ACM SIGCSE Bulletin, 39:4, (100-104), Online publication date: 1-Dec-2007.

Lin T and Giles C (2007). Group-Linking Method, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:12, (2916-2929), Online publication date: 1-Dec-2007.

Arslan A (2007). Regular expression constrained sequence alignment, Journal of Discrete Algorithms, 5:4, (647-661), Online publication date: 1-Dec-2007.

Ebeid N and Hasan M (2007). On Τ-adic representations of integers, Designs, Codes and Cryptography, 45:3, (271-296), Online publication date: 1-Dec-2007.

Singhoff F and Plantec A (2007). AADL modeling and analysis of hierarchical schedulers, ACM SIGAda Ada Letters, XXVII:3, (41-50), Online publication date: 17-Nov-2007.

Tamashiro M, Thomo A and Venkatesh S Towards practically feasible answering of regular path queries in lav data integration Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, (381-390)

Lauenroth K and Pohl K Towards automated consistency checks of product line requirements specifications Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering, (373-376)

Zaraket F, Aziz A and Khurshid S Sequential circuits for program analysis Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering, (114-123)

Singhoff F and Plantec A AADL modeling and analysis of hierarchical schedulers Proceedings of the 2007 ACM international conference on SIGAda annual international conference, (41-50)

Geffert V (2007). Magic numbers in the state hierarchy of finite automata, Information and Computation, 205:11, (1652-1670), Online publication date: 1-Nov-2007.

Troncoso-Pastoriza J, Katzenbeisser S and Celik M Privacy preserving error resilient dna searching through oblivious automata Proceedings of the 14th ACM conference on Computer and communications security, (519-528)

Bravenboer M, Dolstra E and Visser E Preventing injection attacks with syntax embeddings Proceedings of the 6th international conference on Generative programming and component engineering, (3-12)

Kutrib M and Malcher A (2007). Finite turns and the regular closure of linear context-free languages, Discrete Applied Mathematics, 155:16, (2152-2164), Online publication date: 1-Oct-2007.

Ramanathan R, Basu P and Krishnan R Towards a formalism for routing in challenged networks Proceedings of the second ACM workshop on Challenged networks, (3-10)

Acharya M, Xie T, Pei J and Xu J Mining API patterns as partial orders from source code Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, (25-34)

Salomaa A, Salomaa K and Yu S (2007). State complexity of combined operations, Theoretical Computer Science, 383:2-3, (140-152), Online publication date: 3-Sep-2007.

Hemaspaandra L and Thakur M (2007). Query-monotonic Turing reductions, Theoretical Computer Science, 383:2-3, (153-186), Online publication date: 3-Sep-2007.

Eberbach E (2007). The $-calculus process algebra for problem solving, Theoretical Computer Science, 383:2-3, (200-243), Online publication date: 3-Sep-2007.

Burgin M (2007). Algorithmic complexity as a criterion of unsolvability, Theoretical Computer Science, 383:2-3, (244-259), Online publication date: 3-Sep-2007.

Amadio R (2007). A synchronous π-calculus, Information and Computation, 205:9, (1470-1490), Online publication date: 1-Sep-2007.

Pugin C and Ingold R Combination of transformation and schema languages described by a complete formal semantics Proceedings of the 2007 ACM symposium on Document engineering, (222-224)

Triebsees T and Borghoff U Towards automatic document migration Proceedings of the 2007 ACM symposium on Document engineering, (209-218)

Chen X, Mao Z and van der Merwe J Towards automated network management Proceedings of the 2007 SIGCOMM workshop on Internet network management, (242-247)

Arulanandham J Unconventional "stateless" turing-like machines Proceedings of the 6th international conference on Unconventional Computation, (55-61)

Sunckel B (2007). On Metalinear CD Grammar Systems, Fundamenta Informaticae, 76:3, (383-397), Online publication date: 1-Aug-2007.

Even-Dar E, Kesselman A and Mansour Y (2007). Convergence time to Nash equilibrium in load balancing, ACM Transactions on Algorithms, 3:3, (32-es), Online publication date: 1-Aug-2007.

Corazza A and Satta G (2007). Probabilistic Context-Free Grammars Estimated from Infinite Distributions, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:8, (1379-1393), Online publication date: 1-Aug-2007.

Garibay O and Wu A Analyzing the effects of module encapsulation on search space bias Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1234-1241)

Shayani H and Bentley P A more bio-plausible approach to the evolutionary inference of finite state machines Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, (2937-2944)

Tamm H On transition minimality of bideterministic automata Proceedings of the 11th international conference on Developments in language theory, (411-421)

Loos R and Ogihara M Complexity theory for splicing systems Proceedings of the 11th international conference on Developments in language theory, (300-311)

Sasahara K and Ikegami T (2007). Evolution of Birdsong Syntax by Interjection Communication, Artificial Life, 13:3, (259-277), Online publication date: 1-Jul-2007.

Xing H (2007). Fuzzy pushdown automata, Fuzzy Sets and Systems, 158:13, (1437-1449), Online publication date: 1-Jul-2007.

Xing H, Qiu D, Liu F and Fan Z (2007). Equivalence in automata theory based on complete residuated lattice-valued logic, Fuzzy Sets and Systems, 158:13, (1407-1422), Online publication date: 1-Jul-2007.

Stallmann M, Balik S, Rodman R, Bahram S, Grace M and High S (2007). ProofChecker, ACM SIGCSE Bulletin, 39:3, (48-52), Online publication date: 25-Jun-2007.

Stallmann M, Balik S, Rodman R, Bahram S, Grace M and High S ProofChecker Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education, (48-52)

Boullier P and Sagot B Are very large context-free grammars tractable? Proceedings of the 10th International Conference on Parsing Technologies, (94-105)

Baskiotis N and Sebag M Structural statistical software testing with active learning in a graph Proceedings of the 17th international conference on Inductive logic programming, (49-62)

Harel D Statecharts in the making Proceedings of the third ACM SIGPLAN conference on History of programming languages, (5-1-5-43)

Martens W and Niehren J (2007). On the minimization of XML Schemas and tree automata for unranked trees, Journal of Computer and System Sciences, 73:4, (550-583), Online publication date: 1-Jun-2007.

Zaraket F, Aziz A and Khurshid S Sequential Circuits for Relational Analysis Proceedings of the 29th international conference on Software Engineering, (13-22)

Kumar V, Madhusudan P and Viswanathan M Visibly pushdown automata for streaming XML Proceedings of the 16th international conference on World Wide Web, (1053-1062)

Becchi M and Cadambi S Memory-Efficient Regular Expression Search Using State Merging Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (1064-1072)

Serrano J and Ossowski S (2007). A compositional framework for the specification of interaction protocols in multiagent organizations, Web Intelligence and Agent Systems, 5:2, (197-214), Online publication date: 1-Apr-2007.

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.

Raghavachari M and Shmueli O (2007). Efficient Revalidation of XML Documents, IEEE Transactions on Knowledge and Data Engineering, 19:4, (554-567), Online publication date: 1-Apr-2007.

Roşu G An effective algorithm for the membership problem for extended regular expressions Proceedings of the 10th international conference on Foundations of software science and computational structures, (332-345)

Kupriyanov A, Hannig F, Kissler D, Teich J, Lallet J, Sentieys O and Pillement S Modeling of interconnection networks in massively parallel processor architectures Proceedings of the 20th international conference on Architecture of computing systems, (268-282)

Sunckel B (2007). On Metalinear CD Grammar Systems, Fundamenta Informaticae, 76:3, (383-397), Online publication date: 1-Mar-2007.

Almeida J and Zeitoun M (2007). An automata-theoretic approach to the word problem for ω -terms over R, Theoretical Computer Science, 370:1-3, (131-169), Online publication date: 1-Feb-2007.

Ravikumar B and Santean N Deterministic Simulation of a NFA with k---Symbol Lookahead Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (488-497)

Baskiotis N, Sebag M, Gaudel M and Gouraud S A machine learning approach for statistical software testing Proceedings of the 20th international joint conference on Artifical intelligence, (2274-2279)

Chalopin J and Métivier Y (2007). An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm, Fundamenta Informaticae, 80:1-3, (221-246), Online publication date: 1-Jan-2007.

Frost R (2006). Realization of natural language interfaces using lazy functional programming, ACM Computing Surveys, 38:4, (11-es), Online publication date: 25-Dec-2006.

Hoffmann M and Thomas R (2006). A geometric characterization of automatic semigroups, Theoretical Computer Science, 369:1, (300-313), Online publication date: 15-Dec-2006.

Bordihn H, Fernau H, Holzer M, Manca V and Martín-Vide C (2006). Iterated sequential transducers as language generating devices, Theoretical Computer Science, 369:1, (67-81), Online publication date: 15-Dec-2006.

Yu F, Chen Z, Diao Y, Lakshman T and Katz R Fast and memory-efficient regular expression matching for deep packet inspection Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems, (93-102)

Gonzalez H, Han J and Li X Mining compressed commodity workflows from massive RFID data sets Proceedings of the 15th ACM international conference on Information and knowledge management, (162-171)

Damas C, Lambeau B and van Lamsweerde A Scenarios, goals, and state machines Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, (197-207)

Mason J, Watkins K, Eisner J and Stubblefield A A natural language approach to automated cryptanalysis of two-time pads Proceedings of the 13th ACM conference on Computer and communications security, (235-244)

El-Fakih K, Yevtushenko N, Buffalov S and Bochmann G (2006). Progressive solutions to a parallel automata equation, Theoretical Computer Science, 362:1, (17-32), Online publication date: 11-Oct-2006.

García P and Ruiz J (2006). Learning in varieties of the form V*LI from positive data, Theoretical Computer Science, 362:1, (100-114), Online publication date: 11-Oct-2006.

Domaratzki M, Rozenberg G and Salomaa K (2006). Interpreted Trajectories, Fundamenta Informaticae, 73:1,2, (81-97), Online publication date: 1-Oct-2006.

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.

Nakamura K Incremental learning of context free grammars by bridging rule generation and search for semi-optimum rule sets Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (72-83)

Klunder B (2006). Star-Connected Flat Languages and Automata, Fundamenta Informaticae, 72:1-3, (235-243), Online publication date: 15-Sep-2006.

Balan M and Jürgensen H Peptide computing Proceedings of the 5th international conference on Unconventional Computation, (57-71)

Bex G, Neven F, Schwentick T and Tuyls K Inference of concise DTDs from XML data Proceedings of the 32nd international conference on Very large data bases, (115-126)

Messerschmidt H, Mráz F, Otto F and Plátek M Correctness preservation and complexity of simple RL-automata Proceedings of the 11th international conference on Implementation and Application of Automata, (162-172)

Baclet M and Pagetti C Around hopcroft’s algorithm Proceedings of the 11th international conference on Implementation and Application of Automata, (114-125)

Alur R, Chaudhuri S and Madhusudan P Languages of nested trees Proceedings of the 18th international conference on Computer Aided Verification, (329-342)

Armoni R, Korchemny D, Tiemeyer A, Vardi M and Zbar Y Deterministic dynamic monitors for linear-time assertions Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification, (163-177)

Hendrix J, Ohsaki H and Viswanathan M Propositional tree automata Proceedings of the 17th international conference on Term Rewriting and Applications, (50-65)

Buszkowski W On the complexity of the equational theory of relational action algebras Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra, (106-119)

Frisco P Infinite hierarchies of conformon-p systems Proceedings of the 7th international conference on Membrane Computing, (395-408)

Lin S Reasoning about discrete event sources Proceedings of the 21st national conference on Artificial intelligence - Volume 1, (868-873)

Nagy B Left-most derivation and shadow-pushdown automata for context-sensitive languages Proceedings of the 10th WSEAS international conference on Computers, (1015-1020)

Felfernig A Diagnosing faulty transitions in recommender user interface descriptions Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems, (869-878)

Brodie B, Taylor D and Cytron R A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching Proceedings of the 33rd annual international symposium on Computer Architecture, (191-202)

Canal C, Poizat P and Salaün G Synchronizing behavioural mismatch in software composition Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (63-77)

Heinz J Learning quantity insensitive stress systems via local inference Proceedings of the Eighth Meeting of the ACL Special Interest Group on Computational Phonology and Morphology, (21-30)

Messerschmidt H and Otto F On nonforgetting restarting automata that are deterministic and/or monotone Proceedings of the First international computer science conference on Theory and Applications, (247-258)

Nederhof M and Satta G Estimation of consistent probabilistic context-free grammars Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, (343-350)

Corazza A and Satta G Cross-entropy and estimation of probabilistic context-free grammars Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, (335-342)

Touati S and Barthou D On the decidability of phase ordering problem in optimizing compilation Proceedings of the 3rd conference on Computing frontiers, (147-156)

Flesca S, Furfaro F and Greco S (2006). Weighted path queries on semistructured databases, Information and Computation, 204:5, (679-696), Online publication date: 1-May-2006.

Brodie B, Taylor D and Cytron R (2006). A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching, ACM SIGARCH Computer Architecture News, 34:2, (191-202), Online publication date: 1-May-2006.

Domaratzki M, Rozenberg G and Salomaa K (2006). Interpreted Trajectories, Fundamenta Informaticae, 73:1,2, (81-97), Online publication date: 1-Apr-2006.

Agrawal M, Stephan F, Thiagarajan P and Yang S Behavioural approximations for restricted linear differential hybrid automata Proceedings of the 9th international conference on Hybrid Systems: computation and control, (4-18)

Emmi M and Majumdar R Decision problems for the verification of real-time software Proceedings of the 9th international conference on Hybrid Systems: computation and control, (200-211)

Stefanescu D and Thomo A Enhanced regular path queries on semistructured databases Proceedings of the 2006 international conference on Current Trends in Database Technology, (700-711)

Klein J, Hélouët L and Jézéquel J Semantic-based weaving of scenarios Proceedings of the 5th international conference on Aspect-oriented software development, (27-38)

Felfernig A and Shchekotykhin K Debugging user interface descriptions of knowledge-based recommender applications Proceedings of the 11th international conference on Intelligent user interfaces, (234-241)

Klunder B (2006). Star-Connected Flat Languages and Automata, Fundamenta Informaticae, 72:1-3, (235-243), Online publication date: 1-Jan-2006.

Sunckel B (2006). On the descriptional complexity of external hybrid cooperating distributed grammar systems, Journal of Automata, Languages and Combinatorics, 11:4, (435-447), Online publication date: 1-Jan-2006.

Ciobanu G, Paun G and Stefanescu G (2006). P Transducers, New Generation Computing, 24:1, (1-28), Online publication date: 1-Jan-2006.

Damas C, Lambeau B, Dupont P and van Lamsweerde A (2005). Generating Annotated Behavior Models from End-User Scenarios, IEEE Transactions on Software Engineering, 31:12, (1056-1073), Online publication date: 1-Dec-2005.

Mouza C and Rigaux P (2005). Mobility Patterns, Geoinformatica, 9:4, (297-319), Online publication date: 1-Dec-2005.

Ben-David S, Fisman D and Ruah S The safety simple subset Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing, (14-29)

Cai J and Zhu H (2005). Progress in computational complexity theory, Journal of Computer Science and Technology, 20:6, (735-750), Online publication date: 1-Nov-2005.

Wombacher A, Wieringa R, Jonker W, Knežević P and Pokraev S Requirements for secure logging of decentralized cross-organizational workflow executions Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems, (526-536)

Ng Y, Ono H and Shinohara T Measuring over-generalization in the minimal multiple generalizations of biosequences Proceedings of the 8th international conference on Discovery Science, (176-188)

Bustan D, Flaisher A, Grumberg O, Kupferman O and Vardi M Regular vacuity Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (191-206)

Sánchez C, Slanina M, Sipma H and Manna Z Expressive completeness of an event-pattern reactive programming language Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (529-532)

Berger S, Coquery E, Drabent W and Wilk A Descriptive typing rules for xcerpt Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning, (85-100)

Ochoa C, Puebla G and Hermenegildo M Removing superfluous versions in polyvariant specialization of prolog programs Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation, (80-97)

Wermelinger M and Dias A (2005). A prolog toolkit for formal languages and automata, ACM SIGCSE Bulletin, 37:3, (330-334), Online publication date: 1-Sep-2005.

Bhadra J, Martin A and Abraham J (2005). A formal framework for verification of embedded custom memories of the Motorola MPC7450 microprocessor, Formal Methods in System Design, 27:1-2, (67-112), Online publication date: 1-Sep-2005.

Komenda J and Schuppen J (2005). Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction, Discrete Event Dynamic Systems, 15:3, (257-315), Online publication date: 1-Sep-2005.

Baldoni M, Baroglio C, Martelli A, Patti V and Schifanella C Verifying the conformance of web services to global interaction protocols Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes, (257-271)

Cristau J, Löding C and Thomas W Deterministic automata on unranked trees Proceedings of the 15th international conference on Fundamentals of Computation Theory, (68-79)

Holzer M and Otto F Shrinking multi-pushdown automata Proceedings of the 15th international conference on Fundamentals of Computation Theory, (305-316)

Iwamoto C, Nakashiba Y, Morita K and Imai K Translational lemmas for alternating TMs and PRAMs Proceedings of the 15th international conference on Fundamentals of Computation Theory, (137-148)

Eisner C, Fisman D and Havlicek J A topological characterization of weakness Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, (1-8)

Abdulla P, Deneux J, Ouaknine J and Worrell J Decidability and complexity results for timed automata via channel machines Proceedings of the 32nd international conference on Automata, Languages and Programming, (1089-1101)

Jurdziński T, Mráz F, Otto F and Plátek M Monotone deterministic RL-Automata don't need auxiliary symbols Proceedings of the 9th international conference on Developments in Language Theory, (284-295)

Geffert V, Mereghetti C and Pighizzini G Complementing two-way finite automata Proceedings of the 9th international conference on Developments in Language Theory, (260-271)

Sakakibara Y (2005). Grammatical Inference in Bioinformatics, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:7, (1051-1062), Online publication date: 1-Jul-2005.

Wermelinger M and Dias A A prolog toolkit for formal languages and automata Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education, (330-334)

Baldoni M, Baroglio C, Martelli A and Patti V Verification of protocol conformance and agent interoperability Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems, (265-283)

Carlucci L, Jain S, Kinber E and Stephan F Variations on u-shaped learning Proceedings of the 18th annual conference on Learning Theory, (382-397)

Soricut R and Marcu D Towards developing generation algorithms for text-to-text applications Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, (66-74)

Sanders R, Bræk R, von Bochmann G and Amyot D Service discovery and component reuse with semantic interfaces Proceedings of the 12th international conference on Model Driven, (85-102)

Arslan A Regular expression constrained sequence alignment Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (322-333)

Elder M (2005). A context-free and a 1-counter geodesic language for a Baumslag-Solitar group, Theoretical Computer Science, 339:2, (344-371), Online publication date: 12-Jun-2005.

Armoni R, Egorov S, Fraer R, Korchemny D and Vardi M Efficient LTL compilation for SAT-based model checking Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (877-884)

Kersting K An Inductive Logic Programming Approach to Statistical Relational Learning Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning, (1-228)

Karvi T, Tienari M and Kaivola R (2005). Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics, Formal Methods in System Design, 26:3, (293-317), Online publication date: 1-May-2005.

Leuschel M and Turner E Visualising larger state spaces in ProB Proceedings of the 4th international conference on Formal Specification and Development in Z and B, (6-23)

Ellul K, Krawetz B, Shallit J and Wang M (2005). Regular expressions, Journal of Automata, Languages and Combinatorics, 10:4, (407-437), Online publication date: 1-Apr-2005.

Roşu G and Havelund K (2005). Rewriting-Based Techniques for Runtime Verification, Automated Software Engineering, 12:2, (151-197), Online publication date: 1-Apr-2005.

Francel M and John D Constructing an even grammar from a 2-element sample Proceedings of the 43rd annual Southeast regional conference - Volume 1, (69-74)

Stefanescu D, Thomo A and Thomo L Distributed evaluation of generalized path queries Proceedings of the 2005 ACM symposium on Applied computing, (610-616)

Del Vecchio D and Murray R Existence of cascade discrete-continuous state estimators for systems on a partial order Proceedings of the 8th international conference on Hybrid Systems: computation and control, (226-241)

Jaeger E, Francez N and Wintner S (2005). Unification Grammars and Off-Line Parsability, Journal of Logic, Language and Information, 14:2, (199-234), Online publication date: 1-Mar-2005.

Wolff K and Yameogo W Turing machine representation in temporal concept analysis Proceedings of the Third international conference on Formal Concept Analysis, (360-374)

Fiedler P Formal description of interoperability Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation, (1-4)

Klunder B, Ochmański E and Stawikowska K (2005). On Star-Connected Flat Languages, Fundamenta Informaticae, 67:1-3, (93-105), Online publication date: 1-Feb-2005.

Calvanese D, De Giacomo G, Lenzerini M and Vardi M View-based query processing Proceedings of the 10th international conference on Database Theory, (321-336)

Klunder B, Ochmański E and Stawikowska K (2005). On Star-Connected Flat Languages, Fundamenta Informaticae, 67:1-3, (93-105), Online publication date: 1-Jan-2005.

Kappes M (2005). On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars, Fundamenta Informaticae, 64:1-4, (229-239), Online publication date: 1-Jan-2005.

Cavaliere M and Sburlan D (2005). Time and Synchronization in Membrane Systems, Fundamenta Informaticae, 64:1-4, (65-77), Online publication date: 1-Jan-2005.

Lutz C, Areces C, Horrocks I and Sattler U (2005). Keys, nominals, and concrete domains, Journal of Artificial Intelligence Research, 23:1, (667-726), Online publication date: 1-Jan-2005.

Bordihn H, Holzer M and Kutrib M Input reversals and iterated pushdown automata Proceedings of the 8th international conference on Developments in Language Theory, (102-113)

Altuntas B and Wysk R A framework for adaptive synchronization of distributed simulations Proceedings of the 36th conference on Winter simulation, (371-377)

Domaratzki M (2004). Trajectory-Based Embedding Relations, Fundamenta Informaticae, 59:4, (349-363), Online publication date: 1-Dec-2004.

Hawkins W and Healy C (2004). Introducing practical applications into a computational theory class, Journal of Computing Sciences in Colleges, 20:2, (219-225), Online publication date: 1-Dec-2004.

Shen X, Zhong Y and Ding C (2004). Locality phase prediction, ACM SIGOPS Operating Systems Review, 38:5, (165-176), Online publication date: 1-Dec-2004.

Shen X, Zhong Y and Ding C (2004). Locality phase prediction, ACM SIGARCH Computer Architecture News, 32:5, (165-176), Online publication date: 1-Dec-2004.

Krishna S and Paun A (2004). Results on catalytic and evolution-communication P systems, New Generation Computing, 22:4, (377-394), Online publication date: 1-Dec-2004.

Gerede Ç, Hull R, Ibarra O and Su J Automated composition of e-services Proceedings of the 2nd international conference on Service oriented computing, (252-262)

Hore B, Hacigumus H, Iyer B and Mehrotra S Indexing text data under space constraints Proceedings of the thirteenth ACM international conference on Information and knowledge management, (198-207)

Shen X, Zhong Y and Ding C (2004). Locality phase prediction, ACM SIGPLAN Notices, 39:11, (165-176), Online publication date: 1-Nov-2004.

Shen X, Zhong Y and Ding C Locality phase prediction Proceedings of the 11th international conference on Architectural support for programming languages and operating systems, (165-176)

Cortese P, Di Battista G, Patrignani M and Pizzonia M Clustering cycles into cycles of clusters Proceedings of the 12th international conference on Graph Drawing, (100-110)

Baldoni M, Baroglio C, Martelli A, Patti V and Schifanella C Verifying protocol conformance for logic-based communicating agents Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems, (196-212)

Karhumäki J Finite sets of words and computing Proceedings of the 4th international conference on Machines, Computations, and Universality, (36-49)

Krishnan P Decomposing controllers into non-conflicting distributed controllers Proceedings of the First international conference on Theoretical Aspects of Computing, (511-526)

Borchardt B (2004). A pumping lemma and decidability problems for recognizable tree series, Acta Cybernetica, 16:4, (509-544), Online publication date: 1-Sep-2004.

Kerren A (2004). Generation as method for explorative learning in computer science education, ACM SIGCSE Bulletin, 36:3, (77-81), Online publication date: 1-Sep-2004.

Llorens M and Oliver J (2004). Structural and Dynamic Changes in Concurrent Systems, IEEE Transactions on Computers, 53:9, (1147-1158), Online publication date: 1-Sep-2004.

Bouganim L, Ngoc F and Pucheral P Client-based access control management for XML documents Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (84-95)

Champarnaud J, Nicart F and Ziadi D Computing the follow automaton of an expression Proceedings of the 9th international conference on Implementation and Application of Automata, (90-101)

Bordihn H, Holzer M and Kutrib M Some non-semi-decidability problems for linear and deterministic context-free languages Proceedings of the 9th international conference on Implementation and Application of Automata, (68-79)

Krawetz B, Lawrence J and Shallit J State complexity and the monoid of transformations of a finite set Proceedings of the 9th international conference on Implementation and Application of Automata, (213-224)

John S Minimal unambiguous εNFA Proceedings of the 9th international conference on Implementation and Application of Automata, (190-201)

Melamed I, Satta G and Wellington B Generalized multitext grammars Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (661-es)

Kappes M (2004). On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars, Fundamenta Informaticae, 64:1-4, (229-239), Online publication date: 1-Jul-2004.

Cavaliere M and Sburlan D (2004). Time and Synchronization in Membrane Systems, Fundamenta Informaticae, 64:1-4, (65-77), Online publication date: 1-Jul-2004.

Kerren A Generation as method for explorative learning in computer science education Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, (77-81)

Núñez M, Rodríguez I and Rubio F A formal framework to reduce communications in communication systems Proceedings of the 4th international conference on Innovative Internet Community Systems, (69-80)

Domaratzki M (2004). Deletion along trajectories, Theoretical Computer Science, 320:2-3, (293-313), Online publication date: 14-Jun-2004.

Hull R and Su J Tools for design of composite Web services Proceedings of the 2004 ACM SIGMOD international conference on Management of data, (958-961)

Câmpeanu C and Păun A Computing beyond the turing limit using the h systems Proceedings of the 10th international conference on DNA computing, (24-34)

Francel M and John D An algorithm for constructing an even grammar from a language sample Proceedings of the 42nd annual Southeast regional conference, (240-245)

Tabuada P, Pappas G and Lima P (2004). Compositional Abstractions of Hybrid Control Systems, Discrete Event Dynamic Systems, 14:2, (203-238), Online publication date: 1-Apr-2004.

Su R and Wonham W (2004). Supervisor Reduction for Discrete-Event Systems, Discrete Event Dynamic Systems, 14:1, (31-53), Online publication date: 1-Jan-2004.

Andronescu M, Dees D, Slaybaugh L, Zhao Y, Condon A, Cohen B and Skiena S (2003). Algorithms for testing that sets of DNA words concatenate without secondary structure, Natural Computing: an international journal, 2:4, (391-415), Online publication date: 2-Dec-2003.

Bailey M and Davidson J (2003). Automatic Detection and Diagnosis of Faults in Generated Code for Procedure Calls, IEEE Transactions on Software Engineering, 29:11, (1031-1042), Online publication date: 1-Nov-2003.

Hosoya H and Pierce B (2003). Regular expression pattern matching for XML, Journal of Functional Programming, 13:6, (961-1004), Online publication date: 1-Nov-2003.

Sommer R and Paxson V Enhancing byte-level network intrusion detection signatures with context Proceedings of the 10th ACM conference on Computer and communications security, (262-271)

Murata M, Tozawa A, Kudo M and Hada S XML access control using static analysis Proceedings of the 10th ACM conference on Computer and communications security, (73-84)

Giannakopoulou D and Magee J (2003). Fluent model checking for event-based systems, ACM SIGSOFT Software Engineering Notes, 28:5, (257-266), Online publication date: 1-Sep-2003.

Giannakopoulou D and Magee J Fluent model checking for event-based systems Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, (257-266)

Domaratzki M (2003). Trajectory-based embedding relations, Fundamenta Informaticae, 59:4, (349-363), Online publication date: 1-Aug-2003.

Hosoya H and Murata M Boolean operations for attribute-element constraints Proceedings of the 8th international conference on Implementation and application of automata, (201-212)

Xie G, Li C and Dang Z New complexity results for some linear counting problems using minimal solutions to linear diophantine equations Proceedings of the 8th international conference on Implementation and application of automata, (163-175)

Lombardy S, Poss R, Régis-Gianas Y and Sakarovitch J Introducing VAUCANSON Proceedings of the 8th international conference on Implementation and application of automata, (96-107)

Tamm H and Ukkonen E Bideterministic automata and minimal representations of regular languages Proceedings of the 8th international conference on Implementation and application of automata, (61-71)

Karhumäki J Automata on words Proceedings of the 8th international conference on Implementation and application of automata, (3-11)

Malcher A Minimizing finite automata is computationally hard Proceedings of the 7th international conference on Developments in language theory, (386-397)

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)

Giammarresi D Computing languages by (Bounded) local sets Proceedings of the 7th international conference on Developments in language theory, (304-315)

Otto F Restarting automata and their relations to the Chomsky hierarchy Proceedings of the 7th international conference on Developments in language theory, (55-74)

Holzer M and Kutrib M Flip-pushdown automata Proceedings of the 30th international conference on Automata, languages and programming, (490-501)

Sasahara K and Ikegami T Evolution of birdsong grammars Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence, (305-314)

Gupta A and Suciu D Stream processing of XPath queries with predicates Proceedings of the 2003 ACM SIGMOD international conference on Management of data, (419-430)

Dziurzanski P Modelling of complex systems given as a mealy machine with linear decision diagrams Proceedings of the 2003 international conference on Computational science: PartII, (758-765)

Chesñevar C, Cobo M and Yurcik W (2003). Using theoretical computer simulators for formal languages and automata theory, ACM SIGCSE Bulletin, 35:2, (33-37), Online publication date: 1-Jun-2003.

Bultan T, Fu X, Hull R and Su J Conversation specification Proceedings of the 12th international conference on World Wide Web, (403-410)

Flanagan C and Qadeer S Thread-modular model checking Proceedings of the 10th international conference on Model checking software, (213-224)

Xu S and Chee Y (2003). Transformation-Based Diagnosis of Student Programs for Programming Tutoring Systems, IEEE Transactions on Software Engineering, 29:4, (360-384), Online publication date: 1-Apr-2003.

Wombacher A, Mahleko B and Risse T Classification of ad-hoc multi-lateral collaborations based on local workflow models Proceedings of the 2003 ACM symposium on Applied computing, (1185-1190)

Peña J, Corchuelo R and Arjona J A top down approach for MAS protocol descriptions Proceedings of the 2003 ACM symposium on Applied computing, (45-49)

De Moor O, Lacey D and Van Wyk E (2003). Universal Regular Path Queries, Higher-Order and Symbolic Computation, 16:1-2, (15-35), Online publication date: 1-Mar-2003.

Dillon L and Stirewalt R (2003). Inference Graphs, IEEE Transactions on Software Engineering, 29:2, (133-150), Online publication date: 1-Feb-2003.

Jain S (2003). The Intrinsic Complexity of Learning: A Survey, Fundamenta Informaticae, 57:1, (17-37), Online publication date: 1-Jan-2003.

Jain S (2003). The Intrinsic Complexity of Learning: A Survey, Fundamenta Informaticae, 57:1, (17-37), Online publication date: 1-Jan-2003.

Zhang F and Cheung T (2003). Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines, IEEE Transactions on Software Engineering, 29:1, (1-14), Online publication date: 1-Jan-2003.

Garofalakis M, Gionis A, Rastogi R, Seshadri S and Shim K (2003). XTRACT, Data Mining and Knowledge Discovery, 7:1, (23-56), Online publication date: 1-Jan-2003.

Denis F, Lemay A and Terlutte A (2002). Residual Finite State Automata, Fundamenta Informaticae, 51:4, (339-368), Online publication date: 1-Dec-2002.

Chen H and Wagner D MOPS Proceedings of the 9th ACM conference on Computer and communications security, (235-244)

Chen Y, Davidson S and Zheng Y XKvalidator Proceedings of the eleventh international conference on Information and knowledge management, (446-452)

Hoogeboom H Carriers and counters Proceedings of the 6th international conference on Developments in language theory, (140-151)

Chan C, Garofalakis M and Rastogi R RE-Tree Proceedings of the 28th international conference on Very Large Data Bases, (251-262)

Ludäscher B, Mukhopadhyay P and Papakonstantinou Y A transducer-based XML query processor Proceedings of the 28th international conference on Very Large Data Bases, (227-238)

Wintner S Formal Language Theory for natural language processing Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1, (71-76)

Caron P and Flouret M Star normal form, rational expressions, and glushkov WFAs properties Proceedings of the 7th international conference on Implementation and application of automata, (248-254)

Câmpeanu C, Salomaa K and Yu S Regex and extended regex Proceedings of the 7th international conference on Implementation and application of automata, (77-84)

Thiemann P (2002). A typed representation for HTML and XML documents in Haskell, Journal of Functional Programming, 12:5, (435-468), Online publication date: 1-Jul-2002.

Segoufin L and Vianu V Validating streaming XML documents Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (53-64)

Gottlob G and Koch C Monadic datalog and the expressive power of languages for web information extraction Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (17-28)

Sorin D, Plakal M, Condon A, Hill M, Martin M and Wood D (2002). Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol, IEEE Transactions on Parallel and Distributed Systems, 13:6, (556-578), Online publication date: 1-Jun-2002.

Bailey J, Poulovassilis A and Wood P An event-condition-action language for XML Proceedings of the 11th international conference on World Wide Web, (486-495)

Knapik T (2002). Checking Simple Properties of Transition Systems Defined by Thue Specifications, Journal of Automated Reasoning, 28:4, (337-369), Online publication date: 1-May-2002.

Shagrir O (2002). Effective Computation by Humans and Machines, Minds and Machines, 12:2, (221-240), Online publication date: 1-May-2002.

Delorme M and Mazoyer J (2002). Pebble automata, Fundamenta Informaticae, 52:1-3, (81-132), Online publication date: 1-Apr-2002.

Ross B (2002). The evolution of stochastic regular motifs for protein sequences, New Generation Computing, 20:2, (187-213), Online publication date: 1-Apr-2002.

Denis F, Lemay A and Terlutte A (2002). Residual Finite State Automata, Fundamenta Informaticae, 51:4, (339-368), Online publication date: 30-Mar-2002.

Grinder M (2002). Animating automata, ACM SIGCSE Bulletin, 34:1, (63-67), Online publication date: 1-Mar-2002.

Grinder M Animating automata Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (63-67)

Lee D and Yannakakis M (2002). Closed Partition Lattice and Machine Decomposition, IEEE Transactions on Computers, 51:2, (216-228), Online publication date: 1-Feb-2002.

Hoogeboom H and van Vugt N Upper bounds for restricted splicing Formal and natural computing, (361-375)

Delorme M and Mazoyer J (2002). Pebble Automata. Figures Families Recognition and Universality, Fundamenta Informaticae, 52:1-3, (81-132), Online publication date: 1-Jan-2002.

Farchi E, Hartman A and Pinter S (2002). Using a model-based test generator to test for standard conformance, IBM Systems Journal, 41:1, (89-110), Online publication date: 1-Jan-2002.

Gouraud S, Denise A, Gaudel M and Marre B A New Way of Automating Statistical Testing Methods Proceedings of the 16th IEEE international conference on Automated software engineering

Nitta N, Takata Y and Seki H An efficient security verification method for programs with stack inspection Proceedings of the 8th ACM conference on Computer and Communications Security, (68-77)

Yevtushenko N, Villa T, Brayton R, Petrenko A and Sangiovanni-Vincentelli A Solution of parallel language equations for logic synthesis Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (103-110)

Kuich W Forty years of formal power series in automata theory A half-century of automata theory, (49-71)

Hartmanis J Undecidability and incompleteness results in automata theory A half-century of automata theory, (21-35)

Danvy O and Nielsen L Defunctionalization at work Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (162-174)

Krishnan P (2001). Decomposing Timed Push Down Automata, Fundamenta Informaticae, 45:3, (215-229), Online publication date: 1-Aug-2001.

Champarnaud J and Ziadi D (2001). From Mirkin's Prebases to Antimirov's Word Partial Derivatives, Fundamenta Informaticae, 45:3, (195-205), Online publication date: 1-Aug-2001.

Dowding J, Hockey B, Gawron J and Culy C Practical issues in compiling typed unification grammars for speech recognition Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, (164-171)

Aycock J (2001). Why bison is becoming extinct, XRDS: Crossroads, The ACM Magazine for Students, 7:5, (3-3), Online publication date: 5-Jul-2001.

Reiss S and Renieris M Encoding program executions Proceedings of the 23rd International Conference on Software Engineering, (221-230)

Carrasco R, Oncina J and Calera-Rubio J (2001). Stochastic Inference of Regular Tree Languages, Machine Language, 44:1-2, (185-197), Online publication date: 1-Jul-2001.

Chatterjee S, Parker E, Hanlon P and Lebeck A Exact analysis of the cache behavior of nested loops Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, (286-297)

Chatterjee S, Parker E, Hanlon P and Lebeck A (2001). Exact analysis of the cache behavior of nested loops, ACM SIGPLAN Notices, 36:5, (286-297), Online publication date: 1-May-2001.

Hosoya H and Pierce B (2001). Regular expression pattern matching for XML, ACM SIGPLAN Notices, 36:3, (67-80), Online publication date: 1-Mar-2001.

Diehl S and Kerren A (2001). Levels of exploration, ACM SIGCSE Bulletin, 33:1, (60-64), Online publication date: 1-Mar-2001.

Diehl S and Kerren A Levels of exploration Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, (60-64)

Fernando T (2001). Ambiguous Discourse in a Compositional Context. An Operational Perspective, Journal of Logic, Language and Information, 10:1, (63-86), Online publication date: 30-Jan-2001.

Krishnan P (2001). Decomposing Timed Push Down Automata, Fundamenta Informaticae, 45:3, (215-229), Online publication date: 5-Jan-2001.

Champarnaud J and Ziadi D (2001). From Mirkin's Prebases to Antimirov's Word Partial Derivatives, Fundamenta Informaticae, 45:3, (195-205), Online publication date: 5-Jan-2001.

Merz S Model checking Modeling and verification of parallel processes, (3-38)

Forcada M and Carrasco R Finite-state computation in analog neural networks Emergent neural computational architectures based on neuroscience, (480-493)

Hosoya H and Pierce B Regular expression pattern matching for XML Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (67-80)

Arnold S, Mark L and Goldthwaite J Programming by voice, VocalProgramming Proceedings of the fourth international ACM conference on Assistive technologies, (149-155)

Braberman V and Pieniazek F Duration Properties over Real Time System Designs Proceedings of the 10th International Workshop on Software Specification and Design

Hosoya H, Vouillon J and Pierce B (2000). Regular expression types for XML, ACM SIGPLAN Notices, 35:9, (11-22), Online publication date: 1-Sep-2000.

Hosoya H, Vouillon J and Pierce B Regular expression types for XML Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, (11-22)

Liefke H and Suciu D (2000). XMill, ACM SIGMOD Record, 29:2, (153-164), Online publication date: 1-Jun-2000.

Liefke H and Suciu D XMill Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (153-164)

Motwani R, Panigrahy R, Saraswat V and Ventkatasubramanian S On the decidability of accessibility problems (extended abstract) Proceedings of the thirty-second annual ACM symposium on Theory of computing, (306-315)

Davulcu H, Yang G, Kifer M and Ramakrishnan I Computational aspects of resilient data extraction from semistructured sources (extended abstract) Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (136-144)

Walker D A type system for expressive security policies Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (254-267)

Bennett A, Paris J and Vencovská A (2000). A New Criterion for Comparing Fuzzy Logics for Uncertain Reasoning, Journal of Logic, Language and Information, 9:1, (31-63), Online publication date: 1-Jan-2000.

Alon N, Krivelevich M, Newman I and Szegedy M Regular Languages are Testable with a Constant Number of Queries Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Lopes A (1999). Ada+SQL—an overview, ACM SIGAda Ada Letters, XIX:3, (157-162), Online publication date: 1-Sep-1999.

Lopes A Ada+SQL—an overview Proceedings of the 1999 annual ACM SIGAda international conference on Ada, (157-162)

Kappes M (1999). Multi-Bracketed Contextual Rewriting Grammars, Fundamenta Informaticae, 38:3, (257-280), Online publication date: 1-Aug-1999.

Fisler K (1999). Timing Diagrams, Journal of Logic, Language and Information, 8:3, (323-361), Online publication date: 1-Jul-1999.

Miller R and Myers B Lightweight structured text processing Proceedings of the annual conference on USENIX Annual Technical Conference, (10-10)

Formisano A and Policriti A (1999). T-Resolution, Journal of Automated Reasoning, 22:4, (433-483), Online publication date: 1-May-1999.

Lillibridge M (1999). Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC, Higher-Order and Symbolic Computation, 12:1, (75-104), Online publication date: 1-Apr-1999.

Müller-Olm M A modal fixpoint logic with chop Proceedings of the 16th annual conference on Theoretical aspects of computer science, (510-520)

Robson J and Diekert V On quadratic word equations Proceedings of the 16th annual conference on Theoretical aspects of computer science, (217-226)

Lautemann C, Schweikardt N and Schwentick T A logical characterisation of linear time on nondeterministic turing machines Proceedings of the 16th annual conference on Theoretical aspects of computer science, (143-152)

Preoteasa V (1999). A Relation Between Unambiguous Regular Expressions and Abstract Data Types, Fundamenta Informaticae, 40:1, (53-77), Online publication date: 1-Jan-1999.

Gupta S (1998). Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997), ACM SIGACT News, 29:4, (5-10), Online publication date: 1-Dec-1998.

Nakamura K, Takagi K, Kimura S and Watanabe K Waiting false path analysis of sequential logic circuits for performance optimization Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (392-395)

Bhansali S and Hoar T (1998). Automated Software Synthesis, IEEE Transactions on Software Engineering, 24:10, (848-862), Online publication date: 1-Oct-1998.

Barthélemy F A morphological analyzer for akkadian verbal forms with a model of phonetic transformations Proceedings of the Workshop on Computational Approaches to Semitic Languages, (73-81)

Fanton M Finite state automata and Arabic writing Proceedings of the Workshop on Computational Approaches to Semitic Languages, (26-33)

Zajac R Feature structures, unification and finite-state transducers Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, (101-109)

Ranta A A multilingual natural-language interface to regular expressions Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, (79-90)

van Noord G Treatment of ε-moves in subset construction Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, (57-68)

Daciuk J, Watson B and Watson R Incremental construction of minimal acyclic finite state automata and transducers Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, (48-56)

Ball T (1998). On the limit of control flow analysis for regression test selection, ACM SIGSOFT Software Engineering Notes, 23:2, (134-142), Online publication date: 1-Mar-1998.

Ball T On the limit of control flow analysis for regression test selection Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis, (134-142)

Buhrman H, Kadin J and Thierauf T (1998). Functions Computable with Nonadaptive Queries to NP, Theory of Computing Systems, 31:1, (77-92), Online publication date: 1-Feb-1998.

Plümer L and Gröger G (1997). Achieving Integrity in Geographic Information Systems—Maps and Nested Maps, Geoinformatica, 1:4, (345-367), Online publication date: 1-Dec-1997.

Wolf W (1997). Redundancy Removal during High-Level Synthesis Using Scheduling Don‘t-Cares, Journal of Electronic Testing: Theory and Applications, 11:3, (211-225), Online publication date: 1-Dec-1997.

Berry D and Weber M A pragmatic, rigorous integration of structural and behavioral modeling notations Proceedings of the 1st International Conference on Formal Engineering Methods

Belli F and Dreyer J Program Segmentation for Controlling Test Coverage Proceedings of the Eighth International Symposium on Software Reliability Engineering

Zhou L, Rundensteiner E and Shin K (1997). Schema Evolution of an Object-Oriented Real-Time Database System for Manufacturing Automation, IEEE Transactions on Knowledge and Data Engineering, 9:6, (956-977), Online publication date: 1-Nov-1997.

Münke M, Lamersdorf W, Christiansen B and Müller-Jones K Type Management Proceedings of the 1st International Conference on Enterprise Distributed Object Computing, (78-89)

Narendran P and Otto F (1997). Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories, Journal of Automated Reasoning, 19:1, (87-115), Online publication date: 1-Aug-1997.

Noguet D A massively parallel implementation of the watershed based on cellular automata Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors

Schlipf T, Buechner T, Fritz R, Helms M and Koehl J (1997). Formal verification made easy, IBM Journal of Research and Development, 41:4-5, (567-576), Online publication date: 1-Jul-1997.

Karg C LR(k) Testing is Average Case Complete Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Regan K Polynomial Vicinity Circuits and Nonlinear Lower Bounds Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Vollmer H and Wagner K On Operators of Higher Types Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Buhrman H, Fortnow L and Torenvliet L Six Hypotheses in Search of a Theorem Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Liu T, Sajid K, Aziz A and Singhal V Optimizing designs containing black boxes Proceedings of the 34th annual Design Automation Conference, (113-116)

Kumar R, Nelvagal S and Marcus S (1997). A Discrete Event Systems Approach for Protocol Conversion, Discrete Event Dynamic Systems, 7:3, (295-315), Online publication date: 1-Jun-1997.

Abiteboul S and Vianu V Regular path queries with constraints Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (122-133)

Mäkinen E and Ţiplea F (1997). Pattern Ambiguities for Pure Context—Free Grammars, Fundamenta Informaticae, 30:2, (183-191), Online publication date: 1-Apr-1997.

Bazzi R, Neiger G and Peterson G (1997). On the use of registers in achieving wait-free consensus, Distributed Computing, 10:3, (117-127), Online publication date: 1-Apr-1997.

Swamy G Formal Verification of Digital Systems Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications

Giammarresi D and Restivo A (1996). TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY, Fundamenta Informaticae, 25:3,4, (399-422), Online publication date: 1-Dec-1996.

Drewes F and Kreowski H (1996). (UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE GRAMMARS, Fundamenta Informaticae, 25:3,4, (295-325), Online publication date: 1-Dec-1996.

Olstad B and Torp A (1996). Encoding of a priori Information in Active Contour Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:9, (863-872), Online publication date: 1-Sep-1996.

Graaf W, Ivanyos G and Rónyai L (1996). Computing Cartan subalgebras of Lie algebras, Applicable Algebra in Engineering, Communication and Computing, 7:5, (339-349), Online publication date: 1-Sep-1996.

Han Y and Hemaspaandra L (1996). Pseudorandom generators and the frequency of simplicity, Journal of Cryptology, 9:4, (251-261), Online publication date: 1-Sep-1996.

Bacchus F, Boutilier C and Grove A Rewarding behaviors Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2, (1160-1167)

Tiuryn J and Urzyczyn P The Subtyping Problem for Second-Order Types is Undecidable Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Wieringa R and Saake G (1996). Formal analysis of the Shlaer-Mellor method, Requirements Engineering, 1:2, (106-131), Online publication date: 1-Jun-1996.

Bala V and Rubin N Efficient instruction scheduling using finite state automata Proceedings of the 28th annual international symposium on Microarchitecture, (46-56)

Hoffman D and Strooper P (1995). State abstraction and modular software development, ACM SIGSOFT Software Engineering Notes, 20:4, (53-61), Online publication date: 1-Oct-1995.

Hoffman D and Strooper P State abstraction and modular software development Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, (53-61)

Breslauer D and Galil Z (1995). Finding all periods and initial palindromes of a string in parallel, Algorithmica, 14:4, (355-366), Online publication date: 1-Oct-1995.

On Reachability Analysis of Communicating Finite State Machines Proceedings of the 4th International Conference on Computer Communications and Networks

Wood P Magic factoring of closure programs (extended abstract) Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (174-183)

Lin B, de Jong G and Kolks T Hierarchical optimization of asynchronous circuits Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (712-717)

Borowsky E, Gafni E and Afek Y Consensus power makes (some) sense! (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, (363-372)

Hummel J, Hendren L and Nicolau A A general data dependence test for dynamic, pointer-based data structures Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (218-229)

Hummel J, Hendren L and Nicolau A (1994). A general data dependence test for dynamic, pointer-based data structures, ACM SIGPLAN Notices, 29:6, (218-229), Online publication date: 1-Jun-1994.

Condon A, Hellerstein L, Pottle S and Wigderson A On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (676-685)

Lagarias J and Shor P (1994). Cube-tilings of źn and nonlinear codesand nonlinear codes, Discrete & Computational Geometry, 11:4, (359-391), Online publication date: 1-Apr-1994.

Friedman N and Halpern J A knowledge-based framework for belief change part I Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge, (44-64)

Matos A (1994). An introduction to ultimately periodic sets of integers, ACM SIGACT News, 25:1, (90-96), Online publication date: 1-Mar-1994.

Jeuring J (1994). The derivation of on-line algorithms, with an application to finding palindromes, Algorithmica, 11:2, (146-184), Online publication date: 1-Feb-1994.

Regan K (1993). Machine models and linear time complexity, ACM SIGACT News, 24:3, (5-15), Online publication date: 1-Oct-1993.

Wu P and Wang F (1993). Applying classification and inheritance into compiling, ACM SIGPLAN OOPS Messenger, 4:4, (33-43), Online publication date: 1-Oct-1993.

Kupiec J MURAX Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, (181-190)

Jones N Constant time factors do matter Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (602-611)

Colton D (1993). A restated pumping lemma for context-free languages, ACM SIGACT News, 24:2, (87), Online publication date: 1-Apr-1993.

Hemaspaandra L (1993). Lowness, ACM SIGACT News, 24:2, (10-14), Online publication date: 1-Apr-1993.

Kozen D, Palsberg J and Schwartzbach M Efficient recursive subtyping Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (419-428)

Bonner A The complexity of reusing and modifying rulebases Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (316-330)

Siegelmann H and Sontag E On the computational power of neural nets Proceedings of the fifth annual workshop on Computational learning theory, (440-449)

Cohen W and Hirsh H Learnability of description logics Proceedings of the fifth annual workshop on Computational learning theory, (116-127)

Wu P, Wang F and Young K (1992). Scanning regular languages by dual finite automata, ACM SIGPLAN Notices, 27:4, (12-16), Online publication date: 1-Apr-1992.

Fellah A and Yu S Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, (1159-1166)

Wu P and Wang F (1992). An object-oriented specification for compiler, ACM SIGPLAN Notices, 27:1, (85-94), Online publication date: 1-Jan-1992.

Burshteyn B (1992). USSA—universal syntax and semantics analyzer, ACM SIGPLAN Notices, 27:1, (42-60), Online publication date: 1-Jan-1992.

Rekers J and Koorn W (1991). Substring parsing for arbitrary context-free grammars, ACM SIGPLAN Notices, 26:5, (59-66), Online publication date: 1-May-1991.

Sidhu D, Chung A and Blumer T (1991). Experience with formal methods in protocol development, ACM SIGCOMM Computer Communication Review, 21:2, (81-101), Online publication date: 1-Apr-1991.

Ibarra O (1991). On resetting DLBA's, ACM SIGACT News, 22:1, (62-63), Online publication date: 1-Mar-1991.

Wolf W Decomposing data machines Proceedings of the conference on European design automation, (378-382)

Henglein F and Mairson H The complexity of type inference for higher-order lambda calculi Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (119-130)

Spreitzer M Comparing structurally different views of a VLSI design Proceedings of the 27th ACM/IEEE Design Automation Conference, (200-212)

Yovev C (1990). Universal editor unattainable, ACM SIGPLAN Notices, 25:12, (89-92), Online publication date: 1-Dec-1990.

Palopoli L (1990). A new proof of undecidability of safety of logic queries, ACM SIGACT News, 21:4, (69-72), Online publication date: 1-Nov-1990.

Carasik R, Johnson S, Patterson D and Von Glahn G (1990). Domain description grammar: application of linguistic semantics, ACM SIGSOFT Software Engineering Notes, 15:5, (28-43), Online publication date: 1-Oct-1990.

Kauranen K and Makinen E (1990). A note on Cohen's formal model for computer viruses, ACM SIGSAC Review, 8:2, (40-43), Online publication date: 1-May-1990.

Johnsonbaugh R and Miller D Converses of pumping lemmas Proceedings of the twenty-first SIGCSE technical symposium on Computer science education, (27-30)

Johnsonbaugh R and Miller D (1990). Converses of pumping lemmas, ACM SIGCSE Bulletin, 22:1, (27-30), Online publication date: 1-Feb-1990.

Hull R and Su J On accessing object-oriented databases: expressive power, complexity, and restrictions Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (147-158)

Hull R and Su J (1989). On accessing object-oriented databases: expressive power, complexity, and restrictions, ACM SIGMOD Record, 18:2, (147-158), Online publication date: 1-Jun-1989.

Sharpe D (1988). Adding regular expressions to Pascal, ACM SIGPLAN Notices, 23:12, (125-133), Online publication date: 1-Dec-1988.

Moses Y and Tuttle M (1988). Programming simultaneous actions using common knowledge, Algorithmica, 3:1-4, (121-169), Online publication date: 1-Nov-1988.

Yonezawa A and Ohsawa I Object-oriented parallel parsing for context-free grammars Proceedings of the 12th conference on Computational linguistics - Volume 2, (773-778)

Ko K Relativized polynomial time hierarchies having exactly K levels Proceedings of the twentieth annual ACM symposium on Theory of computing, (245-253)

Karlin A, Trickey H and Ullman J (1987). Algorithms for the compilation of regular expressions into PLAs, Algorithmica, 2:1-4, (283-314), Online publication date: 1-Nov-1987.

Williams K and Meybodi M (1987). Representing problems as string transformations, ACM SIGACT News, 18:3, (29-30), Online publication date: 1-Apr-1987.

Mills J (1987). Coming to grips with a RISC: a report of the progress of the LOW RISC design group, ACM SIGARCH Computer Architecture News, 15:1, (53-62), Online publication date: 1-Mar-1987.

Hemachandra L The strong exponential hierarchy collapses Proceedings of the nineteenth annual ACM symposium on Theory of computing, (110-122)

Halpern J Reasoning about knowledge Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, (1-17)

Nirenberg R (1986). A practical turing machine representation, ACM SIGACT News, 17:3, (35-44), Online publication date: 1-Jan-1986.

Halpern J and Moses Y A guide to the modal logics of knowledge and belief Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1, (480-490)

Cosmadakis S and Kanellakis P Parallel evaluation of recursive rule queries Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, (280-293)

Walsh T (1982). The busy beaver on a one-way infinite tape, ACM SIGACT News, 14:1, (38-43), Online publication date: 1-Jan-1982.

Muller D and Schupp P Pushdown automata, graphs, ends, second-order logic, and reachability problems Proceedings of the thirteenth annual ACM symposium on Theory of computing, (46-54)