ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Introduction To Automata Theory, Languages, And Computation, 1st edition
Introduction To Automata Theory, Languages, And Computation, 1st edition
  Purchase this Book  
Source
Pages: 418  
Medium: Textbook Hardcover
Year of Publication: 1990
ISBN:020102988X
Authors
John E. Hopcroft
Jeffrey D. Ullman
Publisher
Addison-Wesley Longman Publishing Co., Inc.  Boston, MA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 810
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Book  

ABSTRACT

From the Publisher:

computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.


CITED BY  810
Rajesh Parekh , Vasant G. Honavar, Learning DFA from Simple Examples, Machine Learning, v.44 n.1-2, p.9-35, July-August 2001
Michael T. Grinder, Animating automata: a cross-platform program for teaching finite automata, ACM SIGCSE Bulletin, v.34 n.1, March 2002
Albert Goldfain, On the arithmetic power of context-free languages, Journal of Computing Sciences in Colleges, v.16 n.4, p.323-324, 2001
Lillian Lee, Fast context-free grammar parsing requires fast boolean matrix multiplication, Journal of the ACM (JACM), v.49 n.1, p.1-15, January 2002
Sanjay Jain , Arun Sharma, Elementary formal systems, intrinsic complexity, and procrastination, Proceedings of the ninth annual conference on Computational learning theory, p.181-192, June 28-July 01, 1996, Desenzano del Garda, Italy
A. J. Bonner, Hypothetical datalog negation and linear recursion, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.286-300, March 1989, Philadelphia, Pennsylvania, United States
W. Hseush , G. E. Kaiser, Modeling concurrency in parallel debugging, ACM SIGPLAN Notices, v.25 n.3, p.11-20, Mar. 1990
Extending Graham-Glanville techniques for optimal code generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.6, p.973-1001, Nov. 2000
S S Cosmadakis , P C Kanellakis, Equational theories and database constraints, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.273-284, May 06-08, 1985, Providence, Rhode Island, United States
Robert D. Dixon , David Hemmendinger, Analyzing synchronization problems by using event histories as languages, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.183-188, February 1986, Cincinnati, Ohio, United States
Arthur V. Lopes, Ada+SQL—an overview, ACM SIGAda Ada Letters, v.XIX n.3, p.157-162, Sept. 1999
Hasan Davulcu , Guizhen Yang , Michael Kifer , I. V. Ramakrishnan, 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, p.136-144, May 15-18, 2000, Dallas, Texas, United States
Joseph Hummel , Laurie J. Hendren , Alexandru Nicolau, A general data dependence test for dynamic, pointer-based data structures, ACM SIGPLAN Notices, v.29 n.6, p.218-229, June 1994
Brian Fox , Christopher J. Fox, Efficient stemmer generation, Information Processing and Management: an International Journal, v.38 n.4, p.547-558, July 2002
Sampath Kannan , Z. Sweedyk , Steve Mahaney, Counting and random generation of strings in regular languages, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.551-557, January 22-24, 1995, San Francisco, California, United States
Paul A. Fishwick, Simulation model design, Proceedings of the 27th conference on Winter simulation, p.209-211, December 03-06, 1995, Arlington, Virginia, United States
David P. Dobkin , Dimitrios Gunopulos, Concept learning with geometric hypotheses, Proceedings of the eighth annual conference on Computational learning theory, p.329-336, July 05-08, 1995, Santa Cruz, California, United States
Bill Lin , Gjalt de Jong , Tilman Kolks, Hierarchical optimization of asynchronous circuits, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.712-717, June 12-16, 1995, San Francisco, California, United States
L. A. Hemachandra, The strong exponential hierarchy collapses, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.110-122, January 1987, New York, New York, United States
Seppo Sippu , Eljas Soisalon-Soininen , Esko Ukkonen, The Complexity of LALR(k) Testing, Journal of the ACM (JACM), v.30 n.2, p.259-270, April 1983
A. Seawright , F. Brewer, Synthesis from production-based specifications, Proceedings of the 29th ACM/IEEE conference on Design automation, p.194-199, June 08-12, 1992, Anaheim, California, United States
Mauricio Ayala-Rincón , Alexsandro F. da Fonseca , Haydée Werneck Poubel , José Siqueira, A framework to visualize equivalences between computational models of regular languages, Information Processing Letters, v.84 n.1, p.5-16, 16 October 2002
Daniel Hoffman , Paul Strooper, State abstraction and modular software development, ACM SIGSOFT Software Engineering Notes, v.20 n.4, p.53-61, Oct. 1995
Roberto M. Amadio , Denis Lugiez , Vincent Vanackère, On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science, v.290 n.1, p.695-740, 1 January 2003
Chin-Wan Chung , Jun-Ki Min , Kyuseok Shim, APEX: an adaptive path index for XML data, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
L. Pitt , M. K. Warmuth, The minimum consistent DFA problem cannot be approximated within and polynomial, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.421-432, May 14-17, 1989, Seattle, Washington, United States
Ruchir Puri , Jun Gu, A modular partitioning approach for asynchronous circuit synthesis, Proceedings of the 31st annual conference on Design automation, p.63-69, June 06-10, 1994, San Diego, California, United States
Dana Angluin, Inference of Reversible Languages, Journal of the ACM (JACM), v.29 n.3, p.741-765, July 1982
Cynthia Dwork , Larry Stockmeyer, Finite state verifiers I: the power of interaction, Journal of the ACM (JACM), v.39 n.4, p.800-828, Oct. 1992
Anne Condon , Lisa Hellerstein , Samuel Pottle , Avi Wigderson, 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, p.676-685, May 23-25, 1994, Montreal, Quebec, Canada
William K. C. Lam , Robert K. Brayton , Alberto L. Sangiovanni-Vincentelli, Exact minimum cycle times for finite state machines, Proceedings of the 31st annual conference on Design automation, p.100-105, June 06-10, 1994, San Diego, California, United States
Ker-I Ko, Relativized polynomial time hierarchies having exactly K levels, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.245-253, May 02-04, 1988, Chicago, Illinois, United States
Andrea Asperti , Harry G. Mairson, Parallel beta reduction is not elementary recursive, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.303-315, January 19-21, 1998, San Diego, California, United States
Roberto Passerone , James A. Rowson , Alberto Sangiovanni-Vincentelli, Automatic synthesis of interfaces between incompatible protocols, Proceedings of the 35th annual conference on Design automation, p.8-13, June 15-19, 1998, San Francisco, California, United States
Mark R. Headington, Introducing finite automata in the first course, ACM SIGCSE Bulletin, v.20 n.1, p.163-167, Feb. 1988
Bruce W. Watson , Richard E. Watson, A Boyer--Moore-style algorithm for regular expression pattern matching, Science of Computer Programming, v.48 n.2-3, p.99-117, August 2003
M. Atallah , P. Callahan , M. Goodrich, P-complete geometric problems, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.317-326, July 02-06, 1990, Island of Crete, Greece
Peter Vanbekbergen , Bill Lin , Gert Goosens , Hugo De Man, A generalized state assignment theory for transformation on signal transition graphs, Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, p.112-117, November 1992, Santa Clara, California, United States
E. Allender, Some consequences of the existence of pseudorandom generators, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.151-159, January 1987, New York, New York, United States
Georg Gottlob , Christoph Koch, 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, June 03-05, 2002, Madison, Wisconsin
D. Zhang , D. Nguyen, PREPARE: A Tool for Knowledge Base Verification, IEEE Transactions on Knowledge and Data Engineering, v.6 n.6, p.983-989, December 1994
Adnan Aziz , Serdar Taşiran , Robert K. Brayton, BDD variable ordering for interacting finite state machines, Proceedings of the 31st annual conference on Design automation, p.283-288, June 06-10, 1994, San Diego, California, United States
Hsu Wen Jing , Amitabha Das , Moon Jung Chung, Linear recursive networks and their applications in topological design and data routing, ACM SIGCOMM Computer Communication Review, v.23 n.4, p.249-257, Oct. 1993
Adnan Aziz , Felice Balarin , Robert Brayton , Alberto Sangiovanni-Vincentelli, Sequential synthesis using S1S, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.612-617, November 05-09, 1995, San Jose, California, United States
Russell Impagliazzo , Ramamohan Paturi , Michael E. Saks, Size-depth trade-offs for threshold circuits, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.541-550, May 16-18, 1993, San Diego, California, United States
Mikel L. Forcada , Rafael C. Carrasco, Finite-state computation in analog neural networks: steps towards biologically plausible models?, Emergent neural computational architectures based on neuroscience: towards neuroscience-inspired computing, Springer-Verlag New York, Inc., New York, NY, 2001
Richard Hull , Jianwen Su, On accessing object-oriented databases: expressive power, complexity, and restrictions, ACM SIGMOD Record, v.18 n.2, p.147-158, June 1989
Oscar H. Ibarra , Brian S. Leininger, The complexity of the equivalence problem for straight-line programs, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.273-280, April 28-30, 1980, Los Angeles, California, United States
Kenneth J. Supowit , Steven J. Friedman, A new method for verifying sequential circuits, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.200-207, July 1986, Las Vegas, Nevada, United States
Russell B. Kegley , Lois M. Boggess, Design of an ATN generator/modifier for supporting a communication prosthesis, Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge, p.310-313, January 1984
Paul Rendell, Turing universality of the game of life, Collision-based computing, Springer-Verlag, London, 2001
J. Albrecht , W. Hümmer , W. Lehner , L. Schlesinger, Query optimization by using derivability in a data warehouse environment, Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP, p.49-56, November 06-11, 2000, McLean, Virginia, United States
Martin Kutrib, On the descriptional power of heads, counters, and pebbles, Theoretical Computer Science, v.330 n.2, p.311-324, 2 February 2005
Khalid Al-Kofahi , Brian Grom , Peter Jackson, Anaphora resolution in the extraction of treatment history language from court opinions by partial parsing, Proceedings of the 7th international conference on Artificial intelligence and law, p.138-146, June 14-17, 1999, Oslo, Norway
Diego Calvanese , Moshe Y. Vardi , Giuseppe de Giacomo , Maurizio Lenzerini, View-based query processing for regular path queries with inverse, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.58-66, May 15-18, 2000, Dallas, Texas, United States
Peter R. Cappello , Kenneth Steiglitz, A VLSI layout for a pipelined Dadda multiplier, ACM Transactions on Computer Systems (TOCS), v.1 n.2, p.157-174, May 1983
Gila Kamhi , Limor Fix, Adaptive variable reordering for symbolic model checking, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.359-365, November 08-12, 1998, San Jose, California, United States
Richard Johnsonbaugh , David P. Miller, Converses of pumping lemmas, ACM SIGCSE Bulletin, v.22 n.1, p.27-30, Feb. 1990
Christian W. Omlin , C. Lee Giles, Constructing deterministic finite-state automata in recurrent neural networks, Journal of the ACM (JACM), v.43 n.6, p.937-972, Nov. 1996
Roberto M. Amadio , Charles Meyssonnier, On decidability of the control reachability problem in the asynchronous π-calculus, Nordic Journal of Computing, v.9 n.2, p.70-101, Summer 2002
James Bailey , Alexandra Poulovassilis , Peter T. Wood, An event-condition-action language for XML, Proceedings of the 11th international conference on World Wide Web, May 07-11, 2002, Honolulu, Hawaii, USA
Thomas Eiter , Georg Gottlob , Yuri Gurevich, Existential second-order logic over strings, Journal of the ACM (JACM), v.47 n.1, p.77-131, Jan. 2000
Rajeev Motwani , Rina Panigrahy , Vijay Saraswat , Suresh Ventkatasubramanian, On the decidability of accessibility problems (extended abstract), Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.306-315, May 21-23, 2000, Portland, Oregon, United States
F. Bergadano , D. Catalano , S. Varricchio, Learning Sat-k-DNF formulas from membership queries, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.126-130, May 22-24, 1996, Philadelphia, Pennsylvania, United States
Joost Engelfriet , Hendrik Jan Hoogeboom, MSO definable string transductions and two-way finite-state transducers, ACM Transactions on Computational Logic (TOCL), v.2 n.2, p.216-254, April 2001
David M. Kristol , David Lee , Arun N. Netravali , Krishan Sabnani, A polynomial algorithm for gateway generation from formal specifications, IEEE/ACM Transactions on Networking (TON), v.1 n.2, p.217-229, April 1993
Richard E. Pattis, Teaching EBNF first in CS 1, ACM SIGCSE Bulletin, v.26 n.1, p.300-303, March 1994
John Case , Sanjay Jain , Arun Sharma, On learning limiting programs, Proceedings of the fifth annual workshop on Computational learning theory, p.193-202, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Kazuo Iwama, Unique decomposability of shuffled strings: A formal treatment of asynchronous time-multiplexed communication, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.374-381, December 1983
William W. Cohen , Haym Hirsh, Learnability of description logics, Proceedings of the fifth annual workshop on Computational learning theory, p.116-127, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Siddhartha Chatterjee , Erin Parker , Philip J. Hanlon , Alvin R. Lebeck, Exact analysis of the cache behavior of nested loops, ACM SIGPLAN Notices, v.36 n.5, p.286-297, May 2001
Neil D. Jones, Constant time factors do matter, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.602-611, May 16-18, 1993, San Diego, California, United States
Vaughn Pratt, Modeling concurrency with geometry, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.311-322, January 21-23, 1991, Orlando, Florida, United States
Kenneth N. McKay , John A. Buzacott , John B. Moore , Christopher J. Strang, Software engineerng applied to discrete event simulations, Proceedings of the 18th conference on Winter simulation, p.485-493, December 08-10, 1986, Washington, D.C., United States
Mike Spreitzer, Comparing structurally different views of a VLSI design, Proceedings of the 27th ACM/IEEE conference on Design automation, p.200-212, June 24-27, 1990, Orlando, Florida, United States
Benjamin C. Pierce, Bounded quantification is undecidable, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.305-315, January 19-22, 1992, Albuquerque, New Mexico, United States
M. Reynolds, The complexity of the temporal logic with "until" over general linear time, Journal of Computer and System Sciences, v.66 n.2, p.393-426, March 2003
Elizabeth Borowsky , Eli Gafni , Yehuda Afek, Consensus power makes (some) sense! (extended abstract), Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.363-372, August 14-17, 1994, Los Angeles, California, United States
Anthony J. Bonner, The complexity of reusing and modifying rulebases, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.316-330, June 02-05, 1992, San Diego, California, United States
Andrew Seawright , Forrest Brewer, High-level symbolic construction technique for high performance sequential synthesis, Proceedings of the 30th international conference on Design automation, p.424-428, June 14-18, 1993, Dallas, Texas, United States
Markus Holzer , Pierre McKenzie, Alternating and empty alternating auxiliary stack automata, Theoretical Computer Science, v.299 n.1-3, p.307-326, 18 April 2003
Robert W. Floyd , Jeffrey D. Ullman, The Compilation of Regular Expressions into Integrated Circuits, Journal of the ACM (JACM), v.29 n.3, p.603-622, July 1982
R. Anderson , P. Beame , W. Ruzzo, Low overhead parallel schedules for task graphs, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.66-75, July 02-06, 1990, Island of Crete, Greece
Markus Holzer , Muriel Quenzer, VisA: towards a students' green card to automata theory and formal languages, Proceedings of the 3rd Australasian conference on Computer science education, p.67-75, July 08-10, 1998, The University of Queensland, Australia
Michael Sipser, The history and status of the P versus NP question, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.603-618, May 04-06, 1992, Victoria, British Columbia, Canada
Burkhard Monien , Ivan Hal Sudborough, Bandwidth constrained NP-Complete problems, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.207-217, May 11-13, 1981, Milwaukee, Wisconsin, United States
Jacques Cohen, A view of the origins and development of Prolog, Communications of the ACM, v.31 n.1, p.26-36, Jan. 1988
David Walker, A type system for expressive security policies, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.254-267, January 19-21, 2000, Boston, MA, USA
Ralph D. Hill, Event-response systems: a technique for specifying multi-threaded dialogues, ACM SIGCHI Bulletin, v.17 n.SI, p.241-248, May 1987
Willaim H. Sanders , John F. Meyer, Stochastic activity networks: formal definitions and concepts, Lectures on formal methods and performance analysis: first EEF/Euro summer school on trends in computer science, Springer-Verlag New York, Inc., New York, NY, 2002
Orit Hazzan, Reducing abstraction level when learning computability theory concepts, ACM SIGCSE Bulletin, v.34 n.3, September 2002
A. I. Karshmer , G. Gupta , S. Geiiger , C. Weaver, Reading and writing mathematics: the MAVIS project, Proceedings of the third international ACM conference on Assistive technologies, p.136-143, April 15-17, 1998, Marina del Rey, California, United States
Matti Nykänen, Using acceptors as transducers, Theoretical Computer Science, v.267 n.1-2, p.83-104, 09/26/2001
Enver Yücesan , Sheldon H. Jacobson, On the simultaneous construction of sample paths, Proceedings of the 27th conference on Winter simulation, p.357-361, December 03-06, 1995, Arlington, Virginia, United States
Serge Abiteboul , Victor Vianu, Regular path queries with constraints, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.122-133, May 11-15, 1997, Tucson, Arizona, United States
Paul A. Fishwick, An integrated approach to system modeling using a synthesis of artificial intelligence, software engineering and simulation methodologies, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.2 n.4, p.307-330, Oct. 1992
Michael Leuschel , Bern Martens , Danny De Schreye, Controlling generalization and polyvariance in partial deduction of normal logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.208-258, Jan. 1998
Hava T. Siegelmann , Eduardo D. Sontag, On the computational power of neural nets, Proceedings of the fifth annual workshop on Computational learning theory, p.440-449, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Dong-Tsan Lee, Evaluating real-time software specification languages, Computer Standards & Interfaces, v.24 n.5, p.395-409, November 2002
Bill Lin , Chantal Ykman-Couvreur , Peter Vanbekbergen, A general state graph transformation framework for asynchronous synthesis, Proceedings of the conference on European design automation, p.448-453, September 19-23, 1994, Grenoble, France
Lisa Hellerstein , Vijay Raghavan , Krishnan Pillaipakkamnatt , Dawn Wilkins, How many queries are needed to learn?, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.190-199, May 29-June 01, 1995, Las Vegas, Nevada, United States
Aamod Sane , Roy Campbell, Object-oriented state machines: subclassing, composition, delegation, and genericity, ACM SIGPLAN Notices, v.30 n.10, p.17-32, Oct. 17, 1995
M. Y. Vardi, Invited talk: automata theory for database theoreticians, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.83-92, March 1989, Philadelphia, Pennsylvania, United States
Oscar H. Ibarra , Shlomo Moran, Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs, Journal of the ACM (JACM), v.30 n.1, p.217-228, Jan. 1983
Henning Fernau , Ralf Stiebe, Sequential grammars and automata with valances, Theoretical Computer Science, v.276 n.1-2, p.377-405, April 6, 2002
Harry G. Mairson, Deciding ML typability is complete for deterministic exponential time, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.382-401, December 1989, San Francisco, California, United States
Chrystopher L. Nehaniv , Kerstin Dautenhahn, The correspondence problem, Imitation in animals and artifacts, MIT Press, Cambridge, MA, 2002
Ken-Chih Liu, Extending Earley's context-free parsing algorithm for string pattern matching, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.500-509, February 1988, Atlanta, Georgia, United States
Daniela Rus , Devika Subramanian, Multi-media RISC informatics: retrieving information with simple structural components, Proceedings of the second international conference on Information and knowledge management, p.283-294, November 01-05, 1993, Washington, D.C., United States
Ken Nakayama , Kazunori Yamaguchi , Satoru Kawai, I-regular expression: regular expression with continuous interval constraints, Proceedings of the sixth international conference on Information and knowledge management, p.40-50, November 10-14, 1997, Las Vegas, Nevada, United States
Dale Myers, The random access hierarchy, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.355-364, December 1983
Joanne M. Atlee , Michael A. Buckley, A logic-model semantics for SCR software requirements, ACM SIGSOFT Software Engineering Notes, v.21 n.3, p.280-292, May 1996
M. Beaudry , P. McKenzie , D. Thérien, The membership problem in aperiodic transformation monoids, Journal of the ACM (JACM), v.39 n.3, p.599-616, July 1992
Akeo Adachi , Shigeki Iwata , Takumi Kasai, Low level complexity for combinatorial games, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.228-237, May 11-13, 1981, Milwaukee, Wisconsin, United States
Steven M. German , A. Prasad Sistla, Reasoning about systems with many processes, Journal of the ACM (JACM), v.39 n.3, p.675-735, July 1992
Joost Engelfriet, Iterated pushdown automata and complexity classes, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.365-373, December 1983
Yannis Papakonstantinou , Victor Vianu, DTD inference for views of XML data, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.35-46, May 15-18, 2000, Dallas, Texas, United States
Minos Garofalakis , Aristides Gionis , Rajeev Rastogi , S. Seshadri , Kyuseok Shim, XTRACT: a system for extracting document type descriptors from XML documents, ACM SIGMOD Record, v.29 n.2, p.165-176, June 2000
Shing Chi Cheung , Jeff Kramer, Context constraints for compositional reachability analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), v.5 n.4, p.334-377, Oct. 1996
J. C. M. Baeten , J. A. Bergstra , J. W. Klop, Decidability of bisimulation equivalence for process generating context-free languages, Journal of the ACM (JACM), v.40 n.3, p.653-682, July 1993
Esko Ukkonen , Eljas Soisalon-Soininen, LALR(k) testing is PSPACE-complete, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.202-206, May 11-13, 1981, Milwaukee, Wisconsin, United States
Stephan Diehl , Andreas Kerren, Levels of exploration, ACM SIGCSE Bulletin, v.33 n.1, p.60-64, March 2001
Hagit Brit , Shlomo Moran, Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract), Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.52-60, August 14-17, 1994, Los Angeles, California, United States
Haim Gaifman , Harry Mairson , Yehoshua Sagiv , Moshe Y. Vardi, Undecidable optimization problems for database logic programs, Journal of the ACM (JACM), v.40 n.3, p.683-713, July 1993
Paolo Atzeni , Giansalvatore Mecca, Cut and paste, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.144-153, May 11-15, 1997, Tucson, Arizona, United States
Wamberto W. Vasconcelos , Jordi Sabater , Carles Sierra , Joaquim Querol, Skeleton-based agent development for electronic institutions, Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, July 15-19, 2002, Bologna, Italy
W. Maass , G. Schnitger , E. Szemeredi, Two tapes are better than one for off-line Turing machines, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.94-100, January 1987, New York, New York, United States
Kazuhiro Nakamura , Kazuyoshi Takagi , Shinji Kimura , Katsumasa Watanabe, Waiting false path analysis of sequential logic circuits for performance optimization, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.392-395, November 08-12, 1998, San Jose, California, United States
S. C. Cheung , J. Kramer, Enhancing compositional reachability analysis with context constraints, ACM SIGSOFT Software Engineering Notes, v.18 n.5, p.115-125, Dec. 1993
Werner Kuich, Forty years of formal power series in automata theory, A half-century of automata theory: celebration and inspiration, World Scientific Publishing Co., Inc., River Edge, NJ, 2001
Minimal cover-automata for finite languages, Theoretical Computer Science, v.267 n.1-2, p.3-16, 09/26/2001
Paris C. Kanellakis , Scott A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.228-240, August 17-19, 1983, Montreal, Quebec, Canada
Gösta Grahne , Raul Hakli , Matti Nykänen , Hellis Tamm , Esko Ukkonen, Design and implementation of a string database query language, Information Systems, v.28 n.4, p.311-337, June 2003
Bill Teel , Doran Wilde, A logic minimizer for VLSI PLA design, Proceedings of the 19th conference on Design automation, p.156-162, January 1982
Masami Amano , Kazuo Iwama, Undecidability on quantum finite automata, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.368-375, May 01-04, 1999, Atlanta, Georgia, United States
D. J. Salomon , G. V. Cormack, Scannerless NSLR(1) parsing of programming languages, ACM SIGPLAN Notices, v.24 n.7, p.170-178, July 1989
S. Devadas , H.-K. T. Ma , A. R. Newton, On the verification of sequential machines at differing levels of abstraction, Proceedings of the 24th ACM/IEEE conference on Design automation, p.271-276, June 28-July 01, 1987, Miami Beach, Florida, United States
Frank Neven , Jan Van Den Bussche, Expressiveness of structured document query languages based on attribute grammars, Journal of the ACM (JACM), v.49 n.1, p.56-100, January 2002
Oliver Matz , Nicole Schweikardt , Wolfgang Thomas, The monadic quantifier alternation hierarchy over grids and graphs, Information and Computation, v.179 n.2, p.356-383, December 15, 2002
Rance Cleaveland , Joachim Parrow , Bernhard Steffen, The concurrency workbench: a semantics-based tool for the verification of concurrent systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.1, p.36-72, Jan. 1993
Haruo Hosoya , Jérôme Vouillon , Benjamin C. Pierce, Regular expression types for XML, ACM SIGPLAN Notices, v.35 n.9, p.11-22, Sept. 2000
T. Shiroshita, A data processing performance model for the OSI application layer protocols, ACM SIGCOMM Computer Communication Review, v.20 n.4, p.60-68, Sep. 1990
Jin-yi Cai, Parallel computation over hyperbolic groups, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.106-115, May 04-06, 1992, Victoria, British Columbia, Canada
A. R. Hurson , S. Shirazi, The design of a hardware recognizer for utilization in scanning operations, Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, p.112-119, March 1985, New Orleans, Louisiana, United States
K. Lieberherr , C. Xiao, Formal Foundations for Object-Oriented Data Modeling, IEEE Transactions on Knowledge and Data Engineering, v.5 n.3, p.462-478, June 1993
Joe Kilian , Hava T. Siegelmann, On the power of sigmoid neural networks, Proceedings of the sixth annual conference on Computational learning theory, p.137-143, July 26-28, 1993, Santa Cruz, California, United States
R. E. Kurt Stirewalt , Laura K. Dillon, A component-based approach to building formal analysis tools, Proceedings of the 23rd International Conference on Software Engineering, p.167-176, May 12-19, 2001, Toronto, Ontario, Canada
Y. S. Chua , C. N. Winton, An upper level computer science curriculum, ACM SIGCSE Bulletin, v.15 n.1, p.77-81, February 1983
F. Afrati , S. S. Cosmadakis, Expressiveness of restricted recursive queries, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.113-126, May 14-17, 1989, Seattle, Washington, United States
Jan Chomicki , Tomasz Imieliński, Temporal deductive databases and infinite objects, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.61-73, March 1988, Austin, Texas, United States
Eric W. Allender, P-uniform circuit complexity, Journal of the ACM (JACM), v.36 n.4, p.912-928, Oct. 1989
Ho-Yen Chang , S. Felix Wu , Y. Frank Jou, Real-time protocol analysis for detecting link-state routing protocol attacks, ACM Transactions on Information and System Security (TISSEC), v.4 n.1, p.1-36, Feb. 2001
Ganesh R. Baliga , John Case , Sanjay Jain, Synthesizing enumeration techniques for language learning, Proceedings of the ninth annual conference on Computational learning theory, p.169-180, June 28-July 01, 1996, Desenzano del Garda, Italy
David Harel , Hagi Lachover , Amnon Naamad , Amir Pnueli , Michal Politi , Rivi Sherman , Aharon Shtull-Trauring , Mark Trakhtenbrot, STATEMATE: a working environment for the development of complex reactive systems, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
Akeo Adachi , Shigeki Iwata , Takumi Kasai, Some combinatorial game problems require Ω(nk) time, Journal of the ACM (JACM), v.31 n.2, p.361-376, April 1984
Lee W. Schruben , Enver Yucesan, Simulation graphs, Proceedings of the 20th conference on Winter simulation, p.504-508, December 12-14, 1988, San Diego, California, United States
Abdelaziz Fellah , Sheng Yu, 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, p.1159-1166, March 1992, Kansas City, Missouri, United States
Pei-Chi Wu , Feng-Jian Wang , Kai-Ru Young, An object-oriented specification and its generation for compiler, Proceedings of the 1992 ACM annual conference on Communications, p.323-330, March 03-05, 1992, Kansas City, Missouri, United States
Pamela Zave, A distributed alternative to finite-state-machine specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.1, p.10-36, Jan. 1985
Enver Yücesan , Sheldon H. Jacobson, Building correct simulation models is difficult, Proceedings of the 24th conference on Winter simulation, p.783-790, December 13-16, 1992, Arlington, Virginia, United States
A. Barbé , F. von Haeseler , G. Skordev, Scaling properties of generalized Carlitz sequences of polynomials, Discrete Applied Mathematics, v.143 n.1-3, p.166-181, 30 September 2004
Jacques Cohen, Constraint logic programming languages, Communications of the ACM, v.33 n.7, p.52-68, July 1990
David Harel, On visual formalisms, Communications of the ACM, v.31 n.5, p.514-530, May 1988
Stephen Brookes , Denis Dancanet, Sequential algorithms, deterministic parallelism, and intensional expressiveness, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.13-24, January 23-25, 1995, San Francisco, California, United States
Kristina Lundqvist , Lars Asplund, A formal model of the Ada Ravenscar tasking profile; delay until, ACM SIGAda Ada Letters, v.XIX n.3, p.15-21, Sept. 1999
José L. Balcázar , Josep Díaz , Ricard Gavaldà , Osamu Watanabe, An optimal parallel algorithm for learning DFA, Proceedings of the seventh annual conference on Computational learning theory, p.208-217, July 12-15, 1994, New Brunswick, New Jersey, United States
Barrett R. Bryant , Balanjaninath Edupuganty , K. R. Sundararaghavan , Tadao Takaoka, Two-level grammar: data flow English for functional and logic programming, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.469-474, February 1988, Atlanta, Georgia, United States
James F. Power , Brian A. Malloy, Exploiting metrics to facilitate grammar transformation into LALR format, Proceedings of the 2001 ACM symposium on Applied computing, p.636-640, March 2001, Las Vegas, Nevada, United States
Robert Nix, Editing by example, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.186-195, January 15-18, 1984, Salt Lake City, Utah, United States
Ruchir Puri , Jun Gu, A divide-and-conquer approach for asynchronous interface synthesis, Proceedings of the 7th international symposium on High-level synthesis, p.118-125, May 18-20, 1994, Niagra-on-the-Lake, Ontario, Canada
William Landi, Undecidability of static analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.4, p.323-337, Dec. 1992
S. C. Cheung , J. Kramer, An integrated method for effective behaviour analysis of distributed systems, Proceedings of the 16th international conference on Software engineering, p.309-320, May 16-21, 1994, Sorrento, Italy
Hermann Moisl, Linguistic computation with state space trajectories, Emergent neural computational architectures based on neuroscience: towards neuroscience-inspired computing, Springer-Verlag New York, Inc., New York, NY, 2001
Daniela Rus , Devika Subramanian, Customizing information capture and access, ACM Transactions on Information Systems (TOIS), v.15 n.1, p.67-101, Jan. 1997
Todd J. Green , Ashish Gupta , Gerome Miklau , Makoto Onizuka , Dan Suciu, Processing XML streams with deterministic automata and stream indexes, ACM Transactions on Database Systems (TODS), v.29 n.4, December 2004
Janos Simon, Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version), Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.158-167, May 11-13, 1981, Milwaukee, Wisconsin, United States
Koichi Yamazaki, The generating power of the boundary NLC graph grammars, Proceedings of the 1993 ACM conference on Computer science, p.404-409, February 16-18, 1993, Indianapolis, Indiana, United States
Jinzhao Wu , Lian Li, The regular problem and green equivalences for special monoids, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.78-85, July 06-08, 1993, Kiev, Ukraine
Tevfik Bultan , Richard Gerber , William Pugh, Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.4, p.747-789, July 1999
David Lee , Mihalis Yannakakis, Closed Partition Lattice and Machine Decomposition, IEEE Transactions on Computers, v.51 n.2, p.216-228, February 2002
J.-M. Champarnaud, Subset construction complexity for homogeneous automata, position automata and ZPC-structures, Theoretical Computer Science, v.267 n.1-2, p.17-34, 09/26/2001
Aleksy Schubert, Second-order unification and type inference for Church-style polymorphism, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.279-288, January 19-21, 1998, San Diego, California, United States
Thomas Lengauer , Egon Wanke, Efficient decision procedures for graph properties on context-free graph languages, Journal of the ACM (JACM), v.40 n.2, p.368-393, April 1993
Thomas Gabler , Sabine März-Rössel, An approach to guided incremental specification, Proceedings of the conference on European design automation, p.368-373, September 18-22, 1995, Brighton, England
Gonzalo Navarro, A guided tour to approximate string matching, ACM Computing Surveys (CSUR), v.33 n.1, p.31-88, March 2001
C. Beeri , P. Kanellakis , F. Bancilhon , R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.214-226, March 23-25, 1987, San Diego, California, United States
Naoya Nitta , Yoshiaki Takata , Hiroyuki Seki, An efficient security verification method for programs with stack inspection, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA
Pekka Orponen , Ker-i Ko , Uwe Schöning , Osamu Watanabe, Instance complexity, Journal of the ACM (JACM), v.41 n.1, p.96-121, Jan. 1994
Klaus Buchenrieder , Christian Veith, A prototyping environment for control-oriented HW/SW systems using state-charts, activity-charts and FPGA's, Proceedings of the conference on European design automation, p.60-65, September 19-23, 1994, Grenoble, France
George W. Hart , Samir G. Kelekar, Automated repair of complex systems by fault compensation, IEEE/ACM Transactions on Networking (TON), v.2 n.2, p.193-205, April 1994
L. Pitt, Probabilistic inductive inference, Journal of the ACM (JACM), v.36 n.2, p.383-433, April 1989
Stephen C. Arnold , Leo Mark , John Goldthwaite, Programming by voice, VocalProgramming, Proceedings of the fourth international ACM conference on Assistive technologies, p.149-155, November 13-15, 2000, Arlington, Virginia, United States
Michael R. Fellows , Michael A. Langston, Nonconstructive tools for proving polynomial-time decidability, Journal of the ACM (JACM), v.35 n.3, p.727-739, July 1988
J. Cai , R. Paige, Binding performance at language design time, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.85-97, January 21-23, 1987, Munich, West Germany
Léa Meyer, Aspects of complexity of conservative probabilistic learning, Proceedings of the eleventh annual conference on Computational learning theory, p.72-78, July 24-26, 1998, Madison, Wisconsin, United States
Y Mansour , S Zaks, On the bit complexity of distributed computations in a ring with a leader, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.151-160, August 11-13, 1986, Calgary, Alberta, Canada
Philip J. Bernhard, A reduced test suite for protocol conformance testing, ACM Transactions on Software Engineering and Methodology (TOSEM), v.3 n.3, p.201-220, July 1994
Fritz Henglein , Harry G. Mairson, The complexity of type inference for higher-order lambda calculi, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-130, January 21-23, 1991, Orlando, Florida, United States
Partha S. Roop , A. Sowmya , S. Ramesh, Forced simulation: A technique for automating component reuse in embedded systems, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.6 n.4, p.602-628, October 2001
M. -W. Du , S. C. Chang, An Approach to Designing Very Fast Approximate String Matching Algorithms, IEEE Transactions on Knowledge and Data Engineering, v.6 n.4, p.620-633, August 1994
Lisa Hellerstein , Krishnan Pillaipakkamnatt , Vijay Raghavan , Dawn Wilkins, How many queries are needed to learn?, Journal of the ACM (JACM), v.43 n.5, p.840-862, Sept. 1996
Enver Yücesan , Sheldon H. Jacobson, Computational issues for accessibility in discrete event simulation, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.6 n.1, p.53-75, Jan. 1996
Y. Sagiv , M. Y. Vardi, Safety of datalog queries over infinite databases, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.160-171, March 1989, Philadelphia, Pennsylvania, United States
Roger L. Haskin , Lee A. Hollaar, Operational characteristics of a harware-based pattern matcher, ACM Transactions on Database Systems (TODS), v.8 n.1, p.15-40, March 1983
Tai-Hung Liu , Khurram Sajid , Adnam Aziz , Vigyan Singhal, Optimizing designs containing black boxes, Proceedings of the 34th annual conference on Design automation, p.113-116, June 09-13, 1997, Anaheim, California, United States
Felice Balarin , Alberto L. Sangiovanni-Vincentelli, Iterative algorithms for formal verification of embedded real-time systems, Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, p.450-457, November 06-10, 1994, San Jose, California, United States
Katsuro Inoue , Hiroyuki Seki , Hikaru Yagi, Analysis of functional programs to detect run-time garbage cells, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.555-578, Oct. 1988
Ricardo A. Baeza-Yates , Gaston H. Gonnet, Fast text searching for regular expressions or automaton searching on tries, Journal of the ACM (JACM), v.43 n.6, p.915-936, Nov. 1996
Tevfik Bultan , Xiang Fu , Richard Hull , Jianwen Su, Conversation specification: a new approach to design and analysis of e-service composition, Proceedings of the 12th international conference on World Wide Web, May 20-24, 2003, Budapest, Hungary
Thomas Reps, “Maximal-munch” tokenization in linear time, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.2, p.259-273, March 1998
Vincent Schächter, On complexiy, Quantum mechanics, mathematics, cognition and action: proposals for a formalized epistemology, Kluwer Academic Publishers, Norwell, MA, 2002
Felix Bretschneider , Christa Kopf , Markus Zolg, Process control for large complex systems, Proceedings of the 23rd conference on Winter simulation, p.1091-1100, December 08-11, 1991, Phoenix, Arizona, United States
David M. Kristol , David Lee , Arun N. Netravali , Krishan K. Sabnani, Efficient gateway synthesis from formal specifications, ACM SIGCOMM Computer Communication Review, v.21 n.4, p.89-97, Sept. 1991
David H. Lorenz, Tiling design patterns—a case study using the interpreter pattern, ACM SIGPLAN Notices, v.32 n.10, p.206-217, Oct. 1997
David Wagner , Paolo Soto, Mimicry attacks on host-based intrusion detection systems, Proceedings of the 9th ACM conference on Computer and communications security, November 18-22, 2002, Washington, DC, USA
Jane C. Hill , Andrew Wayne, A CYK approach to parsing in parallel: a case study, ACM SIGCSE Bulletin, v.23 n.1, p.240-245, Mar. 1991
Roel Wieringa, A survey of structured and object-oriented software specification methods and techniques, ACM Computing Surveys (CSUR), v.30 n.4, p.459-527, Dec. 1998
Surajit Chaudhuri , Moshe Y. Vardi, On the complexity of equivalence between recursive and nonrecursive Datalog programs, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.107-116, May 24-27, 1994, Minneapolis, Minnesota, United States
Steven P. Reiss , Manos Renieris, Encoding program executions, Proceedings of the 23rd International Conference on Software Engineering, p.221-230, May 12-19, 2001, Toronto, Ontario, Canada
Chris Faloutsos, Access methods for text, ACM Computing Surveys (CSUR), v.17 n.1, p.49-74, March 1985
John P. Nestor , E. S. Lee, Prerequisite confidentiality, Proceedings of the 2nd ACM Conference on Computer and communications security, p.282-293, November 1994, Fairfax, Virginia, United States
J. Kevin Lanctot , Ming Li , En-hui Yang, Estimating DNA sequence entropy, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.409-418, January 09-11, 2000, San Francisco, California, United States
Abraham Bookstein , Shmuel T. Klein, Compression, information theory, and grammars: a unified approach, ACM Transactions on Information Systems (TOIS), v.8 n.1, p.27-49, Jan. 1990
Jim Heath , Larry Welsch, Difficulties in parsing SGML, Proceedings of the ACM conference on Document processing systems, p.71-77, December 05-08, 1988, Santa Fe, New Mexico, United States
Paul A. Fishwick, Simulation model design, Proceedings of the 26th conference on Winter simulation, p.173-175, December 11-14, 1994, Orlando, Florida, United States
Vivek Sarkar , David Cann, POSC—a partitioning and optimizing SISAL compiler, ACM SIGARCH Computer Architecture News, v.18 n.3b, p.148-164, Sept. 1990
Edmund M. Clarke , Bernd-Holger Schlingloff, Model checking, Handbook of automated reasoning, Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 2001
Andrew Seawright , Forrest Brewer, Clairvoyant: a synthesis system for production-based specification, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
Tatsuru Matsushita , Colin Runciman, The accepting power of unary string logic programs, Theoretical Computer Science, v.266 n.1-2, p.59-79, 09/06/2001
Martin Fürer, The tight deterministic time hierarchy, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.8-16, May 05-07, 1982, San Francisco, California, United States
Robert Siegmund , Dietmar Müller, A novel synthesis technique for communication controller hardware from declarative data communication protocol specifications, Proceedings of the 39th conference on Design automation, June 10-14, 2002, New Orleans, Louisiana, USA
Vasanth Bala , Norman Rubin, Efficient instruction scheduling using finite state automata, Proceedings of the 28th annual international symposium on Microarchitecture, p.46-56, November 29-December 01, 1995, Ann Arbor, Michigan, United States
Tat-hung Chan, Reversal complexity of counter machines, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.146-157, May 11-13, 1981, Milwaukee, Wisconsin, United States
Noga Alon , A. K. Dewdney , Teunis J. Ott, Efficient simulation of finite automata by neural nets, Journal of the ACM (JACM), v.38 n.2, p.495-514, April 1991
Lan Zhang , Katsushi Inoue , Akira Ito , Yue Wang, Probabilistic rebound Turing machines, Theoretical Computer Science, v.270 n.1-2, p.739-760, January
Charles L. A. Clarke , Gordon V. Cormack, On the use of regular expressions for searching text, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.3, p.413-426, May 1997
Robert McNaughton , Paliath Narendran , Friedrich Otto, Church-Rosser Thue systems and formal languages, Journal of the ACM (JACM), v.35 n.2, p.324-344, April 1988
Yatin P. Saraiya, Hard problems for simple logic programs, ACM SIGMOD Record, v.19 n.2, p.64-73, Jun. 1990
Alon Y. Halevy , Inderpal Singh Mumick , Yehoshua Sagiv , Oded Shmueli, Static analysis in datalog extensions, Journal of the ACM (JACM), v.48 n.5, p.971-1012, September 2001
Frank Neven , Thomas Schwentick, Query automata over finite trees, Theoretical Computer Science, v.275 n.1-2, p.633-674, March 28 2002
Lance Fortnow , Duke Whang, Optimality and domination in repeated games with bounded players, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.741-749, May 23-25, 1994, Montreal, Quebec, Canada
Hao Chen , David Wagner, MOPS: an infrastructure for examining security properties of software, Proceedings of the 9th ACM conference on Computer and communications security, November 18-22, 2002, Washington, DC, USA
T. Y. Lin, Concurrent automata, database computers, and security: a “new” security paradigm for secure parallel processing, Proceedings on the 1992-1993 workshop on New security paradigms, p.94-104, August 1993, Little Compton, Rhode Island, United States
Alberto Pettorossi , Maurizio Proietti, Future directions in program transformation, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
Foto Afrati , Christos H. Papadimitriou, The parallel complexity of simple logic programs, Journal of the ACM (JACM), v.40 n.4, p.891-916, Sept. 1993
Joseph Bates , Alon Lavie, Recognizing substrings of LR(k) languages in linear time, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.1051-1077, May 1994
Bruce S. N. Cheung, Ambiguity in context-free grammars, Proceedings of the 1995 ACM symposium on Applied computing, p.272-276, February 26-28, 1995, Nashville, Tennessee, United States
Jayendran Venkateswaran , Mohammed Yaseen Kalachikan Jafferali , Young-Jun Son, Distributed simulation: an enabling technology for the evaluation of virtual enterprises, Proceedings of the 33nd conference on Winter simulation, December 09-12, 2001, Arlington, Virginia
Robert P. Nix, Editing by example, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.600-621, Oct. 1985
Y. H. Kuo , L. Y. Kung, Algorithmic state machine implementation with hybrid microprocessing/microprogramming scheme, ACM SIGMICRO Newsletter, v.17 n.4, p.54-67, Dec. 1986
Ramin Hojati, Layout optimization by pattern modification, Proceedings of the 27th ACM/IEEE conference on Design automation, p.632-637, June 24-27, 1990, Orlando, Florida, United States
John Case , Sanjay Jain , Mandayam Suraj, Control structures in hypothesis spaces: the influence on learning, Theoretical Computer Science, v.270 n.1-2, p.287-308, January
Ehud Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.413-510, Sep. 1989
Marco Carpentieri, On the simulation of quantum Turing machines, Theoretical Computer Science, v.304 n.1-3, p.103-128, 28 July 2003
Albert R. Meyer , Alexander Rabinovich, Valid identity problem for shuffle regular expressions, Journal of Automata, Languages and Combinatorics, v.7 n.1, p.109-125, July 2001
Bruce W. Watson, A new algorithm for the construction of minimal acyclic DFAs, Science of Computer Programming, v.48 n.2-3, p.81-97, August 2003
Serge Abiteboul , Moshe Y. Vardi , Victor Vianu, Fixpoint logics, relational machines, and computational complexity, Journal of the ACM (JACM), v.44 n.1, p.30-56, Jan. 1997
Sun Wu , Udi Manber, Fast text searching: allowing errors, Communications of the ACM, v.35 n.10, p.83-91, Oct. 1992
D. Harel , H. Lachover , A. Naamad , A. Pnueli , M. Politi , R. Sherman , a. Shtul-Trauring, Statemate: a working environment for the development of complex reactive systems, Proceedings of the 10th international conference on Software engineering, p.396-406, April 11-15, 1988, Singapore
Leonard Pitt , Manfred K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, Journal of the ACM (JACM), v.40 n.1, p.95-142, Jan. 1993
Haruo Hosoya , Benjamin Pierce, Regular expression pattern matching for XML, ACM SIGPLAN Notices, v.36 n.3, p.67-80, March 2001
Khalid Al-Kofahi , Alex Tyrrell , Arun Vachher , Peter Jackson, A machine learning approach to prior case retrieval, Proceedings of the 8th international conference on Artificial intelligence and law, p.88-93, May 2001, St. Louis, Missouri, United States
Dan Suciu , Jan Paredaens, Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.201-209, May 24-27, 1994, Minneapolis, Minnesota, United States
Kazuo Iwama , Akihiro Matsuura , Mike Paterson, A family of NFAs which need 2n - α deterministic states, Theoretical Computer Science, v.301 n.1-3, p.451-462, 14 May 2003
G. Ramalingam, The undecidability of aliasing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1467-1471, Sept. 1994
Julian Kupiec, MURAX: a robust linguistic approach for question answering using an on-line encyclopedia, Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, p.181-190, June 27-July 01, 1993, Pittsburgh, Pennsylvania, United States
Saumya K. Debray , Todd A. Proebsting, Interprocedural control flow analysis of first-order programs with tail-call optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.4, p.568-585, July 1997
S Cosmadakis , P Kanellakis, Parallel evaluation of recursive rule queries, Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.280-293, March 24-26, 1986, Cambridge, Massachusetts, United States
Ker-I. Ko, Integral equations, systems of quadratic equations, and exponential time completeness, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.10-20, May 05-08, 1991, New Orleans, Louisiana, United States
Yong K. Hwang , Narendra Ahuja, Gross motion planning—a survey, ACM Computing Surveys (CSUR), v.24 n.3, p.219-291, Sept. 1992
Dexter Kozen , Jens Palsberg , Michael I. Schwartzbach, Efficient recursive subtyping, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.419-428, March 1993, Charleston, South Carolina, United States
Luc Segoufin , Victor Vianu, Validating streaming XML documents, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 03-05, 2002, Madison, Wisconsin
Hagit Brit , Shlomo Moran , Gadi Taubenfeld, Public data structures: counters as a special case, Theoretical Computer Science, v.289 n.1, p.401-423, 23 October 2002
Hartmut Liefke , Dan Suciu, XMill: an efficient compressor for XML data, ACM SIGMOD Record, v.29 n.2, p.153-164, June 2000
Orna Grumberg , David E. Long, Model checking and modular verification, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.843-871, May 1994
Peter Mork , James F. Brinkley , Cornelius Rosse, OQAFMA Querying agent for the foundational model of anatomy: a prototype for providing flexible and efficient access to large semantic networks, Journal of Biomedical Informatics, v.36 n.6, p.501-517, December 2003
Makoto Murata , Akihiko Tozawa , Michiharu Kudo , Satoshi Hada, XML access control using static analysis, Proceedings of the 10th ACM conference on Computer and communications security, October 27-30, 2003, Washington D.C., USA
Marcella Anselmo, A non-ambiguous decomposition of regular languages and factorizing codes, Discrete Applied Mathematics, v.126 n.2-3, p.129-165, 15 March 2003
T. Higashino , G. V. Bochmann, Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters, IEEE Transactions on Software Engineering, v.20 n.1, p.29-42, January 1994
Antonín Kučera , Richard Mayr, Simulation preorder over simple process algebras, Information and Computation, v.173 n.2, p.184-198, March 15, 2002
Timothy Sherwood , Brad Calder, Automated design of finite state machine predictors for customized processors, ACM SIGARCH Computer Architecture News, v.29 n.2, p.86-97, May 2001
Jean Hartmann , Claudio Imoberdorf , Michael Meisinger, UML-Based integration testing, ACM SIGSOFT Software Engineering Notes, v.25 n.5, p.60-70, Sept. 2000
Ronald E. Wilson, Integrating a breadth-first curriculum with relevant programming projects in CS1/CS2, ACM SIGCSE Bulletin, v.27 n.1, p.214-217, March 1995
J.-C. Birget, Proof of a conjecture of R. Kannan, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.445-453, May 14-17, 1989, Seattle, Washington, United States
Mark W. Bailey , Jack W. Davidson, A formal model and specification language for procedure calling conventions, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.298-310, January 23-25, 1995, San Francisco, California, United States
Soumitra Bose , Prathima Agrawal , Vishwani D. Agrawal, Deriving Logic Systems for Path Delay Test Generation, IEEE Transactions on Computers, v.47 n.8, p.829-846, August 1998
K. Arthi , Kamala Krithivasan , Erzsébet Csuhaj-Varjú, On rule-number complexity of components of probabilistic cooperating distributed grammar systems, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.433-446, September 2002
Georg Gottlob , Nicola Leone , Francesco Scarcello, The complexity of acyclic conjunctive queries, Journal of the ACM (JACM), v.48 n.3, p.431-498, May 2001
Henning Fernau, Nonterminal complexity of programmed grammars, Theoretical Computer Science, v.296 n.2, p.225-251, 8 March 2003
Gang Luo , G. von Bochmann , A. Petrenko, Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method, IEEE Transactions on Software Engineering, v.20 n.2, p.149-162, February 1994
Rafael C. Carrasco , Mikel L. Forcada, Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks, IEEE Transactions on Knowledge and Data Engineering, v.13 n.2, p.148-156, March 2001
M. Antoniotti , C. Piazza , A. Policriti , M. Simeoni , B. Mishra, Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice, Theoretical Computer Science, v.325 n.1, p.45-67, 28 September 2004
Chuzo Iwamoto , Tomonobu Hatsuyama , Kenichi Morita , Katsunobu Imai, Constructible functions in cellular automata and their applications to hierarchy results, Theoretical Computer Science, v.270 n.1-2, p.797-809, January
Carlos I. Chesñevar , María L. Cobo , William Yurcik, Using theoretical computer simulators for formal languages and automata theory, ACM SIGCSE Bulletin, v.35 n.2, June 2003
Michel Rigo , Arnaud Maes, More on generalized automatic sequences, Journal of Automata, Languages and Combinatorics, v.7 n.3, p.351-376, January 2002
Ralf Kese , Friedrich Dudda , Marianne Kugler, Automatic proofreading of frozen phrases in German, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
Lan Zhang , Katsushi Inoue , Akira Ito , Yue Wang, A leaf-size hierarchy of alternating rebound Turing machines, Journal of Automata, Languages and Combinatorics, v.7 n.3, p.395-410, January 2002
Steen Rasmussen , Nils A. Baas , Bernd Mayer , Martin Nilsson , Michael W. Olesen, Ansatz for dynamical hierarchies, Artificial Life, v.7 n.4, p.329-353, March 2002
Nina Yevtushenko , Tiziano Villa , Robert K. Brayton , Alex Petrenko , Alberto L. Sangiovanni-Vincentelli, Solution of parallel language equations for logic synthesis, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
Andreas Malcher, Descriptional complexity of cellular automata and decidability questions, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.549-560, September 2002
Ravi Kannan, Alternation and the power of nondeterminism, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.344-346, December 1983
F. Lustman, Specifying Transaction-Based Information Systems with Regular Expressions, IEEE Transactions on Software Engineering, v.20 n.3, p.207-217, March 1994
Rafael C. Carrasco , Mikel L. Forcada, Incremental construction and maintenance of minimal finite-state automata, Computational Linguistics, v.28 n.2, p.207-216, June 2002
Hendrik Jan Hoogeboom , Nikè van Vugt, Upper bounds for restricted splicing, Formal and natural computing, Springer-Verlag New York, Inc., New York, NY, 2002
M. H. Albert , M. D. Atkinson , N. Ruškuc, Regular closed sets of permutations, Theoretical Computer Science, v.306 n.1-3, p.85-100, 5 September 2003
Thomas Buchholz , Andreas Klein , Martin Kutrib, On interacting automata with limited nondeterminism, Fundamenta Informaticae, v.52 n.1-3, p.15-38, September 2002
Kyriakos N. Sgarbas , Nikos D. Fakotakis , George K. Kokkinakis, Optimal insertion in deterministic DAWGs, Theoretical Computer Science, v.301 n.1-3, p.103-117, 14 May 2003
Viliam Geffert, Translation of binary regular expressions into nondeterministic ɛ-free automata with O(n log n)transitions, Journal of Computer and System Sciences, v.66 n.3, p.451-472, May 2003
Chin Lung Lu , Sheng-Lung Peng , Chuan Yi Tang, Efficient minus and signed domination in graphs, Theoretical Computer Science, v.301 n.1-3, p.381-397, 14 May 2003
Ralf H. Reussner, Automatic component protocol adaptation with the CoConut/J tool suite, Future Generation Computer Systems, v.19 n.5, p.627-639, July 2003
M. Beaudry , M. Holzer , G. Niemann , F. Otto, McNaughton families of languages, Theoretical Computer Science, v.290 n.3, p.1581-1628, 3 January 2003
Peggy Sullivan, Cut, paste and filter, Discrete Applied Mathematics, v.128 n.2-3, p.465-485, 01 June 2003
Anne Brüggemann-Klein , Derick Wood, On predictive parsing and extended context-free grammars, Computer science in perspective, Springer-Verlag New York, Inc., New York, NY, 2003
Andrzej S. Murawski, Functions with local state: regularity and undecidability, Theoretical Computer Science, v.338 n.1-3, p.315-349, 10 June 2005
Antonín Kučera, The complexity of bisimilarity-checking for one-counter processes, Theoretical Computer Science, v.304 n.1-3, p.157-183, 28 July 2003
Richard Hull , Michael Benedikt , Vassilis Christophides , Jianwen Su, E-services: a look behind the curtain, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.1-14, June 09-11, 2003, San Diego, California
Gösta Grahne , Alex Thomo, Query containment and rewriting using views for regular path queries under constraints, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.111-122, June 09-11, 2003, San Diego, California
John Hopcroft, Automata theory: its past and future, A half-century of automata theory: celebration and inspiration, World Scientific Publishing Co., Inc., River Edge, NJ, 2001
Ning Zhong , Klaus Weihrauch, Computability theory of generalized functions, Journal of the ACM (JACM), v.50 n.4, p.469-505, July 2003
Domenico Beneventano , Sonia Bergamaschi , Claudio Sartori, Description logics for semantic query optimization in object-oriented database systems, ACM Transactions on Database Systems (TODS), v.28 n.1, p.1-50, March 2003
Stephen A. Edwards, Tutorial: Compiling concurrent languages for sequential processors, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.8 n.2, p.141-187, April 2003
Stephan Merz, Model checking: a tutorial overview, Modeling and verification of parallel processes, Springer-Verlag New York, Inc., New York, NY, 2001
Mark W. Bailey , Jack W. Davidson, Automatic Detection and Diagnosis of Faults in Generated Code for Procedure Calls, IEEE Transactions on Software Engineering, v.29 n.11, p.1031-1042, November 2003
Tova Milo , Serge Abiteboul , Bernd Amann , Omar Benjelloun , Fred Dang Ngoc, Exchanging intensional XML data, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
Yong Xiao , Amr Sabry , Zena M. Ariola, From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition, Higher-Order and Symbolic Computation, v.14 n.4, p.387-409, December 2001
Michael Domaratzki , Derek Kisman , Jeffrey Shallit, On the number of distinct languages accepted by finite automata with n states, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.469-486, September 2002
John Dowding , Beth Ann Hockey , Jean Mark Gawron , Christopher Culy, Practical issues in compiling typed unification grammars for speech recognition, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, p.164-171, July 06-11, 2001, Toulouse, France
Priti Shankar , Amitava Dasgupta , Kaustubh Deshmukh , B. Sundar Rajan, On viewing block codes as finite automata, Theoretical Computer Science, v.290 n.3, p.1775-1797, 3 January 2003
Levent Yilmaz, Verification and validation: automated object-flow testing of dynamic process interaction models, Proceedings of the 33nd conference on Winter simulation, December 09-12, 2001, Arlington, Virginia
Salvatore La Torre , Margherita Napoli, Finite automata on timed ω-trees, Theoretical Computer Science, v.293 n.3, p.479-505, 9 February 2003
Ruggero Lanotte , Andrea Maggiolo-Schettini , Adriano Peron , Simone Tini, Dynamic hierarchical machines, Fundamenta Informaticae, v.54 n.2-3, p.237-252, February 2003
B. Ravikumar , G. Eisman, Weak minimization of DFA: an algorithm and applications, Theoretical Computer Science, v.328 n.1-2, p.113-133, 29 November 2004
Gösta Grahne , Alex Thomo, Algebraic rewritings for optimizing regular path queries, Theoretical Computer Science, v.296 n.3, p.453-471, 14 March 2003
Michael Domaratzki, State complexity of proportional removals, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.455-468, September 2002
Kee-Eung Kim , Thomas Dean, Solving factored MDPs using non-homogeneous partitions, Artificial Intelligence, v.147 n.1-2, p.225-251, July 2003
Ashish Kumar Gupta , Dan Suciu, Stream processing of XPath queries with predicates, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
Viliam Geffert , Carlo Mereghetti , Giovanni Pighizzini, Converting two-way nondeterministic unary automata into simpler automata, Theoretical Computer Science, v.295 n.1-3, p.189-203, 24 February 2003
Carlos Martín-Vide , Victor Mitrana , Ralf Stiebe, Weighted grammars and automata with threshold interpretation, Journal of Automata, Languages and Combinatorics, v.8 n.2, p.303-318, April 2003
Kosaburo Hashiguchi , Yoshito Wada , Shuji Jimbo, Regular binoid expressions and regular binoid languages, Theoretical Computer Science, v.304 n.1-3, p.291-313, 28 July 2003
Lucian Ilie , Sheng Yu, Reducing NFAs by invariant equivalences, Theoretical Computer Science, v.306 n.1-3, p.373-390, 5 September 2003
Brian J. Ross, The evolution of stochastic regular motifs for protein sequences, New Generation Computing, v.20 n.2, p.187-213, April 2002
Juraj Hromkovič, Descriptional complexity of finite automata: concepts and open problems, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.519-531, September 2002
L. Bréhélin , O. Gascuel , G. Caraux, Hidden Markov Models with Patterns to Learn Boolean Vector Sequences and Application to the Built-In Self-Test for Integrated Circuits, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.23 n.9, p.997-1008, September 2001
Alfonso Ortega de la Puente , Rafael Sánchez Alfonso , Manuel Alfonseca Moreno, Automatic composition of music by means of grammatical evolution, ACM SIGAPL APL Quote Quad, v.32 n.4, p.148-155, June 2002
Wayne Wolf, Decomposing data machines, Proceedings of the conference on European design automation, February 25-28, 1991, Amsterdam, The Netherlands
Lucian Ilie , Sheng Yu, Follow automata, Information and Computation, v.186 n.1, p.140-162, 10 October 2003
Dale Gerdemann, Parsing as tree traversal, Proceedings of the 15th conference on Computational linguistics, August 05-09, 1994, Kyoto, Japan
Zhiyi Chi , Stuart Geman, Estimation of probabilistic context-free grammars, Computational Linguistics, v.24 n.2, June 1998
Tullio Ceccherini-Silberstein , Antonio Machì , Fabio Scarabotti, On the entropy of regular languages, Theoretical Computer Science, v.307 n.1, p.93-102, 26 September 2003
Omid Madani , Steve Hanks , Anne Condon, On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, v.147 n.1-2, p.5-34, July 2003
Olivier Ly, Automatic graphs and D0L-sequences of finite graphs, Journal of Computer and System Sciences, v.67 n.3, p.497-545, November 2003
M. Sakthi Balan , Kamala Krithivasan , Mutyam Madhu, Some variants in communication of parallel communicating pushdown automata, Journal of Automata, Languages and Combinatorics, v.8 n.3, p.401-416, 06/01/2003
Peter Buneman , Susan Davidson , Wenfei Fan , Carmem Hara , Wang-Chiew Tan, Reasoning about keys for XML, Information Systems, v.28 n.8, p.1037-1063, December 2003
Georg Gottlob , Christoph Koch, Monadic datalog and the expressive power of languages for Web information extraction, Journal of the ACM (JACM), v.51 n.1, p.74-113, January 2004
Dimitra Giannakopoulou , Jeff Magee, Fluent model checking for event-based systems, ACM SIGSOFT Software Engineering Notes, v.28 n.5, September 2003
Michel Rigo, The commutative closure of a binary slip-language is context-free: a new proof, Discrete Applied Mathematics, v.131 n.3, p.665-672, 28 September 2003
Flavio D'Alessandro, On the complexity of Simon automata over the Dyck language, Journal of Automata, Languages and Combinatorics, v.8 n.3, p.465-476, 06/01/2003
Serge Abiteboul , Omar Benjelloun , Bogdan Cautis , Ioana Manolescu , Tova Milo , Nicoleta Preda, Lazy query evaluation for Active XML, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
Joaquín Peña , Rafael Corchuelo , José L. Arjona, A top down approach for MAS protocol descriptions, Proceedings of the 2003 ACM symposium on Applied computing, March 09-12, 2003, Melbourne, Florida
Stephan K. Chalup , Alan D. Blair, Incremental training of first order recurrent neural networks to predict a context-sensitive language, Neural Networks, v.16 n.7, p.955-972, September 2003
Andreas Kerren, Generation as method for explorative learning in computer science education, ACM SIGCSE Bulletin, v.36 n.3, September 2004
Theresa Beaubouef, Why computer science students need language, ACM SIGCSE Bulletin, v.35 n.4, December 2003
Kosaburo Hashiguchi , Takahiro Kunai , Shuji Jimbo, Finite codes over free binoids, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.505-518, September 2002
Steven Bird , T. Mark Ellison, One-level phonology: autosegmental representations and rules as finite automata, Computational Linguistics, v.20 n.1, p.55-90, March 1994
Robin Sommer , Vern Paxson, Enhancing byte-level network intrusion detection signatures with context, Proceedings of the 10th ACM conference on Computer and communications security, October 27-30, 2003, Washington D.C., USA
C. Raymond Perrault, On the mathematical properties of linguistic theories, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts
Giuseppe Di Fabbrizio , Charles Lewis, An xpath-based discourse analysis module for spoken dialogue systems, Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, May 19-21, 2004, New York, NY, USA
D. Calvanese , G. De Giacomo , M. Lenzerini , M. Y. Vardi, Reasoning on regular path queries, ACM SIGMOD Record, v.32 n.4, December 2003
Shinsuke Mori , Makoto Nagao, A stochastic language model using dependency and its improvement by word clustering, Proceedings of the 17th international conference on Computational linguistics, p.898-904, August 10-14, 1998, Montreal, Quebec, Canada
Gennaro Costagliola , Vincenzo Deufemia , Filomena Ferrucci , Carmine Gravino, On regular drawn symbolic picture languages, Information and Computation, v.187 n.2, p.209-245, 15 December 2003
Raghu Ramakrishnan , Catriel Beeri , Ravi Krishnamurthy, Optimizing existential datalog queries, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.89-102, March 1988, Austin, Texas, United States
Richard Raimi , Ramin Hojati , Kedar S. Namjoshi, Environment modeling and language universality, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.5 n.3, p.705-725, July 2000
Lee Schruben, A “disposable” graphical event synthesizer for teaching simulation model building, Proceedings of the 19th conference on Winter simulation, p.72-76, December 14-16, 1987, Atlanta, Georgia, United States
Yu Lin-Kriz , Victor Pan, On parallel complexity of integer linear programming, GCD and the iterated mod function, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.124-137, September 1992, Orlando, Florida, United States
Anthony J. Bonner, Workflow, transactions and datalog, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.294-305, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
Esko Ukkonen, A decision method for the equivalence of some non-real-time deterministic pushdown automata, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.29-38, April 28-30, 1980, Los Angeles, California, United States
Rajeev Alur , Thomas A. Henzinger, A really temporal logic, Journal of the ACM (JACM), v.41 n.1, p.181-203, Jan. 1994
David E. Muller , Paul E. Schupp, Pushdown automata, graphs, ends, second-order logic, and reachability problems, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.46-54, May 11-13, 1981, Milwaukee, Wisconsin, United States
Sanjay Jain , Arun Sharma, On the intrinsic complexity of language identification, Proceedings of the seventh annual conference on Computational learning theory, p.278-286, July 12-15, 1994, New Brunswick, New Jersey, United States
Bruce Litow, Computing a context-free grammar-generating series, Information and Computation, v.169 n.2, p.174-185, September 15, 2001
Alessandra Cherubini , Stefano Crespi Reghizzi , Pierluigi San Pietro, Associative language descriptions, Theoretical Computer Science, v.270 n.1-2, p.463-491, January
Stephen Edwards , Luciano Lavagno , Edward A. Lee , Alberto Sangiovanni-Vincentelli, Design of embedded systems: formal models, validation, and synthesis, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
S. Paul , A. Prakash, A Framework for Source Code Search Using Program Patterns, IEEE Transactions on Software Engineering, v.20 n.6, p.463-475, June 1994
Sanjay Jain , Arun Sharma, Probability is more powerful than team for language identification from positive data, Proceedings of the sixth annual conference on Computational learning theory, p.192-198, July 26-28, 1993, Santa Cruz, California, United States
Michael Codish , Saumya K. Debray , Roberto Giacobazzi, Compositional analysis of modular logic programs, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.451-464, March 1993, Charleston, South Carolina, United States
Peter T. Wood, Magic factoring of closure programs (extended abstract), Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.174-183, May 22-25, 1995, San Jose, California, United States
John H. Reif, Parallel molecular computation, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.213-223, June 24-26, 1995, Santa Barbara, California, United States
D T Huynh, The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.405-412, May 06-08, 1985, Providence, Rhode Island, United States
Lei Zhou , Elke A. Rundensteiner , Kang G. Shin, Schema Evolution of an Object-Oriented Real-Time Database System for Manufacturing Automation, IEEE Transactions on Knowledge and Data Engineering, v.9 n.6, p.956-977, November 1997
David Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness, Journal of the ACM (JACM), v.33 n.1, p.224-248, Jan. 1986
Jik H. Chang , Oscar H. Ibarra , Anastasios Vergis, On the power of one-way communication, Journal of the ACM (JACM), v.35 n.3, p.697-726, July 1988
Antonín Kuča , Richard Mayr, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Theoretical Computer Science, v.270 n.1-2, p.677-700, January
Songwen Xu , Yam San Chee, Transformation-Based Diagnosis of Student Programs for Programming Tutoring Systems, IEEE Transactions on Software Engineering, v.29 n.4, p.360-384, April 2003
Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter, Pattern-matching problems for two-dimensional images described by finite automata, Nordic Journal of Computing, v.7 n.1, p.1-13, Spring 2000
Giovanna Guaiana , Antonio Restivo , Sergio Salemi, On the trace product and some families of languages closed under partial commutations, Journal of Automata, Languages and Combinatorics, v.9 n.1, p.61-79, January 2004
Jeffrey Shallit , Ming-wei Wang, On two-sided infinite fixed points of morphisms, Theoretical Computer Science, v.270 n.1-2, p.659-675, January
Cezar Câmpeanu , Wing Hong Ho, The maximum state complexity for finite languages, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.189-202, September 2004
Juan Antonio Pérez-Ortiz , Jorge Calera-Rubio , Mikel L. Forcada, Online Text Prediction with Recurrent Neural Networks, Neural Processing Letters, v.14 n.2, p.127-140, October 2001
G. Duchamp , M. Flouret , É. Laugerotte , J.-G. Luque, Direct and dual laws for automata with multiplicities, Theoretical Computer Science, v.267 n.1-2, p.105-120, 09/26/2001
Martin Kappes , Chandra M. R. Kintala, Tradeoffs between reliability and conciseness of deterministic finite automata, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.281-292, September 2004
Changwook Kim, Two undecidability results for chain code picture languages, Theoretical Computer Science, v.270 n.1-2, p.969-976, January
Sanjay Jain , Efim Kinber, Intrinsic complexity of learning geometrical concepts from positive data, Journal of Computer and System Sciences, v.67 n.3, p.546-607, November 2003
Andreas Malcher, On one-way cellular automata with a fixed number of cells, Fundamenta Informaticae, v.58 n.3-4, p.355-368, December 2003
Luigi Palopoli , Riccardo Torlone, Generalized Production Rules as a Basis for Integrating Active and Deductive Databases, IEEE Transactions on Knowledge and Data Engineering, v.9 n.6, p.848-862, November 1997
F. Luccio, Algorithms, nymphs, and shepherds, Theoretical Computer Science, v.282 n.2, p.223-229, 10 June 2002
Marc Andries , Luca Cabibbo , Jan Paredaens , Jan van den Bussche, Applying an update method to a set of receivers, ACM Transactions on Database Systems (TODS), v.26 n.1, p.1-40, March 2001
I. Parberry, A Note on Nondeterminism in Small, Fast Parallel Computers, IEEE Transactions on Computers, v.38 n.5, p.766-767, May 1989
Adam L. Buchsbaum , Raffaele Giancarlo, Algorithmic aspects in speech recognition: an introduction, Journal of Experimental Algorithmics (JEA), 2, p.1-es, 1997
George J. Milne, The Formal Description and Verification of Hardware Timing, IEEE Transactions on Computers, v.40 n.7, p.811-826, July 1991
Cornelia E. Dowling , Cord Hockemeyer, Automata for the Assessment of Knowledge, IEEE Transactions on Knowledge and Data Engineering, v.13 n.3, p.451-461, May 2001
James A. Whittaker , Michael G. Thomason, A Markov Chain Model for Statistical Software Testing, IEEE Transactions on Software Engineering, v.20 n.10, p.812-824, October 1994
G. Edward Barton, On the complexity of ID/LP parsing 1, Computational Linguistics, v.11 n.4, p.205-218, October-December 1985
Oege De Moor , David Lacey , Eric Van Wyk, Universal Regular Path Queries, Higher-Order and Symbolic Computation, v.16 n.1-2, p.15-35, March-June 2003
Nicolae Santean, Bimachines and structurally-reversed automata, Journal of Automata, Languages and Combinatorics, v.9 n.1, p.121-146, January 2004
Brian Roark, Probabilistic top-down parsing and language modeling, Computational Linguistics, v.27 n.2, p.249-276, June 2001
David Hemmendinger, Specifying Ada Server Tasks with Executable Formal Grammars, IEEE Transactions on Software Engineering, v.16 n.7, p.741-754, July 1990
Toshikazu Wada , Takashi Matsuyama, Multiobject Behavior Recognition by Event Driven Selective Attention Method, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.22 n.8, p.873-887, August 2000
Jiří Wiedermann, Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines, Theoretical Computer Science, v.317 n.1-3, p.61-69, June 4, 2004
Joost Engelfriet , Sebastian Maneth, Output string languages of compositions of deterministic macro tree transducers, Journal of Computer and System Sciences, v.64 n.2, p.350-395, March 2002
Richard St-Denis, Designing reactive systems: integration of abstraction techniques into a synthesis procedure, Journal of Systems and Software, v.60 n.2, p.103-112, 1 February 2002
Imad A. Al-Sughaiyer , Ibrahim A. Al-Kharashi, Arabic morphological analysis techniques: a comprehensive survey, Journal of the American Society for Information Science and Technology, v.55 n.3, p.189-213, February 2004
Lance Fortnow , John D. Rogers, Separability and one-way functions, Computational Complexity, v.11 n.3/4, p.137-157, March 2003
T. R. S. Walsh, The busy beaver on a one-way infinite tape, ACM SIGACT News, v.14 n.1, p.38-43, Winter 1982
Bruce W. Watson, Reducing memory requirements in reachability-based finite automata operations, Software—Practice & Experience, v.34 n.3, p.239-248, March 2004
Akinori Yonezawa , Ichiro Ohsawa, Object-oriented parallel parsing for context-free grammars, Proceedings of the 12th conference on Computational linguistics, p.773-778, August 22-27, 1988, Budapest, Hungry
Carl Vogel , Ulrike Hahn , Holly Branigan, Cross-serial dependencies are not hard to process, Proceedings of the 16th conference on Computational linguistics, August 05-09, 1996, Copenhagen, Denmark
Claude Sureson, Analytic sets in descriptive set theory and NP sets in complexity theory, Fundamenta Informaticae, v.50 n.1, p.77-110, March 2002
Michael Domaratzki, Deletion along trajectories, Theoretical Computer Science, v.320 n.2-3, p.293-313, June 14, 2004
Karl-Michael Schneider, Parsing schemata for grammars with variable number and order of constituents, Proceedings of the 18th conference on Computational linguistics, July 31-August 04, 2000, Saarbrücken, Germany
Simonetta Balsamo , Antinisca Di Marco , Paola Inverardi , Marta Simeoni, Model-Based Performance Prediction in Software Development: A Survey, IEEE Transactions on Software Engineering, v.30 n.5, p.295-310, May 2004
David Watson , G. Robert Malan , Farnam Jahanian, An extensible probe architecture for network protocol performance measurement, Software—Practice & Experience, v.34 n.1, p.47-67, January 2004
Sergei Vorobyov, The most nonelementary theory, Information and Computation, v.190 n.2, p.196-219, 1 May 2004
Danny Chen , Raymond K. Wong, Optimizing the lazy DFA approach for XML stream processing, Proceedings of the fifteenth Australasian database conference, p.131-140, January 01, 2004, Dunedin, New Zealand
Lynette van Zijl, Generalized acceptance, succinctness and supernondeterministic finite automata, Theoretical Computer Science, v.313 n.1, p.159-172, 16 February 2004
Gertjan van Noord, The intersection of finite state automata and definite clause grammars, Proceedings of the 33rd annual meeting on Association for Computational Linguistics, p.159-165, June 26-30, 1995, Cambridge, Massachusetts
Mark Perlin, LR recursive transition networks for Earley and Tomita parsing, Proceedings of the 29th annual meeting on Association for Computational Linguistics, p.98-105, June 18-21, 1991, Berkeley, California
Yanlei Diao , Mehmet Altinel , Michael J. Franklin , Hao Zhang , Peter Fischer, Path sharing and predicate evaluation for high-performance XML filtering, ACM Transactions on Database Systems (TODS), v.28 n.4, p.467-516, December 2003
Jeremy Buhler , Uri Keich , Yanni Sun, Designing seeds for similarity search in genomic DNA, Journal of Computer and System Sciences, v.70 n.3, p.342-363, May 2005
Michael Domaratzki, Trajectory-based embedding relations, Fundamenta Informaticae, v.59 n.4, p.349-363, March 2004
Mark Johnson , Brian Roark, Compact non-left-recursive grammars using the selective left-corner transform and factoring, Proceedings of the 18th conference on Computational linguistics, p.355-361, July 31-August 04, 2000, Saarbrücken, Germany
George Anton Kiraz, Multi-tape two-level morphology: a case study in semitic non-linear morphology, Proceedings of the 15th conference on Computational linguistics, August 05-09, 1994, Kyoto, Japan
Manuel Lameiras Campagnolo, Continuous-time computation with restricted integration capabilities, Theoretical Computer Science, v.317 n.1-3, p.147-165, June 4, 2004
Ralf Kese , Friedrich Dudda , Marianne Kugler, Automatic proofreading of frozen phrases in German, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
QingShi Gao , Yue Hu , Li Li , XiaoYu Gao, Semantic language and multi-language MT approach based on SL, Journal of Computer Science and Technology, v.18 n.6, p.848-852, November 2003
T. Y. Lin, Extensions of pushdown automata and Petri nets, Proceedings of the 17th conference on ACM Annual Computer Science Conference, February 21-23, 1989, Louisville, Kentucky
Mark Daley , Lila Kari , Ian McQuillan, Families of languages defined by ciliate bio-operations, Theoretical Computer Science, v.320 n.1, p.51-69, 12 June 2004
Robert Siegmund , Dietmar Müller, Automatic Synthesis of Communication Controller Hardware from Protocol Specifications, IEEE Design & Test, v.19 n.4, p.84-95, July 2002
Bjørn Olstad , Anders H. Torp, Encoding of a priori Information in Active Contour Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.18 n.9, p.863-872, September 1996
Ryszard Janicki , Emil Sekerinski, Foundations of the Trace Assertion Method of Module Interface Specification, IEEE Transactions on Software Engineering, v.27 n.7, p.577-598, July 2001
Matthew Young-Lai , Frank Wm. Tompa, Stochastic Grammatical Inference of Text Database Structure, Machine Learning, v.40 n.2, p.111-137, Aug. 2000
Ralf Kese , Friedrich Dudda , Gerhard Heyer , Marianne Kugler, Extended spelling correction for German, Proceedings of the third conference on Applied natural language processing, March 31-April 03, 1992, Trento, Italy
Richard Hull , Jianwen Su, Tools for design of composite Web services, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
Jason Eisner , Giorgio Satta, Efficient parsing for bilexical context-free grammars and head automaton grammars, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, p.457-464, June 20-26, 1999, College Park, Maryland
Bijit Hore , Hakan Hacigumus , Bala Iyer , Sharad Mehrotra, Indexing text data under space constraints, Proceedings of the thirteenth ACM international conference on Information and knowledge management, November 08-13, 2004, Washington, D.C., USA
Fan Zhang , To-yat Cheung, Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines, IEEE Transactions on Software Engineering, v.29 n.1, p.1-14, January 2003
Dan Suciu, From searching text to querying XML streams, Journal of Discrete Algorithms, v.2 n.1, p.17-32, March 2004
Yasubumi Sakakibara, Grammatical Inference in Bioinformatics, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.7, p.1051-1062, July 2005
Hellis Tamm , Esko Ukkonen, Bideterministic automata and minimal representations of regular languages, Theoretical Computer Science, v.328 n.1-2, p.135-149, 29 November 2004
Khalil Sima'an, Computational complexity of probabilistic disambiguation by means of tree-grammars, Proceedings of the 16th conference on Computational linguistics, August 05-09, 1996, Copenhagen, Denmark
Dino Mandrioli, On teaching theoretical foundations of Computer Science, ACM SIGACT News, v.14 n.4, p.58-69, Fall-Winter 1982
Matteo Cavaliere , Peter Leupold, Evolution and observation: a non-standard way to generate formal languages, Theoretical Computer Science, v.321 n.2-3, p.233-248, 16 August 2004
Rida A. Bazzi , Gil Neiger , Gary L. Peterson, On the use of registers in achieving wait-free consensus, Distributed Computing, v.10 n.3, p.117-127, April 1997
Tero Harju , Juhani Karhumäki, Many aspects of defect theorems, Theoretical Computer Science, v.324 n.1, p.35-54, 16 September 2004
François Denis , Aurélien Lemay , Alain Terlutte, Learning regular languages using RFSAs, Theoretical Computer Science, v.313 n.2, p.267-294, 17 February 2004
Cezar Câmpeanu , Sheng Yu, Pattern expressions and pattern automata, Information Processing Letters, v.92 n.6, p.267-274, 31 December 2004
Dines Bjørner , Jorge R. Cuéllar, Software engineering education: Rôles of formal specification and design calculi, Annals of Software Engineering, v.6 n.1-4, p.365-409, April 1999
Raghavendra Rao Loka, A note on parallel parsing, ACM SIGPLAN Notices, v.19 n.1, p.57-59, January 1984
Luke O'connor, On String Replacement Exponentiation, Designs, Codes and Cryptography, v.23 n.2, p.173-184, July 2001
Tae-Sun Chung , Hyoung-Joo Kim, XML query processing using document type definitions, Journal of Systems and Software, v.64 n.3, p.195-205, 15 December 2002
Michel Wermelinger , Artur Miguel Dias, A prolog toolkit for formal languages and automata, Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education, June 27-29, 2005, Caparica, Portugal
Frank J. Seinstra , Dennis Koelma , Andrew D. Bagdanov, Finite State Machine-Based Optimization of Data Parallel Regular Domain Problems Applied in Low-Level Image Processing, IEEE Transactions on Parallel and Distributed Systems, v.15 n.10, p.865-877, October 2004
Sanjay Jain , Frank Stephan, Learning how to separate, Theoretical Computer Science, v.313 n.2, p.209-228, 17 February 2004
Noga Alon , Tova Milo , Frank Neven , Dan Suciu , Victor Vianu, XML with data values: typechecking revisited, Journal of Computer and System Sciences, v.66 n.4, p.688-727, 1 June 2003
Shankara Narayanan Krishna , Adrei Paun, Results on catalytic and evolution-communication P systems, New Generation Computing, v.22 n.4, p.377-394, December 2004
Shuvra S. Bhattacharyya , Praveen K. Murthy, The CBP Parameter: A Module Characterization Approach for DSP Software Optimization, Journal of VLSI Signal Processing Systems, v.38 n.2, p.131-146, September 2004
Raghavendra Rao Loka, A note on parallel parsing, ACM SIGPLAN Notices, v.19 n.7, July 1984
Flavio A. Ferrarotti , José M. Turull-Torres, On the computation of approximations of database queries, Proceedings of the fifteenth Australasian database conference, p.27-37, January 01, 2004, Dunedin, New Zealand
Hubie Chen , Riccardo Pucella, A coalgebraic approach to Kleene algebra with tests, Theoretical Computer Science, v.327 n.1-2, p.23-44, 25 October 2004
Laura K. Dillon , R. E. Kurt Stirewalt, Inference Graphs: A Computational Structure Supporting Generation of Customizable and Correct Analysis Components, IEEE Transactions on Software Engineering, v.29 n.2, p.133-150, February 2003
Jun-Ki Min , Chin-Wan Chung , Kyuseok Shim, An adaptive path index for XML data using the query workload, Information Systems, v.30 n.6, p.467-487, September 2005
Subbarao Kambhampati, A comparative analysis of partial order planning and task reduction planning, ACM SIGART Bulletin, v.6 n.1, p.16-25, Jan. 1995
Frantisek Plasil , Stanislav Visnovsky, Behavior Protocols for Software Components, IEEE Transactions on Software Engineering, v.28 n.11, p.1056-1076, November 2002
Toshinori Watanabe , Ken Sugawara , Hiroshi Sugihara, A New Pattern Representation Scheme Using Data Compression, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.5, p.579-590, May 2002
B. Ravikumar, Peg-solitaire, string rewriting systems and finite automata, Theoretical Computer Science, v.321 n.2-3, p.383-394, 16 August 2004
Patricia Bouyer , Catherine Dufourd , Emmanuel Fleury , Antoine Petit, Updatable timed automata, Theoretical Computer Science, v.321 n.2-3, p.291-345, 16 August 2004
Thomas A. Henzinger , Rupak Majumdar , Jean-François Raskin, A classification of symbolic transition systems, ACM Transactions on Computational Logic (TOCL), v.6 n.1, p.1-32, January 2005
James M. Cargal, Social relations as algebraic relations, Proceedings of the 12th conference on Winter simulation, p.139-153, December 03-05, 1980, Orlando, FL
David Harel , Amir Pnueli , Hagi Lachover , Amnon Naamad , Michal Politi , Rivi Sherman , Aharon Shtull-Trauring , Mark Trakhtenbrot, STATEMATE: A Working Environment for the Development of Complex Reactive Systems, IEEE Transactions on Software Engineering, v.16 n.4, p.403-414, April 1990
Walter J. Savitch, A formal model for context-free languages augmented with reduplication, Computational Linguistics, v.15 n.4, p.250-261, December 1989
Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel, All superlinear inverse schemes are coNP-hard, Theoretical Computer Science, v.345 n.2-3, p.345-358, 22 November 2005
Paola Inverardi , Leonardo Mostarda , Massimo Tivoli , Marco Autili, Synthesis of correct and distributed adaptors for component-based systems: an automatic approach, Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering, November 07-11, 2005, Long Beach, CA, USA
Xipeng Shen , Yutao Zhong , Chen Ding, Locality phase prediction, ACM SIGOPS Operating Systems Review, v.38 n.5, December 2004
Sigrid Ewert , Andries van der Walt, A pumping lemma for random permitting context languages, Theoretical Computer Science, v.270 n.1-2, p.959-967, January
Clifford Bergman , Giora Slutzki, Computational complexity of some problems involving congruences on algebras, Theoretical Computer Science, v.270 n.1-2, p.591-608, January
Daowen Qiu, Automata theory based on quantum logic: some characterizations, Information and Computation, v.190 n.2, p.179-195, 1 May 2004
Teodor Rus, A unified language processing methodology, Theoretical Computer Science, v.281 n.1-2, p.499-536, June 3 2002
Robert C. Berwick, Computational complexity and lexical-functional grammar, Computational Linguistics, v.8 n.3-4, p.97-109, July-December 1982
Marisa Llorens , Javier Oliver, Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets, IEEE Transactions on Computers, v.53 n.9, p.1147-1158, September 2004
Christian W. Omlin , C. Lee Giles, Rule Revision With Recurrent Neural Networks, IEEE Transactions on Knowledge and Data Engineering, v.8 n.1, p.183-188, February 1996
Hans-Ulrich Krieger , Hannes Pirker , John Nerbonne, Feature-based allomorphy, Proceedings of the 31st annual meeting on Association for Computational Linguistics, p.140-147, June 22-26, 1993, Columbus, Ohio
Giorgio Satta, Review of "Parsing with principles and classes of information" by Paola Merlo. Kluwer Academic Publishers 1996., Computational Linguistics, v.24 n.1, March 1998
Peter Bruhn , Andreas Geyer-Schulz, Genetic programming over context-free languages with linear constraints for the knapsack problem: first results, Evolutionary Computation, v.10 n.1, p.51-74, Spring 2002
Pierre Nicodème , Bruno Salvy , Philippe Flajolet, Motif statistics, Theoretical Computer Science, v.287 n.2, p.593-617, 28 September 2002
Marianne Delorme , Jacques Mazoyer, Pebble automata: figures families recognition and universality, Fundamenta Informaticae, v.52 n.1-3, p.81-132, September 2002
Yves Vander Auwera , Luc Bernard, New proposal for a common command language in information systems, ACM SIGMOD Record, v.13 n.1, p.51-78, September 1982
Mark Seligman , Christian Boitet , Boubaker Meddeb-Hamrouni, Transforming lattices into non-deterministic automata with optional null arcs, Proceedings of the 17th international conference on Computational linguistics, p.1205-1211, August 10-14, 1998, Montreal, Quebec, Canada
Gabriele Ricci, Some analytic features of algebraic data, Discrete Applied Mathematics, v.122 n.1-3, p.235-249, 15 October 2002
Michael Domaratzki , Giovanni Pighizzini , Jeffrey Shallit, Simulating finite automata with context-free grammars, Information Processing Letters, v.84 n.6, p.339-344, 31 December 2002
Lane A. Hemaspaandra , Mayur Thakur, Lower bounds and the hardness of counting properties, Theoretical Computer Science, v.326 n.1-3, p.1-28, 20 October 2004
Björn Borchardt, A pumping lemma and decidability problems for recognizable tree series, Acta Cybernetica, v.16 n.4, p.509-544, 2004
Vladimir A. Kulyukin , Robin Burke, Mining free text for structure, Data mining: opportunities and challenges, Idea Group Publishing, Hershey, PA, 2003
Robert H. Bourdeau , Betty H. C. Cheng, A Formal Semantics for Object Model Diagrams, IEEE Transactions on Software Engineering, v.21 n.10, p.799-821, October 1995
Joseph B. Weinman, Nestable bracketed comments, ACM SIGPLAN Notices, v.18 n.10, October 1983
Ramkrishna Chatterjee , Barbara G. Ryder , William A. Landi, Complexity of Points-To Analysis of Java in the Presence of Exceptions, IEEE Transactions on Software Engineering, v.27 n.6, p.481-512, June 2001
J.-M. Champarnaud , D. Ziadi, Canonical derivatives, partial derivatives and finite automaton constructions, Theoretical Computer Science, v.289 n.1, p.137-163, 23 October 2002
Gaoyan Xie , Cheng Li , Zhe Dang, Linear reachability problems and minimal solutions to linear Diophantine equation systems, Theoretical Computer Science, v.328 n.1-2, p.203-219, 29 November 2004
Mehryar Mohri, Finite-state transducers in language and speech processing, Computational Linguistics, v.23 n.2, p.269-311, June 1997
Olivier Carton , Max Michel, Unambiguous Büchi automata, Theoretical Computer Science, v.297 n.1-3, p.37-81, 17 March 2003
Richard R. Brooks , Nathan Orr, A Model for Mobile Code Using Interacting Automata, IEEE Transactions on Mobile Computing, v.1 n.4, p.313-326, October 2002
Igor Kaporin, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Theoretical Computer Science, v.315 n.2-3, p.469-510, 6 May 2004
Whit Schonbein, Cognition and the Power of Continuous Dynamical Systems, Minds and Machines, v.15 n.1, p.57-71, February 2005
Sergio Flesca , Sergio Greco, Partially ordered regular languages for graph queries, Journal of Computer and System Sciences, v.70 n.1, p.1-25, February 2005
Frank Neven, Attribute grammars for unranked trees as a query language for structured documents, Journal of Computer and System Sciences, v.70 n.2, p.221-257, March 2005
Serge Abiteboul , Tova Milo , Omar Benjelloun, Regular rewriting of active XML and unambiguity, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 13-15, 2005, Baltimore, Maryland
Martin Kappes , Frank Nießner, Succinct representations of languages by DFA with different levels of reliability, Theoretical Computer Science, v.330 n.2, p.299-310, 2 February 2005
Thomas C. O'Connell , Richard E. Stearns, Mechanism design for software agents with complete information, Decision Support Systems, v.39 n.2, p.197-217, April 2005
Michael Benedikt , Wenfei Fan , Floris Geerts, XPath satisfiability in the presence of DTDs, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 13-15, 2005, Baltimore, Maryland
Pei Wang, Problem solving with insufficient resources, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, v.12 n.5, p.673-700, October 2005
Nir Friedman , Joseph Y. Halpern, A knowledge-based framework for belief change part I: foundations, Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge, p.44-64, March 13-16, 1994, Pacific Grove, California
Haruo Hosoya , Jérôme Vouillon , Benjamin C. Pierce, Regular expression types for XML, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.1, p.46-90, January 2005
Michel Reynal, A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, v.36 n.1, March 2005
Gerry Eisman , B. Ravikumar, Approximate recognition of non-regular languages by finite automata, Proceedings of the Twenty-eighth Australasian conference on Computer Science, p.219-227, January 01, 2005, Newcastle, Australia
Jean-Marc Champarnaud , Georges Hansel , Thomas Paranthoën , Djelloul Ziadi, Random generation models for NFA'S, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.203-216, September 2004
Peter R. J. Asveld, Algebraic aspects of families of fuzzy languages, Theoretical Computer Science, v.293 n.2, p.417-445, 6 February 2003
Cindy Eisner , Dana Fisman , John Havlicek, A topological characterization of weakness, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA
Andreas Malcher, On two-way communication in cellular automata with a fixed number of cells, Theoretical Computer Science, v.330 n.2, p.325-338, 2 February 2005
Jose Luis Verdu-Mas , Rafael C. Carrasco , Jorge Calera-Rubio, Parsing with Probabilistic Strictly Locally Testable Tree Languages, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.7, p.1040-1050, July 2005
Dan C. Stefanescu , Alex Thomo , Lida Thomo, Distributed evaluation of generalized path queries, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
John Tang Boyland, Remote attribute grammars, Journal of the ACM (JACM), v.52 n.4, p.627-687, July 2005
Mark Johnson, Joint and conditional estimation of tagging and parsing models, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, p.322-329, July 06-11, 2001, Toulouse, France
Takashi Yokomori, Polynomial-time identification of very simple grammars from positive data, Theoretical Computer Science, v.298 n.1, p.179-206, 4 April 2003
Eileen Peluso , Jonathan Goldstine , Shashi Phoha, Normal processes for modeling the desired behavior of distributed autonomous discrete event systems, Journal of Automata, Languages and Combinatorics, v.7 n.1, p.127-142, July 2001
Lance Fortnow, One complexity theorist's view of quantum computing, Theoretical Computer Science, v.292 n.3, p.597-610, 31 January 2003
Jerzy Tiuryn , Pawel Urzyczyn, The subtyping problem for second-order types is undecidable, Information and Computation, v.179 n.1, p.1-18, November 25, 2002
Juntae Yoon, Compound noun segmentation based on lexical data extracted from corpus, Proceedings of the sixth conference on Applied natural language processing, p.196-203, April 29-May 04, 2000, Seattle, Washington
Bakhadyr Khoussainov, On algebraic and logical specifications of classes of regular languages, Theoretical Computer Science, v.298 n.2, p.325-346, 8 April 2003
Gundula Niemann , Friedrich Otto, The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages, Information and Computation, v.197 n.1/2, p.1-21, February 25, 2005/March 15, 2005
Frank Neven , Thomas Schwentick , Victor Vianu, Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic (TOCL), v.5 n.3, p.403-435, July 2004
Pedro García , José Ruiz , Manuel Vazquez de Parga, Bilateral locally testable languages, Theoretical Computer Science, v.299 n.1-3, p.775-783, 18 April 2003
Cezar Câmpeanu , Nicolae Sântean , Sheng Yu, Mergible states in large NFA, Theoretical Computer Science, v.330 n.1, p.23-34, 31 January 2005
Alin Deutsch , Val Tannen, XML Queries and constraints, containment and reformulation, Theoretical Computer Science, v.336 n.1, p.57-87, 25 May 2005
Diego Calvanese , Giuseppe De Giacomo , Moshe Y. Vardi, Decidable containment of recursive queries, Theoretical Computer Science, v.336 n.1, p.33-56, 25 May 2005
Ying Xu , Lusheng Wang , Hao Zhao , Jianping Li, Exact matching of RNA secondary structure patterns, Theoretical Computer Science, v.335 n.1, p.53-66, 20 May 2005
I. McQuillan, The generative capacity of block-synchronized context-free grammars, Theoretical Computer Science, v.337 n.1-3, p.119-133, 9 June 2005
Yasuhiro Tajima , Etsuji Tomita , Mitsuo Wakatsuki , Matsuaki Terada, Polynomial time learning of simple deterministic languages via queries and a representative sample, Theoretical Computer Science, v.329 n.1-3, p.203-221, 13 December 2004
Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter, On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science, v.337 n.1-3, p.105-118, 9 June 2005
Sylvain Lombardy , Yann Régis-Gianas , Jacques Sakarovitch, Introducing VAUCANSON, Theoretical Computer Science, v.328 n.1-2, p.77-96, 29 November 2004
W. T. Tsai , Dmitry Volovik , Thomas F. Keefe, Automated Test Case Generation for Programs Specified by Relational Algebra Queries, IEEE Transactions on Software Engineering, v.16 n.3, p.316-324, March 1990
Gennaro Costagliola , Filomena Ferrucci , Carmine Gravino, Adding symbolic information to picture models: definitions and properties, Theoretical Computer Science, v.337 n.1-3, p.51-104, 9 June 2005
Ian McQuillan, Descriptional complexity of block-synchronization context-free grammars, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.317-332, September 2004
Stefan Gruner , Stuart Naven, Tool support for plagiarism detection in text documents, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
David Toman , Grant Weddell, On reasoning about structural equality in XML: a description logic approach, Theoretical Computer Science, v.336 n.1, p.181-203, 25 May 2005
Marcella Anselmo , Dora Giammarresi , Maria Madonia, New operations and regular expressions for two-dimensional languages over one-letter alphabet, Theoretical Computer Science, v.340 n.2, p.408-431, 27 June 2005
Narad Rampersad , Jeffrey Shallit , Ming-wei Wang, Avoiding large squares in infinite binary words, Theoretical Computer Science, v.339 n.1, p.19-34, 11 June 2005
Charlotte Miller, Context derivation sets and context-free normal forms, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.333-345, September 2004
Theresa Beaubouef, Why computer science students need math, ACM SIGCSE Bulletin, v.34 n.4, December 2002
Matthew Stone, Lexicalized grammar 101, Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics, p.77-84, July 07-07, 2002, Philadelphia, Pennsylvania
J. Hartmanis, Undecidability and incompleteness results in automata theory, A half-century of automata theory: celebration and inspiration, World Scientific Publishing Co., Inc., River Edge, NJ, 2001
Michael Domaratzki , Kai Salomaa, State complexity of shuffle on trajectories, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.217-232, September 2004
Makoto Murata , Dongwon Lee , Murali Mani , Kohsuke Kawaguchi, Taxonomy of XML schema languages using formal language theory, ACM Transactions on Internet Technology (TOIT), v.5 n.4, p.660-704, November 2005
Keith Ellul , Bryan Krawetz , Jeffrey Shallit , Ming-wei Wang, Regular expressions: new results and open problems, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.233-256, September 2004
Strahil Ristov, LZ trie and dictionary compression, Software—Practice & Experience, v.35 n.5, p.445-465, 25 April 2005
Satoshi Yamane, Automatic effective verification method for distributed and concurrent systems using timed language inclusion, Engineering of distributed control systems, Nova Science Publishers, Inc., Commack, NY, 2001
Michal Armoni , Judith Gal-Ezer, Reduction -- an abstract thinking pattern: the case of the computational models course, ACM SIGCSE Bulletin, v.38 n.1, March 2006
Etsuro Moriya , Dieter Hofbauer , Maria Huber , Friedrich Otto, On state-alternating context-free grammars, Theoretical Computer Science, v.337 n.1-3, p.183-216, 9 June 2005
Boris Alexeev, Minimal DFA for testing divisibility, Journal of Computer and System Sciences, v.69 n.2, p.235-243, September 2004
Vir V. Phoha , Amit U. Nadgar , Asok Ray , Shashi Phoha, Supervisory Control of Software Systems, IEEE Transactions on Computers, v.53 n.9, p.1187-1199, September 2004
Mark-Jan Nederhof , Giorgio Satta, The language intersection problem for non-recursive context-free grammars, Information and Computation, v.192 n.2, p.172-184, August 1, 2004
Joseph Y. Halpern, Reasoning about knowledge: an overview, Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, March 19-22, 1986, Monterey, California
Dik Lun Lee , Frederick H. Lochovsky, HYTREM-A Hybrid Text-Retrieval Machine for Large Databases, IEEE Transactions on Computers, v.39 n.1, p.111-123, January 1990
Alexander Felfernig , Kostyantyn Shchekotykhin, Debugging user interface descriptions of knowledge-based recommender applications, Proceedings of the 11th international conference on Intelligent user interfaces, January 29-February 01, 2006, Sydney, Australia
Olivier Danvy , Lasse R. Nielsen, Defunctionalization at work, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.162-174, September 05-07, 2001, Florence, Italy
Jonathan Goldstine , Hing Leung , Detlef Wotschke, Measuring nondeterminism in pushdown automata, Journal of Computer and System Sciences, v.71 n.4, p.440-466, November 2005
Volker Diekert , Claudio Gutierrez , Christian Hagenah, The existential theory of equations with rational constraints in free groups is PSPACE-complete, Information and Computation, v.202 n.2, p.105-140, 1 November, 2005
Rafael Corchuelo , José A. Pérez, , Antonio Ruiz , Miguel Toro, Repairing syntax errors in LR parsers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.24 n.6, p.698-710, November 2002
Udi Manber, Chain Reactions in Networks, Computer, v.23 n.10, p.57-63, October 1990
Klaus Wich, Sublogarithmic ambiguity, Theoretical Computer Science, v.345 n.2-3, p.473-504, 22 November 2005
Jia Lee , Katsunobu Imai , Kenichi Morita, Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars, Theoretical Computer Science, v.304 n.1-3, p.185-200, 28 July 2003
Sergey Verlan, A boundary result on enhanced time-varying distributed H systems with parallel computations, Theoretical Computer Science, v.344 n.2-3, p.226-242, 17 November 2005
Mingsheng Ying, A theory of computation based on quantum logic (I), Theoretical Computer Science, v.344 n.2-3, p.134-207, 17 November 2005
Kimmo Kauranen , Erkki Makinen, A note on Cohen's formal model for computer viruses, ACM SIGSAC Review, v.8 n.2, p.40-43, Summer 1990
Steffen Lange , Jochen Nessel, Decision lists over regular patterns, Theoretical Computer Science, v.298 n.1, p.71-87, 4 April 2003
D. P. Sidhu , J. Aristizabal, Constructing Submodule Specifications and Network Protocols, IEEE Transactions on Software Engineering, v.14 n.11, p.1565-1577, November 1988
Andrzej S. Murawski, About the undecidability of program equivalence in finitary languages with state, ACM Transactions on Computational Logic (TOCL), v.6 n.4, p.701-726, October 2005
Kyriakos N. Sgarbas , Nikos D. Fakotakis , George K. Kokkinakis, Incremental construction of compact acyclic NFAs, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, p.482-489, July 06-11, 2001, Toulouse, France
Lane A. Hemaspaandra , Proshanto Mukherji , Till Tantau, Context-free languages can be accepted with absolutely no space overhead, Information and Computation, v.203 n.2, p.163-180, December 15, 2005
Steffen Lange , Sandra Zilles, Relations between gold-style learning and query learning, Information and Computation, v.203 n.2, p.211-237, December 15, 2005
Thomas Ball, On the limit of control flow analysis for regression test selection, ACM SIGSOFT Software Engineering Notes, v.23 n.2, p.134-142, March 1998
Marcella Anselmo , Maria Madonia, A language-theoretic approach to covering problems, Journal of Automata, Languages and Combinatorics, v.10 n.1, p.3-24, January 2005
Jurek Czyzowicz , Wojciech Fraczak , Andrzej Pelc, Transducers with set output, Journal of Automata, Languages and Combinatorics, v.10 n.1, p.37-49, January 2005
Peter Tiňo , Ashely J. S. Mills, Learning Beyond Finite Memory in Recurrent Networks of Spiking Neurons, Neural Computation, v.18 n.3, p.591-613, March 2006
Guilherme de A. Barreto , Aluizio F. R. Araújo , Stefan C. Kremer, A taxonomy for spatiotemporal connectionist networks revisited: the unsupervised case, Neural Computation, v.15 n.6, p.1255-1320, June 2003
Harry Bunt , John Carroll , Giorgio Satta, Development in parsing technology: from theory to application, New developments in parsing technology, Kluwer Academic Publishers, Norwell, MA, 2004
Juan A. Garay , Lorenz Huelsbergen, Software integrity protection using timed executable agents, Proceedings of the 2006 ACM Symposium on Information, computer and communications security, March 21-24, 2006, Taipei, Taiwan
Bernd Kiefer , Hans-Ulrich Krieger, A context-free superset approximation of unification-based grammars, New developments in parsing technology, Kluwer Academic Publishers, Norwell, MA, 2004
Peter R. J. Asveld, Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars, Theoretical Computer Science, v.347 n.1-2, p.167-190, 30 November 2005
Peter R. J. Asveld, Fuzzy context-free languages: part 2: Recognition and parsing algorithms, Theoretical Computer Science, v.347 n.1-2, p.191-213, 30 November 2005
Alon Lavie , Carolyn Penstein Rosé, Optimal ambiguity packing in context-free parsers with interleaved unification, New developments in parsing technology, Kluwer Academic Publishers, Norwell, MA, 2004
Nathaniel Miller, Computational complexity of diagram satisfaction in Euclidean geometry, Journal of Complexity, v.22 n.2, p.250-274, April 2006
Tomasz Jurdziński , Krzysztof Lorys , Gundula Niemann , Friedrich Otto, Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages, Journal of Automata, Languages and Combinatorics, v.9 n.4, p.407-437, January 2004
Mutyam Madhu , Kamala Krithivasan, Length synchronization context-free grammars, Journal of Automata, Languages and Combinatorics, v.9 n.4, p.457-464, January 2004
G. Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.2, p.416-430, March 2000
Valery A. Liskovets, Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, v.154 n.3, p.537-551, 1 March 2006
Thomas Reps, Undecidability of context-sensitive data-independence analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.162-186, Jan. 2000
T. Karvi , M. Tienari , R. Kaivola, Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics, Formal Methods in System Design, v.26 n.3, p.293-317, May 2005
Rahul Santhanam , Kamala Krithivasan, Graph splicing systems, Discrete Applied Mathematics, v.154 n.8, p.1264-1278, 15 May 2006
Jin-Yi Cai , Hong Zhu, Progress in computational complexity theory, Journal of Computer Science and Technology, v.20 n.6, p.735-750, November 2005
Narad Rampersad, The state complexity of L2 and Lk, Information Processing Letters, v.98 n.6, p.231-234, 30 June 2006
Lucian Ilie , Solomon Marcus , Ion Petre, Periodic and Sturmian languages, Information Processing Letters, v.98 n.6, p.242-246, 30 June 2006
Henrik Jacobsson, Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review, Neural Computation, v.17 n.6, p.1223-1263, June 2005
Andrea Aspetri , Harry G. Mairson, Parallel beta reduction is not elementary recursive, Information and Computation, v.170 n.1, p.49-80, October 10, 2001
Efficient minimization of deterministic weak &ohgr;-automata, Information Processing Letters, v.79 n.3, p.105-109, 07/31/2001
Krishnaprasad Thirunarayan , Robert L. Ewing, Structural Operational Semantics for a Portable Subset of Behavioral VHDL-93, Formal Methods in System Design, v.18 n.1, p.69-88, January.2001
La Meyer, Aspects of complexity of probabilistic learning under monotonicity constraints, Theoretical Computer Science, v.268 n.2, p.275-322, 17 October 2001
S. A. Mamrak , M. J. Kaelbling , C. K. Nicholas , M. Share, Chameleon: A System for Solving the Data-Translation Problem, IEEE Transactions on Software Engineering, v.15 n.9, p.1090-1108, September 1989
Nissim Francez , Michael Kaminski, An algebraic characterization of deterministic regular languages over infinite alphabets, Theoretical Computer Science, v.306 n.1-3, p.155-175, 5 September 2003
Sanjay Bhansali , Tim J. Hoar, Automated Software Synthesis: An Application in Mechanical CAD, IEEE Transactions on Software Engineering, v.24 n.10, p.848-862, October 1998
Romauld Jagielski, Visual simulation of finite state machines, ACM SIGCSE Bulletin, v.20 n.4, p.38-40, Dec. 1988
Daniel J. Sorin , Manoj Plakal , Anne E. Condon , Mark D. Hill , Milo M. K. Martin , David A. Wood, Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol, IEEE Transactions on Parallel and Distributed Systems, v.13 n.6, p.556-578, June 2002
Frank Niessner, Büchi automata and their degrees of nondeterminism and ambiguity, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.347-363, September 2004
Sergio Flesca , Filippo Furfaro , Sergio Greco, Weighted path queries on semistructured databases, Information and Computation, v.204 n.5, p.679-696, May 2006
Christel Baier , Marjan Sirjani , Farhad Arbab , Jan Rutten, Modeling component connectors in Reo by constraint automata, Science of Computer Programming, v.61 n.2, p.75-113, July 2006
Yi Chen , Susan B. Davidson , Yifeng Zheng, XKvalidator: a constraint validator for XML, Proceedings of the eleventh international conference on Information and knowledge management, November 04-09, 2002, McLean, Virginia, USA
Michal Forišek, On the suitability of programming tasks for automated evaluation, Informatics in education, v.5 n.1, p.63-76, January 2006
Carl G. Ponder , Yale N. Patt, Alternative proposals for implementing Prolog concurrently and implications regarding their respective microarchitectures, ACM SIGMICRO Newsletter, v.15 n.4, p.192-203, Dec. 1984
Oscar H. Ibarra , Bala Ravikumar, On partially blind multihead finite automata, Theoretical Computer Science, v.356 n.1, p.190-199, 5 May 2006
Flavio D'Alessandro , Benedetto Intrigila , Stefano Varricchio, On the structure of the counting function of sparse context-free languages, Theoretical Computer Science, v.356 n.1, p.104-117, 5 May 2006
Y. Boichut , R. Courbis , P. -C. Héam , O. Kouchnarenko, Handling Left-Quadratic Rules When Completing Tree Automata, Electronic Notes in Theoretical Computer Science (ENTCS), 223, p.61-70, December, 2008
Phillip G. Bradford, Language constrained graph problems: a microcosm of engineering research and development, Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications, p.71-76, January 25-27, 2008, Acapulco, Mexico
Pierre Mellier , François Grize, OVIDE: a tool for data acquisition and validation, ACM SIGPLAN Notices, v.30 n.1, p.53-61, Jan. 1995
David Carmel , Shaul Markovitch, Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies, Autonomous Agents and Multi-Agent Systems, v.2 n.2, p.141-172, June 1999
I-Ming Chen , Song Huat Yeo , Yan Gao, Locomotive gait generation for inchworm-like robots using finite state approach, Robotica, v.19 n.5, p.535-542, August 2001
Thomas Müller, Employing finite automata for resource scheduling, Proceedings of the 26th annual international symposium on Microarchitecture, p.12-20, December 01-03, 1993, Austin, Texas, United States
Shai Rubin , Somesh Jha , Barton P. Miller, Protomatching network traffic for high throughputnetwork intrusion detection, Proceedings of the 13th ACM conference on Computer and communications security, October 30-November 03, 2006, Alexandria, Virginia, USA
Joshua Mason , Kathryn Watkins , Jason Eisner , Adam Stubblefield, A natural language approach to automated cryptanalysis of two-time pads, Proceedings of the 13th ACM conference on Computer and communications security, October 30-November 03, 2006, Alexandria, Virginia, USA
Randolph M. Jones , Robert E. Wray, Comparative analysis of frameworks for knowledge-intensive intelligent agents, AI Magazine, v.27 n.2, p.57-70, July 2006
Margaret Francel , David J. John, Constructing an even grammar from a 2-element sample, Proceedings of the 43rd annual southeast regional conference, March 18-20, 2005, Kennesaw, Georgia
Shu Chen , Yu Zhang , Wade Trappe, Inverting sensor networks and actuating the environment for spatio-temporal access control, Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks, October 30-30, 2006, Alexandria, Virginia, USA
Hellis Tamm , Matti Nykänen , Esko Ukkonen, On size reduction techniques for multitape automata, Theoretical Computer Science, v.363 n.2, p.234-246, 28 October 2006
Turlough Neary , Damien Woods, Small fast universal turing machines, Theoretical Computer Science, v.362 n.1, p.171-195, 11 October 2006
Mark-Jan Nederhof , Giorgio Satta, Kullback-Leibler distance between probabilistic context-free grammars and probabilistic finite automata, Proceedings of the 20th international conference on Computational Linguistics, p.71-es, August 23-27, 2004, Geneva, Switzerland
Matthieu Picantin, Finite transducers for divisibility monoids, Theoretical Computer Science, v.362 n.1, p.207-221, 11 October 2006
Marco Carpentieri, A genetic system based on simulated crossover of sequences of two-bit genes, Theoretical Computer Science, v.367 n.3, p.324-335, December, 2006
Thomas Wennekers , Nihat Ay, Finite State Automata Resulting from Temporal Information Maximization and a Temporal Learning Rule, Neural Computation, v.17 n.10, p.2258-2290, October 2005
Stefan C. Kremer, Spatiotemporal Connectionist Networks: A Taxonomy and Review, Neural Computation, v.13 n.2, p.249-306, February 2001
Kemal Oflazer, Dependency Parsing with an Extended Finite-State Approach, Computational Linguistics, v.29 n.4, p.515-544, December 2003
Wim Martens , Frank Neven , Thomas Schwentick , Geert Jan Bex, Expressiveness and complexity of XML Schema, ACM Transactions on Database Systems (TODS), v.31 n.3, p.770-813, September 2006
Lvzhou Li , Daowen Qiu, Determination of equivalence between quantum sequential machines, Theoretical Computer Science, v.358 n.1, p.65-74, 31 July 2006
Remco Loos, An alternative definition of splicing, Theoretical Computer Science, v.358 n.1, p.75-87, 31 July 2006
Lorenzo Carlucci , Sanjay Jain , Efim Kinber , Frank Stephan, Variations on U-shaped learning, Information and Computation, v.204 n.8, p.1264-1294, August 2006
Stoyan Mihov , Klaus U. Schulz, Fast Approximate Search in Large Dictionaries, Computational Linguistics, v.30 n.4, p.451-477, December 2004
Jayanta Bhadra , Andrew K. Martin , Jacob A. Abraham, A formal framework for verification of embedded custom memories of the Motorola MPC7450 microprocessor, Formal Methods in System Design, v.27 n.1/2, p.67-112, September 2005
Marcus Kracht , Hans-Jörg Tiede, The Mathematics of Language, Computational Linguistics, v.30 n.4, p.513-515, December 2004
Carl S. McTague , James P. Crutchfield, Automated pattern detection: an algorithm for constructing optimally synchronizing multi-regular language filters, Theoretical Computer Science, v.359 n.1, p.306-328, 14 August 2006
Martin Lange , Rafał Somla, Propositional dynamic logic of context-free programs and fixpoint logic with chop, Information Processing Letters, v.100 n.2, p.72-75, 31 October 2006
Stéphane Demri, LTL Over integer periodicity constraints, Theoretical Computer Science, v.360 n.1, p.96-123, 21 August 2006
F. J. Brandenburg , K. Skodinis, Finite graph automata for linear and boundary graph languages, Theoretical Computer Science, v.332 n.1-3, p.199-232, 28 February 2005
Ting Zhang , Henny B. Sipma , Zohar Manna, Decision procedures for term algebras with integer constraints, Information and Computation, v.204 n.10, p.1526-1574, October 2006
Haruo Hosoya , Makoto Murata, Boolean operations and inclusion test for attribute-element constraints, Theoretical Computer Science, v.360 n.1, p.327-351, 21 August 2006
Allen P. Thomas , Linda B. Sherrell , James B. Greer, Using software simulations to teach automata, Journal of Computing Sciences in Colleges, v.21 n.5, p.170-176, May 2006
Atsuyuki Inoue , Akira Ito , Katsushi Inoue , Tokio Okazaki, Some properties of one-pebble turing machines with sublogarithmic space, Theoretical Computer Science, v.341 n.1, p.138-149, 5 September 2005
Geert Jan Bex , Frank Neven , Thomas Schwentick , Karl Tuyls, Inference of concise DTDs from XML data, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
Felice Balarin , Roberto Passerone, Functional verification methodology based on formal interface specification and transactor generation, Proceedings of the conference on Design, automation and test in Europe: Proceedings, March 06-10, 2006, Munich, Germany
Sid-Ahmed-Ali Touati , Denis Barthou, On the decidability of phase ordering problem in optimizing compilation, Proceedings of the 3rd conference on Computing frontiers, May 03-05, 2006, Ischia, Italy
Monika Solanki , Antonio Cau , Hussein Zedan, ASDL: a wide spectrum language for designing web services, Proceedings of the 15th international conference on World Wide Web, May 23-26, 2006, Edinburgh, Scotland
Serge Abiteboul , Luc Segoufin , Victor Vianu, Representing and querying XML with incomplete information, ACM Transactions on Database Systems (TODS), v.31 n.1, p.208-254, March 2006
Diego Calvanese , Giuseppe De Giacomo , Maurizio Lenzerini , Moshe Y. Vardi, View-based query processing: On the relationship between rewriting, answering and losslessness, Theoretical Computer Science, v.371 n.3, p.169-182, March, 2007
Christophe Damas , Bernard Lambeau , Axel van Lamsweerde, Scenarios, goals, and state machines: a win-win partnership for model synthesis, Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, November 05-11, 2006, Portland, Oregon, USA
Sailesh Kumar , Jonathan Turner , John Williams, Advanced algorithms for fast and scalable deep packet inspection, Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems, December 03-05, 2006, San Jose, California, USA
Geoffrey Smith, Inductive bases and their application to searches for minimal unary NFAs, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida
Irene Polycarpou, Computer science students' difficulties with proofs by induction: an exploratory study, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida
S. Glória Curilem , Andréa R. Barbosa , Fernando M. de Azevedo, Intelligent tutoring systems: Formalization as automata and interface design using neural networks, Computers & Education, v.49 n.3, p.545-561, November, 2007
Yasunori Ishihara , Toshiyuki Morita , Hiroyuki Seki , Minoru Ito, An equational logic based approach to the security problem against inference attacks on object-oriented databases, Journal of Computer and System Sciences, v.73 n.5, p.788-817, August, 2007
Milenko Drinić , Darko Kirovski , Hoi Vo, PPMexe: Program compression, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.1, p.3-es, January 2007
Elena Czeizler , Eugen Czeizler, Parallel communicating Watson-Crick automata systems, Acta Cybernetica, v.17 n.4, p.685-700, January 2006
Gabriel Ciobanu , Linqiang Pan , Gheorghe Pun , Mario J. Pérez-Jiménez, P systems with minimal parallelism, Theoretical Computer Science, v.378 n.1, p.117-130, June, 2007
Markus Lohrey , Nicole Ondrusch, Inverse monoids: Decidability and complexity of algebraic questions, Information and Computation, v.205 n.8, p.1212-1234, August, 2007
Jianming Zhan , WiesBaw A. Dudek, Fuzzy h-ideals of hemirings, Information Sciences: an International Journal, v.177 n.3, p.876-886, February, 2007
Yongming Li , Witold Pedrycz, Minimization of lattice finite automata and its application to the decomposition of lattice languages, Fuzzy Sets and Systems, v.158 n.13, p.1423-1436, July, 2007
Jun-Ki Min , Myung-Jae Park , Chin-Wan Chung, XTREAM: An efficient multi-query evaluation on streaming XML data, Information Sciences: an International Journal, v.177 n.17, p.3519-3538, September, 2007
Viliam Geffert , Carlo Mereghetti , Giovanni Pighizzini, Complementing two-way finite automata, Information and Computation, v.205 n.8, p.1173-1187, August, 2007
Edward Kei Shiu Ho , Lai Wan Chan, Analyzing Holistic Parsers: Implications for Robust Parsing and Systematicity, Neural Computation, v.13 n.5, p.1137-1170, May 2001
Moshe Sipper, Fifty years of research on self-replication: an overview, Artificial Life, v.4 n.3, p.237-257, Summer 1998
Gianluca Tempesti , Daniel Mange , André Stauffer, Self-replicating and self-repairing multicellular automata, Artificial Life, v.4 n.3, p.259-282, Summer 1998
Ozlem O. Garibay , Annie S. Wu, Analyzing the effects of module encapsulation on search space bias, Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 07-11, 2007, London, England
Robert C. Miller , Brad A. Myers, Lightweight structured text processing, Proceedings of the Annual Technical Conference on 1999 USENIX Annual Technical Conference, p.10-10, June 06-11, 1999, Monterey, California
Sailesh Kumar , Sarang Dharmapurikar , Fang Yu , Patrick Crowley , Jonathan Turner, Algorithms to accelerate multiple regular expressions matching for deep packet inspection, ACM SIGCOMM Computer Communication Review, v.36 n.4, October 2006
Bala Ravikumar, On some variations of two-way probabilistic finite automata models, Theoretical Computer Science, v.376 n.1-2, p.127-136, May, 2007
Chee-Yong Chan , Minos Garofalakis , Rajeev Rastogi, RE-Tree: an efficient index structure for regular expressions, Proceedings of the 28th international conference on Very Large Data Bases, p.251-262, August 20-23, 2002, Hong Kong, China
Viraj Kumar , P. Madhusudan , Mahesh Viswanathan, Visibly pushdown automata for streaming XML, Proceedings of the 16th international conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada
Edith Hemaspaandra , Lane A. Hemaspaandra , Jörg Rothe, Anyone but him: The complexity of precluding an alternative, Artificial Intelligence, v.171 n.5-6, p.255-285, April, 2007
Hooman Shayani , Peter J. Bentley, A more bio-plausible approach to the evolutionary inference of finite state machines, Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, July 07-11, 2007, London, United Kingdom
Martin Kutrib , Andreas Malcher, Context-dependent nondeterminism for pushdown automata, Theoretical Computer Science, v.376 n.1-2, p.101-111, May, 2007
Marcus Pivato, Defect particle kinematics in one-dimensional cellular automata, Theoretical Computer Science, v.377 n.1-3, p.205-228, May, 2007
Juraj Hromkovi , Georg Schnitger, Comparing the size of NFAs with and without ε-transitions, Theoretical Computer Science, v.380 n.1-2, p.100-114, June, 2007
Hamid Reza Motahari Nezhad , Boualem Benatallah , Axel Martens , Francisco Curbera , Fabio Casati, Semi-automated adaptation of service interactions, Proceedings of the 16th international conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada
Bettina Sunckel, On Metalinear CD Grammar Systems, Fundamenta Informaticae, v.76 n.3, p.383-397, August 2007
Michael Domaratzki , Grzegorz Rozenberg , Kai Salomaa, Interpreted Trajectories, Fundamenta Informaticae, v.73 n.1,2, p.81-97, April 2006
Henrik Jacobsson, The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx, Neural Computation, v.18 n.9, p.2211-2255, September 2006
Wilfred Ng , Wai-Yeung Lam , James Cheng, Comparative Analysis of XML Compression Technologies, World Wide Web, v.9 n.1, p.5-33, March 2006
Antonín Kučera , Petr Jančar, Equivalence-checking on infinite-state systems: Techniques and results, Theory and Practice of Logic Programming, v.6 n.3, p.227-264, May 2006
David L. Coleman , Albert L. Baker, Synthesizing structured analysis and object-based formal specifications, Annals of Software Engineering, 3, p.221-253, 1997
Brian J. Ross, Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions, Applied Intelligence, v.13 n.3, p.285-300, November-December 2000
W. Vasconcelos , D. Robertson , C. Sierra , M. Esteva , J. Sabater , M. Wooldridge, Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming, Annals of Mathematics and Artificial Intelligence, v.41 n.2-4, p.135-169, August 2004
Benjamin C. Brodie , David E. Taylor , Ron K. Cytron, A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching, ACM SIGARCH Computer Architecture News, v.34 n.2, p.191-202, May 2006
A. Ramirez-Serrano , S. C. Zhu , B. Benhabib, Moore Automata for the Supervisory Control of Robotic Manufacturing Workcells, Autonomous Robots, v.9 n.1, p.59-69, August 2000
Wayne Wolf, Redundancy Removal during High-Level Synthesis Using Scheduling Don‘t-Cares, Journal of Electronic Testing: Theory and Applications, v.11 n.3, p.211-225, Dec. 1997
William W. Cohen, Hardness Results for Learning First-Order Representations and Programming by Demonstration, Machine Learning, v.30 n.1, p.57-87, Jan. 1998
Farn Wang , Chia-Tien Lo, Procedure-Level Verification of Real-time Concurrent Systems, Real-Time Systems, v.16 n.1, p.81-114, Jan. 1999
Sanjay Jain , Arun Sharma, Generalization and specialization strategies for learning r.e. languages, Annals of Mathematics and Artificial Intelligence, v.23 n.1-2, p.1-26, 1998
Martin Kappes, On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars, Fundamenta Informaticae, v.64 n.1-4, p.229-239, January 2005
Olivier Finkel, On Winning Conditions of High Borel Complexity in Pushdown Games, Fundamenta Informaticae, v.66 n.3, p.277-298, August 2005
Olivier Finkel, An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank, Fundamenta Informaticae, v.62 n.3-4, p.333-342, August 2004
Dimitra Giannakopoulou , Corina S. Păsăreanu , Howard Barringer, Component Verification with Automatically Generated Assumptions, Automated Software Engineering, v.12 n.3, p.297-320, July 2005
Kurt Rohloff , Stéphane Lafortune, PSPACE-completeness of Modular Supervisory Control Problems, Discrete Event Dynamic Systems, v.15 n.2, p.145-167, June 2005
F. Corno , M. Cusinato , M. Ferrero , P. Prinetto, Proving testing preorders for process algebra descriptions, Proceedings of the 1995 European conference on Design and Test, p.333, March 06-09, 1995
E. García , A. Correcher , F. Morant , E. Quiles , R. Blasco, Modular Fault Diagnosis Based on Discrete Event Systems, Discrete Event Dynamic Systems, v.15 n.3, p.237-256, September 2005
Jan Komenda , Jan H. Schuppen, Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction, Discrete Event Dynamic Systems, v.15 n.3, p.257-315, September 2005
Boris Burshteyn, Generation and recognition of formal languages by modifiable grammars, ACM SIGPLAN Notices, v.25 n.12, p.45-53, Dec. 1990
K L Williams , M R Meybodi, Representing problems as string transformations, ACM SIGACT News, v.18 n.3, p.29-30, April 1987
Max H. Garzon , Russell J. Deaton, Codeword design and information encoding in DNA ensembles, Natural Computing: an international journal, v.3 n.3, p.253-292, August 2004
D. D. B. Van Bragt , J. A. La Poutré, Why Agents for Automated Negotiations Should Be Adaptive, Netnomics, v.5 n.2, p.101-118, November 2003
M. R. W. Dawson , D. A. Medler , D. B. Mccaughan , L. Willson , M. Carbonaro, Using Extra Output Learning to Insert a Symbolic Theory into a Connectionist Network, Minds and Machines, v.10 n.2, p.171-201, May 2000
Kenneth W. Regan , Jie Wang, The quasilinear isomorphism challenge, ACM SIGACT News, v.25 n.3, p.106-113, Sept. 1994
Jan Rekers , Wilco Koorn, Substring parsing for arbitrary context-free grammars, ACM SIGPLAN Notices, v.26 n.5, p.59-66, May 1991
David G. Hannay, Hypercard automata simulation: finite-state, pushdown and Turing machines, ACM SIGCSE Bulletin, v.24 n.2, p.55-58, June 1992
Pei-Chi Wu , Feng-Jian Wang, An object-oriented specification for compiler, ACM SIGPLAN Notices, v.27 n.1, p.85-94, Jan. 1992
Kiam-Tian Seow , Chuan Ma , Makoto Yokoo, Multiagent Planning as Control Synthesis, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, p.972-979, July 19-23, 2004, New York, New York
B. Ravikumar, Some applications of a technique of Sakoda and Sipser, ACM SIGACT News, v.21 n.4, p.73-77, Fall 1990
Flavio Antonio Ferrarotti , José María Turull Torres, Arity and alternation: a proper hierarchy in higher order logics, Annals of Mathematics and Artificial Intelligence, v.50 n.1-2, p.111-141, June 2007
A. D. C. Bennett , J. B. Paris , A. Vencovská, A New Criterion for Comparing Fuzzy Logics for Uncertain Reasoning, Journal of Logic, Language and Information, v.9 n.1, p.31-63, January 2000
Rami Debouk , Stéphane Lafortune , Demosthenis Teneketzis, Coordinated Decentralized Protocols for Failure Diagnosisof Discrete Event Systems, Discrete Event Dynamic Systems, v.10 n.1-2, p.33-86, January 2000
Teodor Knapik, Checking Simple Properties of Transition Systems Defined by Thue Specifications, Journal of Automated Reasoning, v.28 n.4, p.337-369, May 2002
Kathi Fisler, Timing Diagrams: Formalization and Algorithmic Verification, Journal of Logic, Language and Information, v.8 n.3, p.323-361, July 1999
Anuj Puri, An Undecidable Problem for Timed Automata, Discrete Event Dynamic Systems, v.9 n.2, p.135-146, May 1999
Juntae Yoon, Compound noun segmentation based on lexical data extracted from corpus, Natural Language Engineering, v.7 n.2, p.167-185, June 2001
Matthias Scheutz, Computational versus Causal Complexity, Minds and Machines, v.11 n.4, p.543-566, November 2001
Paliath Narendran , Friedrich Otto, Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories, Journal of Automated Reasoning, v.19 n.1, p.87-115, August 1997
Bruce W. Watson , Jan Daciuk, An efficient incremental DFA minimization algorithm, Natural Language Engineering, v.9 n.1, p.49-64, March 2003
Mark Lillibridge, Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC, Higher-Order and Symbolic Computation, v.12 n.1, p.75-104, April 1999
Edward T. Lee, Applications of fuzzy languages and pictorial databases to decision support systems design, Proceedings of the May 16-19, 1983, national computer conference, May 16-19, 1983, Anaheim, California
Anna Corazza , Giorgio Satta, Probabilistic Context-Free Grammars Estimated from Infinite Distributions, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.29 n.8, p.1379-1393, August 2007
Zhengjun Xi , Xin Wang , Yongming Li, Some algebraic properties of measure-once two-way quantum finite automata, Quantum Information Processing, v.7 n.5, p.211-225, October 2008
Joachim Viide , Aki Helin , Marko Laakso , Pekka Pietikäinen , Mika Seppänen , Kimmo Halunen , Rauli Puuperä , Juha Röning, Experiences with model inference assisted fuzzing, Proceedings of the 2nd conference on USENIX Workshop on offensive technologies, p.1-6, July 28, 2008, San Jose, CA
François Denis , Yann Esposito, On Rational Stochastic Languages, Fundamenta Informaticae, v.86 n.1,2, p.41-77, April 2008
Olgierd Unold, Grammar-based classifier system: a universal tool for grammatical inference, WSEAS Transactions on Computers, v.7 n.10, p.1584-1593, October 2008
Yasuo Uchida , Takao Ito , Hidenobu Okabe , Makoto Sakamoto , Hiroshi Furutani , Michio Kono, Four-dimensional multi-inkdot finite automata, WSEAS Transactions on Computers, v.7 n.9, p.1437-1446, September 2008
Peter Hines, Machine semantics, Theoretical Computer Science, v.409 n.1, p.1-23, December, 2008
Marco Autili , Leonardo Mostarda , Alfredo Navarra , Massimo Tivoli, Synthesis of decentralized and concurrent adaptors for correctly assembling distributed component-based systems, Journal of Systems and Software, v.81 n.12, p.2210-2236, December, 2008
Yuan Gao , Kai Salomaa , Sheng Yu, The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal, Fundamenta Informaticae, v.83 n.1-2, p.75-89, August 2008
Matteo Cavaliere , Sean Sedwards, Decision problems in membrane systems with peripheral proteins, transport and evolution, Theoretical Computer Science, v.404 n.1-2, p.40-51, September, 2008
Erzsébet Csuhaj-Varjú , György Vaszil, (Mem)brane automata, Theoretical Computer Science, v.404 n.1-2, p.52-60, September, 2008
Mukund Raghavachari , Oded Shmueli, Efficient Revalidation of XML Documents, IEEE Transactions on Knowledge and Data Engineering, v.19 n.4, p.554-567, April 2007
Cagdas E. Gerede , Oscar H. Ibarra , Bala Ravikumar , Jianwen Su, Minimum-cost delegation in service composition, Theoretical Computer Science, v.409 n.3, p.417-431, December, 2008
Vesa Halava , Tero Harju , Mika Hirvensalo , Juhani Karhumäki, Post Correspondence Problem for short words, Information Processing Letters, v.108 n.3, p.115-118, October, 2008
Robert Brijder , Matteo Cavaliere , Agustín Riscos-Núñez , Grzegorz Rozenberg , Drago Sburlan, Membrane systems with proteins embedded in membranes, Theoretical Computer Science, v.404 n.1-2, p.26-39, September, 2008
Matej Rojc , Zdravko Kacic, A UNIFIED APPROACH TO GRAPHEME-TO-PHONEME CONVERSION FOR THE PLATTOS SLOVENIAN TEXT-TO-SPEECH SYSTEM, Applied Artificial Intelligence, v.21 n.6, p.563-603, June 2007
Makoto Sakamoto , Naoko Tomozoe , Hiroshi Furutani , Michio Kono , Takao Ito , Yasuo Uchida , Hidenobu Okabe, A survey of three-dimensional automata, Proceedings of the 12th WSEAS international conference on Computers, p.399-407, July 23-25, 2008, Heraklion, Greece
Yo-Sub Han , Kai Salomaa , Derick Wood, Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages, Fundamenta Informaticae, v.90 n.1-2, p.93-106, February 2009
Gabor T. Herman, Algorithms, theory of, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
John Case, Automata theory, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
Janusz A. Brzozowski, Sequential machine, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
Jonathan Goldstine, Formal languages, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
Yasuki Kakishita , Kazutoshi Sasahara , Tetsuro Nishino , Miki Takahasi , Kazuo Okanoya, Ethological data mining: an automata-based approach to extract behavioral units and rules, Data Mining and Knowledge Discovery, v.18 n.3, p.446-471, June 2009
Chaim Goodman-Strauss, Regular production systems and triangle tilings, Theoretical Computer Science, v.410 n.16, p.1534-1549, April, 2009
Qing E. Wu , Tuo Wang , Yong Xuan Huang , Ji Sheng Li, State fusion of fuzzy automata with application on target tracking, Computers & Mathematics with Applications, v.57 n.6, p.949-960, March, 2009
Wico Mulder , Ceriel Jacobs, Grid management support by means of collaborative learning agents, Proceedings of the 6th international conference industry session on Grids meets autonomic computing, p.43-50, June 15-15, 2009, Barcelona, Spain
Jalal Mahmud , Yevgen Borodin , I. V. Ramakrishnan , C. R. Ramakrishnan, Automated construction of web accessibility models from transaction click-streams, Proceedings of the 18th international conference on World wide web, April 20-24, 2009, Madrid, Spain
Christophe Damas , Bernard Lambeau , Pierre Dupont , Axel van Lamsweerde, Generating Annotated Behavior Models from End-User Scenarios, IEEE Transactions on Software Engineering, v.31 n.12, p.1056-1073, December 2005
Irene Polycarpou, Induction as a tool for conceptual coherence in computer science, Proceedings of the 46th Annual Southeast Regional Conference on XX, March 28-29, 2008, Auburn, Alabama
Ankit Goel , Abhik Roychoudhury , P. S. Thiagarajan, Interacting process classes, ACM Transactions on Software Engineering and Methodology (TOSEM), v.18 n.4, p.1-47, July 2009
J. M. Schwier , R. R. Brooks , C. Griffin , S. Bukkapatnam, Zero knowledge hidden Markov model inference, Pattern Recognition Letters, v.30 n.14, p.1273-1280, October, 2009
Michela Becchi , Patrick Crowley, Extending finite automata to efficiently match Perl-compatible regular expressions, Proceedings of the 2008 ACM CoNEXT Conference, p.1-12, December 09-12, 2008, Madrid, Spain
Christopher W. Geib , Robert P. Goldman, A probabilistic plan recognition algorithm based on plan tree grammars, Artificial Intelligence, v.173 n.11, p.1101-1132, July, 2009
Hagit Shatkay , Leslie Pack Kaelbling, Learning geometrically-constrained hidden Markov models for robot navigation: bridging the topological-geometrical gap, Journal of Artificial Intelligence Research, v.16 n.1, p.167-207, January 2002
Kristian Kersting , Luc De Raedt , Tapani Raiko, Logical hidden Markov models, Journal of Artificial Intelligence Research, v.25 n.1, p.425-456, January 2006
Joseph Y. Halpern , Yoram Moses, A guide to the modal logics of knowledge and belief: preliminary draft, Proceedings of the 9th international joint conference on Artificial intelligence, p.480-490, August 18-23, 1985, Los Angeles, California
Edith Hemaspaandra , Lane A. Hemaspaandra , Jörg Rothe, Anyone but him: the complexity of precluding an alternative, Proceedings of the 20th national conference on Artificial intelligence, p.95-101, July 09-13, 2005, Pittsburgh, Pennsylvania
Lourdes Araujo, How evolutionary algorithms are applied to statistical natural language processing, Artificial Intelligence Review, v.28 n.4, p.275-303, December 2007
Gürcan GüleşIr , Klaas Berg , Lodewijk Bergmans , Mehmet Akşit, Experimental evaluation of a tool for the verification and transformation of source code in event-driven systems, Empirical Software Engineering, v.14 n.6, p.720-777, December 2009
Dale A. Lambert, A blueprint for higher-level fusion systems, Information Fusion, v.10 n.1, p.6-24, January, 2009
Sanjay Gupta, Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997), ACM SIGACT News, v.29 n.4, p.5-10, Dec. 1998
Bartira Dantas , David Déharbe , Stephenson Galvão , Anamaria Martins Moreira , Valério Medeiros, Júnior, Verified Compilation and the B Method: A Proposal and a First Appraisal, Electronic Notes in Theoretical Computer Science (ENTCS), 240, p.79-96, July, 2009
Abdolmajid Mousavi , Behrouz H. Far , Armin Eberlein, An approach for generating state machine designs from scenarios, Proceedings of the 11th IASTED International Conference on Software Engineering and Applications, November 19-21, 2007, Cambridge, Massachusetts
Ulrich Laube , Markus E. Nebel, Maximum likelihood analysis of algorithms and data structures, Theoretical Computer Science, v.411 n.1, p.188-212, January, 2010
Hesham Saadawi , Gabriel Wainer, Verification of real-time DEVS models, Proceedings of the 2009 Spring Simulation Multiconference, March 22-27, 2009, San Diego, California
Kristin Andersson , Bengt Lennartson , Petter Falkman , Martin Fabian, Generation of restart states for manufacturing systems with discarded workpieces, Proceedings of the fifth annual IEEE international conference on Automation science and engineering, p.191-196, August 22-25, 2009, Bangalore, India
József Sziray, A computational model for inference chains in expert systems, Proceedings of the IEEE 13th international conference on Intelligent Engineering Systems, p.166-171, April 16-18, 2009, Barbados
Yongbing Wang , Yongming Li, Approximation of fuzzy context-free grammars, Information Sciences: an International Journal, v.179 n.22, p.3920-3929, November, 2009
David Chiang, The weak generative capacity of linear tree-adjoining grammars, Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, p.25-32, July 15-16, 2006, Sydney, Australia
Eugene Eberbach , Mark Burgin, Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right, Proceedings of the Eleventh conference on Congress on Evolutionary Computation, p.2149-2156, May 18-21, 2009, Trondheim, Norway
Monojit Choudhury , Anupam Basu , Sudeshna Sarkar, A diachronic approach for schwa deletion in Indo Aryan languages, Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology: Current Themes in Computational Phonology and Morphology, p.20-26, July 26-26, 2004, Barcelona, Spain
Ricardo Baeza-Yates , Véronique Bruyère , Olivier Delgrange , Rodrigo Scheihing, On the size of Boyer-Moore automata, Theoretical Computer Science, v.410 n.43, p.4432-4443, October, 2009
Heike Zinsmeister, Freshmen's CL curriculum: the benefits of redundancy, Proceedings of the Third Workshop on Issues in Teaching Computational Linguistics, June 19-20, 2008, Columbus, Ohio
Kohtaro Tadaki , Tomoyuki Yamakami , Jack C. H. Lin, Theory of one-tape linear-time Turing machines, Theoretical Computer Science, v.411 n.1, p.22-43, January, 2010
Ishanu Chattopadhyay , Asok Ray, Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models, Proceedings of the 2009 conference on American Control Conference, p.2403-2408, June 10-12, 2009, St. Louis, Missouri, USA
Lan Lin , Stacy J. Prowell , Jesse H. Poore, An axiom system for sequence-based specification, Theoretical Computer Science, v.411 n.2, p.360-376, January, 2010
Brian MacWhinney, Item-based constructions and the logical problem, Proceedings of the Workshop on Psychocomputational Models of Human Language Acquisition, p.53-68, June 29-30, 2005, Ann Arbor, Michigan
Hideaki Suzuki, Multiple von neumann computers: An evolutionary approach to functional emergence, Artificial Life, v.3 n.2, p.121-142, Spring 1997
Kiam Tian Seow, A dynamic programming approach to multi-level supervision, Proceedings of the 2009 IEEE international conference on Robotics and Automation, p.87-92, May 12-17, 2009, Kobe, Japan

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

Additional Classification:
  A. General Literature
  A.2 REFERENCE


General Terms:
Documentation, Theory

Collaborative Colleagues:
John E. Hopcroft: colleagues
Jeffrey D. Ullman: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player