Skip header Section
Skip Bibliometrics Section
Introduction To Automata Theory, Languages, And ComputationNovember 1990
- Authors:
- John E. Hopcroft,
- Jeffrey D. Ullman
Skip Abstract Section
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
- Boreale M and Collodi L Language Equivalence from Nondeterministic to Weighted Automata—and Back Leveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola, (75-93)
Steimann F and Stunic R The Linguistic Theory behind Blockly Languages Proceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering, (113-129)- Mouhoub N, Moloney M and Magoni D (2024). Metarouting with automatic tunneling in multilayer networks, Journal of Network and Computer Applications, 230:C, Online publication date: 1-Oct-2024.
- Xie J, Hunt III H and Stearns R (2024). Pumping Lemmas Can be “Harmful”, Theory of Computing Systems, 68:5, (1339-1352), Online publication date: 1-Oct-2024.
- Hazimeh A, Xu D, Liu Q, Wang Y and Payer M Tango: Extracting Higher-Order Feedback through State Inference Proceedings of the 27th International Symposium on Research in Attacks, Intrusions and Defenses, (403-418)
- Kutrib M, Malcher A, Mereghetti C, Palano B, Raucci P and Wendlandt M On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters Implementation and Application of Automata, (208-220)
- Kutrib M, Malcher A, Mereghetti C, Palano B, Raucci P and Wendlandt M Deterministic Pushdown Automata with Translucent Input Letters Developments in Language Theory, (203-217)
- Ibarra O and McQuillan I Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors Developments in Language Theory, (156-172)
- Halava V and Niskanen R (2024). On simulating Turing machines with matrix semigroups with integrality tests, Theoretical Computer Science, 1005:C, Online publication date: 24-Jul-2024.
- Ciobanu L and Zetzsche G Slice closures of indexed languages and word equations with counting constraints Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Diatchki I, Dodds M, Goldstein H, Harris B, Holland D, Razet B, Schlesinger C and Winwood S (2024). Daedalus: Safer Document Parsing, Proceedings of the ACM on Programming Languages, 8:PLDI, (816-840), Online publication date: 20-Jun-2024.
- Westmoreland S Piston Words Mathematics and Computation in Music, (280-288)
- Gu C, Ma Z and Li Z (2024). Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs, Automatica (Journal of IFAC), 164:C, Online publication date: 1-Jun-2024.
- Brafman R and De Giacomo G (2024). Regular decision processes, Artificial Intelligence, 331:C, Online publication date: 1-Jun-2024.
- Pighizzini G, Prigioniero L and Sádovský Š (2024). Performing Regular Operations with 1-Limited Automata, Theory of Computing Systems, 68:3, (465-486), Online publication date: 1-Jun-2024.
- Kutrib M, Malcher A and Wendlandt M (2024). On the power of pushing or stationary moves for input-driven pushdown automata, Theoretical Computer Science, 996:C, Online publication date: 21-May-2024.
- Eyraud R and Ayache S (2024). Distillation of weighted automata from recurrent neural networks using a spectral approach, Machine Language, 113:5, (3233-3266), Online publication date: 1-May-2024.
- Liu Z, Deep S, Fariha A, Psallidas F, Tiwari A and Floratou A (2024). Rapidash: Efficient Detection of Constraint Violations, Proceedings of the VLDB Endowment, 17:8, (2009-2021), Online publication date: 1-Apr-2024.
- Geffert V, Pališínová D and Szabari A (2024). State complexity of binary coded regular languages, Theoretical Computer Science, 990:C, Online publication date: 1-Apr-2024.
- Adamson D, Gawrychowski P and Manea F Enumerating m-Length Walks in Directed Graphs with Constant Delay LATIN 2024: Theoretical Informatics, (35-50)
- Bruse F, Herwig M and Lange M (2024). Weights of formal languages based on geometric series with an application to automatic grading, Theoretical Computer Science, 983:C, Online publication date: 1-Feb-2024.
- Klimek R (2024). Ambient-aware continuous aid for mountain rescue activities, Information Sciences: an International Journal, 653:C, Online publication date: 1-Jan-2024.
- Bonifacio A Language-Based Testing for Pushdown Reactive Systems Formal Methods: Foundations and Applications, (75-91)
- Hoffmann S (2024). New characterizations of primitive permutation groups with applications to synchronizing automata, Information and Computation, 295:PA, Online publication date: 1-Dec-2023.
- Hoffmann S (2024). Binary and circular automata having maximal state complexity for the set of synchronizing words, Information and Computation, 295:PA, Online publication date: 1-Dec-2023.
- Hu D and Wu Z String Constraints with Regex-Counting and String-Length Solved More Efficiently Dependable Software Engineering. Theories, Tools, and Applications, (1-20)
- Ibarra O and McQuillan I On the Containment Problem for Deterministic Multicounter Machine Models Automated Technology for Verification and Analysis, (74-94)
- Arcile J, Devillers R and Klaudel H Factorization of the State Space Construction for Cyclic Systems with Data Verification and Evaluation of Computer and Communication Systems, (1-14)
- Burkardt J and Garvie M (2023). An integer linear programming approach to solving the Eternity Puzzle, Theoretical Computer Science, 975:C, Online publication date: 9-Oct-2023.
- Inoue Y, Hashimoto K and Seki H (2023). An ambiguity hierarchy of weighted context-free grammars, Theoretical Computer Science, 974:C, Online publication date: 29-Sep-2023.
- Michaliszyn J and Otop J Deterministic Weighted Automata Under Partial Observability Logics in Artificial Intelligence, (771-784)
- Otto F A Survey on Automata with Translucent Letters Implementation and Application of Automata, (21-50)
- Yamakami T (2023). The 2CNF Boolean formula satisfiability problem and the linear space hypothesis, Journal of Computer and System Sciences, 136:C, (88-112), Online publication date: 1-Sep-2023.
- Balun J and Masopust T (2023). Verifying weak and strong k-step opacity in discrete-event systems, Automatica (Journal of IFAC), 155:C, Online publication date: 1-Sep-2023.
- Xie J and Hunt H (2023). On the undecidability and descriptional complexity of synchronized regular expressions, Acta Informatica, 60:3, (257-278), Online publication date: 1-Sep-2023.
- Rajasekaran S, Bansal S and Vardi M Multi-agent systems with quantitative satisficing goals Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (280-288)
- Bistaffa F Faster exact MPE and constrained optimization with deterministic finite state automata Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (1884-1892)
- Lyon O and Salomaa K (2023). The nondeterministic state complexity of the site-directed deletion language operation, Theoretical Computer Science, 968:C, Online publication date: 11-Aug-2023.
- Kutrib M and Meyer U (2023). Syntax checking either way, Theoretical Computer Science, 966:C, Online publication date: 26-Jul-2023.
- Bhateja P Asynchronous Test Equivalence over Timed Processes Theoretical Aspects of Software Engineering, (114-125)
- Kotowsky M and Wächter J The Word Problem for Finitary Automaton Groups Descriptional Complexity of Formal Systems, (94-108)
- Riveros C, Van Sint Jan N and Vrgoč D (2023). REmatch: A Novel Regex Engine for Finding All Matches, Proceedings of the VLDB Endowment, 16:11, (2792-2804), Online publication date: 1-Jul-2023.
- Della Monica D, Montanari A and Sala P (2023). An interval temporal logic characterization of extended ω-regular languages, Theoretical Computer Science, 962:C, Online publication date: 22-Jun-2023.
- Hoffmann S Completely Distinguishable Automata and the Set of Synchronizing Words Developments in Language Theory, (128-142)
- Béaur P and Hellouin de Menibus B Sturmian and Infinitely Desubstitutable Words Accepted by an -Automaton Combinatorics on Words, (104-116)
- Sun X, Mo D, Wu D, Ye C, Yu Q, Cui J and Zhong H (2023). Efficient regular expression matching over hybrid dictionary-based compressed data, Journal of Network and Computer Applications, 215:C, Online publication date: 1-Jun-2023.
- Ibarra O and McQuillan I (2023). New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines, Information and Computation, 292:C, Online publication date: 1-Jun-2023.
- Wang H, Zhao L, He Y, Han Z and Li P (2023). Fuzzy pushdown automata based on complete residuated lattices: variants and computing powers, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 27:11, (6927-6938), Online publication date: 1-Jun-2023.
- Pighizzini G and Prigioniero L (2023). Pushdown automata and constant height: decidability and bounds, Acta Informatica, 60:2, (123-144), Online publication date: 1-Jun-2023.
- Lima P, Carvalho L and Moreira M (2023). Ensuring confidentiality of cyber-physical systems using event-based cryptography, Information Sciences: an International Journal, 621:C, (119-135), Online publication date: 1-Apr-2023.
- Berdinsky D, Jain S, Khoussainov B and Stephan F (2023). String compression in FA–presentable structures, Theoretical Computer Science, 947:C, Online publication date: 20-Feb-2023.
- Day J, Ganesh V, Grewal N and Manea F (2023). On the Expressive Power of String Constraints, Proceedings of the ACM on Programming Languages, 7:POPL, (278-308), Online publication date: 9-Jan-2023.
- Kostolányi P (2022). On some decidability questions concerning supports of rational series, Information Processing Letters, 179:C, Online publication date: 1-Jan-2023.
- Lin L, Zhu Y and Su R Towards Bounded Synthesis of Resilient Supervisors 2019 IEEE 58th Conference on Decision and Control (CDC), (7659-7664)
- Nagy B and Parchami S (2022). Watson–Crick automata languages-without sensing parameter, Natural Computing: an international journal, 21:4, (679-691), Online publication date: 1-Dec-2022.
- Faqrizal I, Salaün G and Falcone Y Probabilistic Analysis of Industrial IoT Applications Proceedings of the 12th International Conference on the Internet of Things, (41-48)
- Chatterjee K and Doyen L (2022). Graph planning with expected finite horizon, Journal of Computer and System Sciences, 129:C, (1-21), Online publication date: 1-Nov-2022.
- Koga T (2022). A pumping lemma for regular closure of prefix-free languages, Information and Computation, 289:PA, Online publication date: 1-Nov-2022.
- Bartocci E, Mateis C, Nesterini E and Nickovic D (2022). Survey on mining signal temporal logic specifications, Information and Computation, 289:PA, Online publication date: 1-Nov-2022.
- Baldan P and Raffaetà A (2022). Minimisation of event structures, Theoretical Computer Science, 935:C, (174-199), Online publication date: 31-Oct-2022.
- Olejár V and Szabari A Closure Properties of Subregular Languages Under Operations Machines, Computations, and Universality, (126-142)
- Nagy B From Finite Automata to Fractal Automata – The Power of Recursion Machines, Computations, and Universality, (109-125)
- Hospodár M, Mlynárčik P and Olejár V Operations on Subregular Languages and Nondeterministic State Complexity Descriptional Complexity of Formal Systems, (112-126)
- Clokie T, Lidbetter T, Molina Lovett A, Shallit J and Witzman L (2022). Computational aspects of sturdy and flimsy numbers, Theoretical Computer Science, 927:C, (65-86), Online publication date: 26-Aug-2022.
- Bhateja P (2022). Determining asynchronous test equivalence for probabilistic processes, Information Processing Letters, 177:C, Online publication date: 1-Aug-2022.
- Dassow J and Jecker I (2022). Operational complexity and pumping lemmas, Acta Informatica, 59:4, (337-355), Online publication date: 1-Aug-2022.
- Figelius M and Lohrey M Exponent Equations in HNN-extensions Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, (293-301)
- Aminof B, Murano A, Rubin S and Zuleger F (2022). Verification of agent navigation in partially-known environments, Artificial Intelligence, 308:C, Online publication date: 1-Jul-2022.
- Li Y, Zhang Q and Reps T (2022). Fast Graph Simplification for Interleaved-Dyck Reachability, ACM Transactions on Programming Languages and Systems, 44:2, (1-28), Online publication date: 30-Jun-2022.
- Grahne G, Liu T and Shiri N Universal provenance for regular path queries Proceedings of the 14th International Workshop on the Theory and Practice of Provenance, (1-7)
- Droste M, Fülöp Z, Kószó D and Vogler H (2022). Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, Theoretical Computer Science, 919:C, (118-143), Online publication date: 5-Jun-2022.
- Belle V (2022). Analyzing generalized planning under nondeterminism, Artificial Intelligence, 307:C, Online publication date: 1-Jun-2022.
- Geffert V, Bednárová Z and Szabari A (2022). Input-driven pushdown automata for edit distance neighborhood, Theoretical Computer Science, 918:C, (105-122), Online publication date: 29-May-2022.
- Schröder M and Cito J Grammars for free Proceedings of the ACM/IEEE 44th International Conference on Software Engineering: New Ideas and Emerging Results, (41-45)
- Yen D and Yen H (2022). On the decidability of the valuedness problem for two-way finite transducers, Information and Computation, 285:PB, Online publication date: 1-May-2022.
- Malkis A (2022). Reachability in parallel programs is polynomial in the number of threads, Journal of Parallel and Distributed Computing, 162:C, (1-16), Online publication date: 1-Apr-2022.
- Krenn D and Shallit J (2022). Decidability and k-regular sequences, Theoretical Computer Science, 907:C, (34-44), Online publication date: 12-Mar-2022.
- Kordon F, Leuschel M, van de Pol J and Thierry-Mieg Y Software Architecture of Modern Model Checkers Computing and Software Science, (393-419)
- Kahrs S and Runciman C (2022). Simplifying regular expressions further, Journal of Symbolic Computation, 109:C, (124-143), Online publication date: 1-Mar-2022.
- Kutrib M, Malcher A, Mereghetti C and Palano B (2022). Descriptional complexity of iterated uniform finite-state transducers, Information and Computation, 284:C, Online publication date: 1-Mar-2022.
- Chen T, Flores-Lamas A, Hague M, Han Z, Hu D, Kan S, Lin A, Rümmer P and Wu Z (2022). Solving string constraints with Regex-dependent functions through transducers with priorities and variables, Proceedings of the ACM on Programming Languages, 6:POPL, (1-31), Online publication date: 16-Jan-2022.
- Weng J An Algorithmic Theory for Conscious Learning Proceedings of the 2022 3rd International Conference on Artificial Intelligence in Electronics Engineering, (1-8)
- Rubtsov A and Vyalyi M (2022). On computational complexity of set automata, Information and Computation, 281:C, Online publication date: 1-Dec-2021.
- Hemaspaandra L and Narváez D (2022). The opacity of backbones, Information and Computation, 281:C, Online publication date: 1-Dec-2021.
- Li Y, Chen Y, Zhang L and Liu D (2022). A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, Information and Computation, 281:C, Online publication date: 1-Dec-2021.
- Nagy B (2021). State-deterministic Watson-Crick automata, Natural Computing: an international journal, 20:4, (725-737), Online publication date: 1-Dec-2021.
- Triska L and Moor T (2021). Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics, Discrete Event Dynamic Systems, 31:4, (583-607), Online publication date: 1-Dec-2021.
- Ho H, Zhou R and Jones T (2021). Timed hyperproperties, Information and Computation, 280:C, Online publication date: 1-Oct-2021.
- Otto F (2021). On the Expressive Power of Stateless Ordered Restart-Delete Automata, Theory of Computing Systems, 65:7, (1033-1068), Online publication date: 1-Oct-2021.
- Gruber H, Holzer M and Wolfsteiner S On Minimizing Regular Expressions Without Kleene Star Fundamentals of Computation Theory, (245-258)
- Hoffmann S Sync-Maximal Permutation Groups Equal Primitive Permutation Groups Descriptional Complexity of Formal Systems, (38-50)
- Bueso de Barrio L, Fredlund L, Herranz Á, Earle C and Mariño J Makina: a new QuickCheck state machine library Proceedings of the 20th ACM SIGPLAN International Workshop on Erlang, (41-53)
- Balliu A, Brandt S, Olivetti D and Suomela J (2021). Almost global problems in the LOCAL model, Distributed Computing, 34:4, (259-281), Online publication date: 1-Aug-2021.
- Lee E (2021). Determinism, ACM Transactions on Embedded Computing Systems, 20:5, (1-34), Online publication date: 1-Jul-2021.
- Bozzelli L, Peron A and Sánchez C Asynchronous extensions of HyperLTL Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Ambrona M Generic Negation of Pair Encodings Public-Key Cryptography – PKC 2021, (120-146)
- Dershowitz N (2021). Let's be honest, Communications of the ACM, 64:5, (37-41), Online publication date: 1-May-2021.
- D'Antoni L and Veanes M (2021). Automata modulo theories, Communications of the ACM, 64:5, (86-95), Online publication date: 1-May-2021.
- Sohi S, Seifert J and Ganji F (2021). RNNIDS, Computers and Security, 102:C, Online publication date: 1-Mar-2021.
- Piantadosi S (2021). The Computational Origin of Representation, Minds and Machines, 31:1, (1-58), Online publication date: 1-Mar-2021.
- Hoffmann S State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets Language and Automata Theory and Applications, (318-330)
- Theuermann K Reliability and Security for Safety-Critical Service Compositions Information Systems Security, (45-65)
- Lin L, Zhu Y and Su R (2020). Synthesis of covert actuator attackers for free, Discrete Event Dynamic Systems, 30:4, (561-577), Online publication date: 1-Dec-2020.
- Vaandrager F and Midya A A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages Theoretical Aspects of Computing – ICTAC 2020, (43-63)
- Fazekas S, Hoshi K and Yamamura A Two-Way Jumping Automata Frontiers in Algorithmics, (108-120)
- Löffler S, Liu K and Hofstedt P Optimizing Constraint Satisfaction Problems by Regularization for the Sample Case of the Warehouse Location Problem KI 2020: Advances in Artificial Intelligence, (297-304)
- Smith T and Salomaa K Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata Descriptional Complexity of Formal Systems, (206-218)
- Turner J, Bowen J and Reeves S (2020). Model-based Testing of Interactive Systems using Interaction Sequences, Proceedings of the ACM on Human-Computer Interaction, 4:EICS, (1-37), Online publication date: 18-Jun-2020.
- Li Y, Zhang Q and Reps T Fast graph simplification for interleaved Dyck-reachability Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, (780-793)
- Déguernel K, Vincent E, Nika J, Assayag G and Smaïli K (2020). Learning of Hierarchical Temporal Structures for Guided Improvisation, Computer Music Journal, 43:2-3, (109-124), Online publication date: 1-Jun-2020.
- Caron P, Hamel-de-le-court E and Luque J A Study of a Simple Class of Modifiers: Product Modifiers Developments in Language Theory, (110-121)
- Hospodár M and Mlynárčik P Operations on Permutation Automata Developments in Language Theory, (122-136)
- Okhotin A and Sorokin A Cyclic Shift on Multi-component Grammars Language and Automata Theory and Applications, (287-299)
- Hemaspaandra E, Hemaspaandra L and Menton C (2020). Search versus Decision for Election Manipulation Problems, ACM Transactions on Computation Theory, 12:1, (1-42), Online publication date: 25-Feb-2020.
- Benyagoub S, Aït‐Ameur Y, Ouederni M, Mashkoor A and Medeghri A (2019). Formal design of scalable conversation protocols using Event‐B, Journal of Software: Evolution and Process, 32:2, Online publication date: 3-Feb-2020.
- Hromkovič J and Rossmanith P (2020). What one has to know when attacking P vs. NP , Journal of Computer and System Sciences, 107:C, (142-155), Online publication date: 1-Feb-2020.
- Czelakowski J (2018). Deontology of Compound Actions, Studia Logica, 108:1, (5-47), Online publication date: 1-Feb-2020.
- Gelle K and Iván S The Order Type of Scattered Context-Free Orderings of Rank One Is Computable SOFSEM 2020: Theory and Practice of Computer Science, (273-284)
- Ibarra O and McQuillan I (2019). On families of full trios containing counter machine languages, Theoretical Computer Science, 799:C, (71-93), Online publication date: 24-Dec-2019.
- Ibarra O and McQuillan I (2019). State grammars with stores, Theoretical Computer Science, 798:C, (23-39), Online publication date: 17-Dec-2019.
- Cho D, Han Y, Salomaa K and Smith T (2019). Site-directed insertion, Theoretical Computer Science, 798:C, (40-51), Online publication date: 17-Dec-2019.
- Jamroga W, Malvone V and Murano A (2019). Natural strategic ability, Artificial Intelligence, 277:C, Online publication date: 1-Dec-2019.
- Gelle K and Iván S (2019). The ordinal generated by an ordinal grammar is computable, Theoretical Computer Science, 793:C, (1-13), Online publication date: 12-Nov-2019.
- Mazzara M Teaching Theoretical Computer Science at Innopolis University Frontiers in Software Engineering Education, (60-70)
- Bribiesca E (2019). The spirals of the Slope Chain Code, Pattern Recognition, 95:C, (247-260), Online publication date: 1-Nov-2019.
- Freydenberger D and Schmid M (2019). Deterministic regular expressions with back-references, Journal of Computer and System Sciences, 105:C, (1-39), Online publication date: 1-Nov-2019.
- Rodaro E (2022). A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number, Journal of Algebraic Combinatorics: An International Journal, 50:3, (237-253), Online publication date: 1-Nov-2019.
- Machida M and Shibakov A (2019). Stack and register complexity of radix conversions, Theoretical Computer Science, 790:C, (138-151), Online publication date: 22-Oct-2019.
- Ozkan B, Majumdar R and Oraee S (2019). Trace aware random testing for distributed systems, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-29), Online publication date: 10-Oct-2019.
- Henriksen I, Bilardi G and Pingali K (2019). Derivative grammars: a symbolic approach to parsing with derivatives, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-28), Online publication date: 10-Oct-2019.
- Arceri V, Pasqua M and Mastroeni I An Abstract Domain for Objects in Dynamic Programming Languages Formal Methods. FM 2019 International Workshops, (136-151)
- Freydenberger D (2019). A Logic for Document Spanners, Theory of Computing Systems, 63:7, (1679-1754), Online publication date: 1-Oct-2019.
- Löffler S, Liu K and Hofstedt P The Regularization of Small Sub-Constraint Satisfaction Problems Declarative Programming and Knowledge Management, (106-115)
- Eremondi J, Ibarra O and McQuillan I (2019). Insertion operations on deterministic reversal-bounded counter machines, Journal of Computer and System Sciences, 104:C, (244-257), Online publication date: 1-Sep-2019.
- Brafman R and De Giacomo G Planning for LTLf /LDLf goals in non-Markovian fully observable nondeterministic domains Proceedings of the 28th International Joint Conference on Artificial Intelligence, (1602-1608)
- Dennunzio A, Formenti E, Manzoni L and Porreca A (2019). Complexity of the dynamics of reaction systems, Information and Computation, 267:C, (96-109), Online publication date: 1-Aug-2019.
- Ibarra O and McQuillan I (2019). On store languages and applications, Information and Computation, 267:C, (28-48), Online publication date: 1-Aug-2019.
- Ibarra O, McQuillan I and Ravikumar B (2022). On counting functions and slenderness of languages, Theoretical Computer Science, 777:C, (356-378), Online publication date: 19-Jul-2019.
- Kobayashi N (2022). Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable, Theoretical Computer Science, 777:C, (409-416), Online publication date: 19-Jul-2019.
- Balliu A, Brandt S, Chang Y, Olivetti D, Rabie M and Suomela J The Distributed Complexity of Locally Checkable Problems on Paths is Decidable Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, (262-271)
- Holzer M and Kutrib M Non-Recursive Trade-Offs Are “Almost Everywhere” Computing with Foresight and Industry, (25-36)
- Jain S and Kinber E (2019). Intrinsic complexity of partial learning, Theoretical Computer Science, 776:C, (43-63), Online publication date: 12-Jul-2019.
- Fazekas S, Hoshi K and Yamamura A Enhancement of Automata with Jumping Modes Cellular Automata and Discrete Complex Systems, (62-76)
- Nadin M (2019). Machine intelligence: a chimera, AI & Society, 34:2, (215-242), Online publication date: 1-Jun-2019.
- Bonifati A and Dumbrava S (2019). Graph Queries, ACM SIGMOD Record, 47:4, (5-16), Online publication date: 17-May-2019.
- Kjos-Hanssen B and Liu L The Number of Languages with Maximum State Complexity Theory and Applications of Models of Computation, (394-409)
- Kostolányi P (2019). A Unifying Approach to Algebraic Systems Over Semirings, Theory of Computing Systems, 63:3, (615-633), Online publication date: 1-Apr-2019.
- Brijder R (2019). Computing with chemical reaction networks, Natural Computing: an international journal, 18:1, (119-137), Online publication date: 1-Mar-2019.
- Yamakami T Behavioral Strengths and Weaknesses of Various Models of Limited Automata SOFSEM 2019: Theory and Practice of Computer Science, (519-530)
- Nagy B and Otto F Two-Head Finite-State Acceptors with Translucent Letters SOFSEM 2019: Theory and Practice of Computer Science, (406-418)
- Chen T, Hague M, Lin A, Rümmer P and Wu Z (2019). Decision procedures for path feasibility of string-manipulating programs with complex operations, Proceedings of the ACM on Programming Languages, 3:POPL, (1-30), Online publication date: 2-Jan-2019.
- Combi C, Posenato R, Viganò L and Zavatteri M (2019). Conditional simple temporal networks with uncertainty and resources, Journal of Artificial Intelligence Research, 64:1, (931-985), Online publication date: 1-Jan-2019.
- Copeland B and Shagrir O (2018). The Church-Turing thesis, Communications of the ACM, 62:1, (66-74), Online publication date: 19-Dec-2018.
- Cong X, Fanti M, Mangini A and Li Z Critical Observability of Safe Petri Nets via Integer Linear Programming 2018 IEEE Conference on Decision and Control (CDC), (1029-1034)
- Pittou M, Manolios P, Reineke J and Tripakis S (2018). Checking multi-view consistency of discrete systems with respect to periodic sampling abstractions, Science of Computer Programming, 167:C, (1-24), Online publication date: 1-Dec-2018.
- Rahmani A, Donyanavard B, Mück T, Moazzemi K, Jantsch A, Mutlu O and Dutt N (2018). SPECTR, ACM SIGPLAN Notices, 53:2, (169-183), Online publication date: 30-Nov-2018.
- Marais L and van Zijl L The state complexity of language operations on XNFA-succinct unary regular languages Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists, (20-28)
- Frede C and Knobelsdorf M Exploring how Students Perform in a Theory of Computation Course using Final Exam and Homework Assignments Data Proceedings of the 2018 ACM Conference on International Computing Education Research, (241-249)
- Ibarra O and McQuillan I Semilinearity of Families of Languages Implementation and Application of Automata, (211-222)
- Brough T Word Problem Languages for Free Inverse Monoids Descriptional Complexity of Formal Systems, (24-36)
- Beier S and Holzer M Properties of Right One-Way Jumping Finite Automata Descriptional Complexity of Formal Systems, (11-23)
- Ibarra O and McQuillan I State Grammars with Stores Descriptional Complexity of Formal Systems, (163-174)
- Guillon B and Prigioniero L Linear-Time Limited Automata Descriptional Complexity of Formal Systems, (126-138)
- Belardinelli F, Lomuscio A, Murano A and Rubin S Alternating-time temporal logic on finite traces Proceedings of the 27th International Joint Conference on Artificial Intelligence, (77-83)
- Guellouma Y, Cherroun H, Ziadi D and Watson B (2018). From Tree Automata to String Automata Minimization, Theory of Computing Systems, 62:5, (1203-1222), Online publication date: 1-Jul-2018.
- Turner J Interactive System Testing using Interaction Sequences Proceedings of the ACM SIGCHI Symposium on Engineering Interactive Computing Systems, (1-5)
- Turner J, Bowen J and Reeves S Simulating Interaction Sequences Proceedings of the ACM SIGCHI Symposium on Engineering Interactive Computing Systems, (1-7)
- Hospodár M, Jirásková G and Krajňáková I Operations on Boolean and Alternating Finite Automata Computer Science – Theory and Applications, (181-193)
- Liu G, Jiang C and Zhou M (2018). Time-Soundness of Time Petri Nets Modelling Time-Critical Systems, ACM Transactions on Cyber-Physical Systems, 2:2, (1-27), Online publication date: 30-Apr-2018.
- Rahmani A, Donyanavard B, Mück T, Moazzemi K, Jantsch A, Mutlu O and Dutt N SPECTR Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, (169-183)
- Xu C, Su J and Chen S Exploring Efficient NFA Data Structures to Accelerate DFA Generation Proceedings of the 2nd International Conference on Cryptography, Security and Privacy, (56-61)
- Li X, Ge P and Hu H FlexSLiM Proceedings of the 2018 6th International Conference on Bioinformatics and Computational Biology, (32-39)
- Chen T, Chen Y, Hague M, Lin A and Wu Z (2017). What is decidable about string constraints with the ReplaceAll function, Proceedings of the ACM on Programming Languages, 2:POPL, (1-29), Online publication date: 1-Jan-2018.
- Gan Y, Chechik M, Nejati S, Bennett J, O'Farrell B and Waterhouse J Runtime monitoring of web service conversations Proceedings of the 27th Annual International Conference on Computer Science and Software Engineering, (2-17)
- Wei X and Li Y (2017). Fuzzy alternating Bchi automata over distributive lattices, International Journal of Approximate Reasoning, 90:C, (144-162), Online publication date: 1-Nov-2017.
- Qu B, Vallet F, Carrive J and Gravier G (2017). Content-based unsupervised segmentation of recurrent TV programs using grammatical inference, Multimedia Tools and Applications, 76:21, (22569-22597), Online publication date: 1-Nov-2017.
- Carral D, Dragoste I and Krötzsch M Tractable Query Answering for Expressive Ontologies and Existential Rules The Semantic Web – ISWC 2017, (156-172)
- Mesnard F, Payet É and Vidal G Selective unification in constraint logic programming Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, (115-126)
- Zaytsev V Language design with intent Proceedings of the ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems, (45-52)
- Saarikivi O, Veanes M, Mytkowicz T and Musuvathi M (2017). Fusing effectful comprehensions, ACM SIGPLAN Notices, 52:6, (17-32), Online publication date: 14-Sep-2017.
- Hemaspaandra E, Hemaspaandra L and Rothe J (2017). The complexity of online voter control in sequential elections, Autonomous Agents and Multi-Agent Systems, 31:5, (1055-1076), Online publication date: 1-Sep-2017.
- Orlando A, Zaine I, Pimentel M, De Souza D and Teixeira C Interactive Documents based on Discrete Trials Proceedings of the 2017 ACM Symposium on Document Engineering, (77-80)
- Farah Z, Ait-Ameur Y, Ouederni M and Tari K (2017). A correct-by-construction model for asynchronously communicating systems, International Journal on Software Tools for Technology Transfer (STTT), 19:4, (465-485), Online publication date: 1-Aug-2017.
- Diekert V, Martin F, Sénizergues G and Silva P (2017). Equations Over Free Inverse Monoids with Idempotent Variables, Theory of Computing Systems, 61:2, (494-520), Online publication date: 1-Aug-2017.
- Baschenis F, Gauwin O, Muscholl A and Puppis G Untwisting two-way transducers in elementary time Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Pavlovic D and Seidel P Quotients in monadic programming Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Hsieh K, Wang L, Chen W and Bhadra J Learning to Produce Direct Tests for Security Verification Using Constrained Process Discovery Proceedings of the 54th Annual Design Automation Conference 2017, (1-6)
- Nourian M, Wang X, Yu X, Feng W and Becchi M Demystifying automata processing Proceedings of the International Conference on Supercomputing, (1-11)
- Saarikivi O, Veanes M, Mytkowicz T and Musuvathi M Fusing effectful comprehensions Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, (17-32)
- Grigore R (2017). Java generics are turing complete, ACM SIGPLAN Notices, 52:1, (73-85), Online publication date: 11-May-2017.
- Zhang Q and Su Z (2017). Context-sensitive data-dependence analysis via linear conjunctive language reachability, ACM SIGPLAN Notices, 52:1, (344-358), Online publication date: 11-May-2017.
- D'Antoni L and Veanes M Forward Bisimulations for Nondeterministic Symbolic Finite Automata Proceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10205, (518-534)
- Calvo-Zaragoza J and Oncina J (2017). Recognition of pen-based music notation with finite-state machines, Expert Systems with Applications: An International Journal, 72:C, (395-406), Online publication date: 15-Apr-2017.
- Isayama D, Ishiyama M, Relator R and Yamazaki K (2016). Computer Science Education for Primary and Lower Secondary School Students, ACM Transactions on Computing Education, 17:1, (1-28), Online publication date: 31-Mar-2017.
- Kari L and Kopecki S (2017). Deciding whether a regular language is generated by a splicing system, Journal of Computer and System Sciences, 84:C, (263-287), Online publication date: 1-Mar-2017.
- Pan H, Li Y, Cao Y and Li P (2017). Nondeterministic fuzzy automata with membership values in complete residuated lattices, International Journal of Approximate Reasoning, 82:C, (22-38), Online publication date: 1-Mar-2017.
- Bellaouar S, Cherroun H, Nehar A and Ziadi D Weighted Automata Sequence Kernel Proceedings of the 9th International Conference on Machine Learning and Computing, (48-55)
- Smith T (2017). A new pumping lemma for indexed languages, with an application to infinite words, Information and Computation, 252:C, (176-186), Online publication date: 1-Feb-2017.
- Grigore R Java generics are turing complete Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (73-85)
- Zhang Q and Su Z Context-sensitive data-dependence analysis via linear conjunctive language reachability Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (344-358)
- Carmantini G, beim Graben P, Desroches M and Rodrigues S (2017). A modular architecture for transparent computation in recurrent neural networks, Neural Networks, 85:C, (85-105), Online publication date: 1-Jan-2017.
- Krebs A, Limaye N, Mahajan M and Sreenivasaiah K (2016). Small Depth Proof Systems, ACM Transactions on Computation Theory, 9:1, (1-26), Online publication date: 26-Dec-2016.
- Schuppan V (2016). Enhancing unsatisfiable cores for LTL with information on temporal relevance, Theoretical Computer Science, 655:PB, (155-192), Online publication date: 6-Dec-2016.
- Tsankov P, Pistoia M, Tripp O, Vechev M and Ferrara P FASE Proceedings of the 32nd Annual Conference on Computer Security Applications, (471-483)
- Aizikowitz T and Kaminski M (2016). LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata, Journal of Computer and System Sciences, 82:8, (1329-1359), Online publication date: 1-Dec-2016.
- Diekert V, Jeź A and Plandowski W (2016). Finding all solutions of equations in free groups and monoids with involution, Information and Computation, 251:C, (263-286), Online publication date: 1-Dec-2016.
- Vázquez de Parga M, García P and López D (2016). A sufficient condition to polynomially compute a minimum separating DFA, Information Sciences: an International Journal, 370:C, (204-220), Online publication date: 20-Nov-2016.
- Yu H, Mao S, Chen F, Xie W, Wang J, Zheng J and Gao Z Protocol design and implementation based on hierarchical state machine for underwater acoustic networks Proceedings of the 11th International Conference on Underwater Networks & Systems, (1-5)
- Jain S and Kinber E Intrinsic Complexity of Partial Learning Algorithmic Learning Theory, (174-188)
- Zhang X, Feng Z, Wang X, Rao G and Wu W Context-Free Path Queries on RDF Graphs The Semantic Web – ISWC 2016, (632-648)
- Dutta T, Heath L, Kumar V and Marathe M (2016). Labeled cuts in graphs, Theoretical Computer Science, 648:C, (34-39), Online publication date: 4-Oct-2016.
- Ciobanu L and Kolpakov A (2016). Geodesic growth of right-angled Coxeter groups based on trees, Journal of Algebraic Combinatorics: An International Journal, 44:2, (249-264), Online publication date: 1-Sep-2016.
- Ye L, Dague P, Longuet D, Briones L and Madalinski A Fault manifestability verification for discrete event systems Proceedings of the Twenty-second European Conference on Artificial Intelligence, (1718-1719)
- Toman D and Weddell G On partial features in the DLFDLF family of description logics Proceedings of the 14th Pacific Rim International Conference on Trends in Artificial Intelligence, (529-542)
- Bourhis P, Puppis G, Riveros C and Staworko S (2016). Bounded Repairability for Regular Tree Languages, ACM Transactions on Database Systems, 41:3, (1-45), Online publication date: 8-Aug-2016.
- Broda S, Machiavelo A, Moreira N and Reis R Position Automaton Construction for Regular Expressions with Intersection Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (51-63)
- Uezato Y and Minamide Y Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (393-405)
- Kwee K and Otto F On Ordered RRWW-Automata Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (268-279)
- Jirásek J Non-regular Maximal Prefix-Free Subsets of Regular Languages Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (229-242)
- Ibarra O and Mcquillan I On Families of Full Trios Containing Counter Machine Languages Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (216-228)
- Grabon M, Michaliszyn J, Otop J and Wieczorek P Querying data graphs with arithmetical regular expressions Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (1088-1094)
- Adriaensen S and Nowé A Towards a white box approach to automated algorithm design Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (554-560)
- D'Antoni L and Veanes M Minimization of Symbolic Tree Automata Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (873-882)
- Wang Q and Otto F (2016). Weighted restarting automata and pushdown relations, Theoretical Computer Science, 635:C, (1-15), Online publication date: 4-Jul-2016.
- Srivastava A, Nayak A and Kapoor K (2016). On del-robust primitive words, Discrete Applied Mathematics, 206:C, (115-121), Online publication date: 19-Jun-2016.
- Jastrzab T (2016). On Parallel Induction of Nondeterministic Finite Automata, Procedia Computer Science, 80:C, (257-268), Online publication date: 1-Jun-2016.
- Jing Y, Ahn G, Doupé A and Yi J Checking Intent-based Communication in Android with Intent Space Analysis Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, (735-746)
- Fortnow L and Santhanam R New non-uniform lower bounds for uniform classes Proceedings of the 31st Conference on Computational Complexity, (1-14)
- Li L and Qiu D (2016). Lower bounds on the size of semi-quantum finite automata, Theoretical Computer Science, 623:C, (75-82), Online publication date: 11-Apr-2016.
- Esparza J, Ganty P and Majumdar R (2016). Parameterized Verification of Asynchronous Shared-Memory Systems, Journal of the ACM, 63:1, (1-48), Online publication date: 30-Mar-2016.
- Yu X, Feng W, Yao D and Becchi M O3FA Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems, (1-11)
- Kwee K and Otto F On the Effects of Nondeterminism on Ordered Restarting Automata Proceedings of the 42nd International Conference on SOFSEM 2016: Theory and Practice of Computer Science - Volume 9587, (369-380)
- Garhwal S and Jiwari R (2016). Conversion of fuzzy automata into fuzzy regular expressions using transitive closure, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 30:6, (3123-3129), Online publication date: 1-Jan-2016.
- Polozov O and Gulwani S (2015). FlashMeta: a framework for inductive program synthesis, ACM SIGPLAN Notices, 50:10, (107-126), Online publication date: 18-Dec-2015.
- Hofmann M Limits of empirical validation Proceedings of the 2015 Winter Simulation Conference, (4069-4080)
- Shu X, Yao D and Ryder B A Formal Framework for Program Anomaly Detection Proceedings of the 18th International Symposium on Research in Attacks, Intrusions, and Defenses - Volume 9404, (270-292)
- Wolf T, Chandrikakutty H, Kekai Hu , Unnikrishnan D and Tessier R (2015). Securing Network Processors with High-Performance Hardware Monitors, IEEE Transactions on Dependable and Secure Computing, 12:6, (652-664), Online publication date: 1-Nov-2015.
- Diekert V, Muscholl A and Walukiewicz I A Note on Monitors and Büchi Automata Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (39-57)
- Ody H Undecidability Results for Multi-Lane Spatial Logic Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (404-421)
- Rodriguez M The Gremlin graph traversal machine and language (invited talk) Proceedings of the 15th Symposium on Database Programming Languages, (1-10)
- Pearce D The whiley rewrite language (WyRL) Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, (161-166)
- Polozov O and Gulwani S FlashMeta: a framework for inductive program synthesis Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (107-126)
- D'antoni L, Veanes M, Livshits B and Molnar D (2015). Fast, ACM Transactions on Programming Languages and Systems, 38:1, (1-32), Online publication date: 16-Oct-2015.
- Abid R, Salaün G, Palma N and Gueye S Asynchronous Coordination of Stateful Autonomic Managers in the Cloud Revised Selected Papers of the 12th International Conference on Formal Aspects of Component Software - Volume 9539, (48-65)
- Isradisaikul C and Myers A (2015). Finding counterexamples from parsing conflicts, ACM SIGPLAN Notices, 50:6, (555-564), Online publication date: 7-Aug-2015.
- Fernando T Types from Frames as Finite Automata Proceedings of the 20th and 21st International Conferences on Formal Grammar - Volume 9804, (19-40)
- Papadopoulos A, Roy P, Régin J and Pachet F Generating all possible palindromes from ngram corpora Proceedings of the 24th International Conference on Artificial Intelligence, (2489-2495)
- Alechina N, Bulling N, Logan B and Nguyen H On the boundary of (un)decidability Proceedings of the 24th International Conference on Artificial Intelligence, (1494-1501)
- Xue Y, Wang J, Liu Y, Xiao H, Sun J and Chandramohan M Detection and classification of malicious JavaScript via attack behavior modelling Proceedings of the 2015 International Symposium on Software Testing and Analysis, (48-59)
- He C and Huang M Branching Bisimilarity on Normed BPA Is EXPTIME-Complete Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (180-191)
- Zetzsche G An Approach to Computing Downward Closures Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135, (440-451)
- Chatterjee K, Henzinger T, Ibsen-Jensen R and Otop J Edit Distance for Pushdown Automata Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135, (121-133)
- Juayong R and Adorna H (2015). Relating Computations in Non-cooperative Transition P Systems and Evolution-Communication P Systems with Energy, Fundamenta Informaticae, 136:3, (209-217), Online publication date: 1-Jul-2015.
- Denning P and Dennis J (2015). Machines, Languages, and Computation at MIT, IEEE Annals of the History of Computing, 37:3, (76-77), Online publication date: 1-Jul-2015.
- Mäkelä J and Leppänen V Towards an extensible, modular compiler construction with scalable abstractions and types Proceedings of the 16th International Conference on Computer Systems and Technologies, (112-119)
- Isradisaikul C and Myers A Finding counterexamples from parsing conflicts Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, (555-564)
- Baier C and Moor T (2015). A hierarchical and modular control architecture for sequential behaviours, Discrete Event Dynamic Systems, 25:1-2, (95-124), Online publication date: 1-Jun-2015.
- Veanes M, Mytkowicz T, Molnar D and Livshits B (2015). Data-Parallel String-Manipulating Programs, ACM SIGPLAN Notices, 50:1, (139-152), Online publication date: 11-May-2015.
- Etessami K and Yannakakis M (2015). Recursive Markov Decision Processes and Recursive Stochastic Games, Journal of the ACM, 62:2, (1-69), Online publication date: 6-May-2015.
- Sonu E and Doshi P (2015). Scalable solutions of interactive POMDPs using generalized and bounded policy iteration, Autonomous Agents and Multi-Agent Systems, 29:3, (455-494), Online publication date: 1-May-2015.
- Halamish S and Kupferman O (2015). Minimizing Deterministic Lattice Automata, ACM Transactions on Computational Logic, 16:1, (1-21), Online publication date: 1-Mar-2015.
- Qiu D, Li L, Mateus P and Sernadas A (2015). Exponentially more concise quantum recognition of non-RMM regular languages, Journal of Computer and System Sciences, 81:2, (359-375), Online publication date: 1-Mar-2015.
- Veanes M, Mytkowicz T, Molnar D and Livshits B Data-Parallel String-Manipulating Programs Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (139-152)
- Firsov D and Uustalu T Certified Normalization of Context-Free Grammars Proceedings of the 2015 Conference on Certified Programs and Proofs, (167-174)
- Ibarra O and Seki S (2015). Semilinear Sets and Counter Machines, Fundamenta Informaticae, 138:1-2, (61-76), Online publication date: 1-Jan-2015.
- Mayr E and Weihmann J (2015). Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms, Fundamenta Informaticae, 137:1, (61-86), Online publication date: 1-Jan-2015.
- Vollweiler M (2015). Asynchronous Systems of Parallel Communicating Finite Automata, Fundamenta Informaticae, 136:1-2, (177-197), Online publication date: 1-Jan-2015.
- Pighizzini G and Pisoni A (2015). Limited Automata and Context-Free Languages, Fundamenta Informaticae, 136:1-2, (157-176), Online publication date: 1-Jan-2015.
- Parr T, Harwell S and Fisher K (2014). Adaptive LL(*) parsing, ACM SIGPLAN Notices, 49:10, (579-598), Online publication date: 31-Dec-2015.
- Brázdil T, Kiefer S and Kŭcera A (2014). Efficient Analysis of Probabilistic Programs with an Unbounded Counter, Journal of the ACM, 61:6, (1-35), Online publication date: 17-Dec-2014.
- Soulé R, Basu S, Marandi P, Pedone F, Kleinberg R, Sirer E and Foster N Merlin Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, (213-226)
- Geffert V, Guillon B and Pighizzini G (2014). Two-way automata making choices only at the endmarkers, Information and Computation, 239:C, (71-86), Online publication date: 1-Dec-2014.
- Fulton N, Omar C and Aldrich J Statically typed string sanitation inside a python Proceedings of the 2014 International Workshop on Privacy & Security in Programming, (3-10)
- Karaivanov S, Raychev V and Vechev M Phrase-Based Statistical Translation of Programming Languages Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software, (173-184)
- Kim H and Han Y Online Multiple Palindrome Pattern Matching Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799, (173-178)
- Parr T, Harwell S and Fisher K Adaptive LL(*) parsing Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, (579-598)
- Esparza J, Ganty P and Poch T (2014). Pattern-Based Verification for Multithreaded Programs, ACM Transactions on Programming Languages and Systems, 36:3, (1-29), Online publication date: 25-Sep-2014.
- Mondal N and Ghosh P (2014). RETRACTED, Theoretical Computer Science, 551:C, (116-131), Online publication date: 25-Sep-2014.
- Valmari A (2014). Asymptotic proportion of hard instances of the halting problem, Acta Cybernetica, 21:3, (307-330), Online publication date: 1-Aug-2014.
- Lomuscio A and Michaliszyn J Model checking unbounded artifact-centric systems Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, (488-497)
- Veanes M, BjØrner N, Nachmanson L and Bereg S Monadic Decomposition Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559, (628-645)
- Maretić G, Dashti M and Basin D Anchored LTL separation Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (1-9)
- Madejski G (2014). Infinite Hierarchy of Permutation Languages, Fundamenta Informaticae, 130:3, (263-274), Online publication date: 1-Jul-2014.
- D'Antoni L, Veanes M, Livshits B and Molnar D Fast Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, (384-394)
- D'Antoni L, Veanes M, Livshits B and Molnar D (2014). Fast, ACM SIGPLAN Notices, 49:6, (384-394), Online publication date: 5-Jun-2014.
- Gómez-Rodríguez C (2014). Finding the smallest binarization of a CFG is NP-hard, Journal of Computer and System Sciences, 80:4, (796-805), Online publication date: 1-Jun-2014.
- Lin S and Hsiung P Compositional Synthesis of Concurrent Systems through Causal Model Checking and Learning Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442, (416-431)
- Chatterjee K, Ibsen-Jensen R and Majumdar R Edit distance for timed automata Proceedings of the 17th international conference on Hybrid systems: computation and control, (303-312)
- Bollig B, Gastin P, Monmege B and Zeitoun M (2014). Pebble Weighted Automata and Weighted Logics, ACM Transactions on Computational Logic, 15:2, (1-35), Online publication date: 1-Apr-2014.
- Zheng S, Gruska J and Qiu D On the State Complexity of Semi-quantum Finite Automata Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (601-612)
- Kalociński D On Computability and Learnability of the Pumping Lemma Function Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (433-440)
- Bhateja P A TGV-like approach for asynchronous testing Proceedings of the 7th India Software Engineering Conference, (1-6)
- D'Antoni L and Veanes M (2014). Minimization of symbolic automata, ACM SIGPLAN Notices, 49:1, (541-553), Online publication date: 13-Jan-2014.
- D'Antoni L and Veanes M Minimization of symbolic automata Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (541-553)
- Toman D and Weddell G Conjunctive Query Answering in ${\mathcal{CFD}}_{nc}$ Proceedings of the 26th Australasian Joint Conference on AI 2013: Advances in Artificial Intelligence - Volume 8272, (350-361)
- Soulé R, Basu S, Kleinberg R, Sirer E and Foster N Managing the network with Merlin Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks, (1-7)
- Xiao H, Sun J, Liu Y, Lin S and Sun C TzuYu Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering, (432-442)
- Losemann K and Martens W (2013). The complexity of regular expressions and property paths in SPARQL, ACM Transactions on Database Systems, 38:4, (1-39), Online publication date: 1-Nov-2013.
- Cojocaru L and Mäkinen E (2013). The Complexity of Szilard Languages of Matrix Grammars Revisited, Fundamenta Informaticae, 123:4, (381-399), Online publication date: 1-Oct-2013.
- Andersen J, Brabrand C and Christiansen D (2013). Banana Algebra, Science of Computer Programming, 78:10, (1845-1870), Online publication date: 1-Oct-2013.
- Lustig Y and Vardi M (2013). Synthesis from component libraries, International Journal on Software Tools for Technology Transfer (STTT), 15:5-6, (603-618), Online publication date: 1-Oct-2013.
- Nelson T, Guha A, Dougherty D, Fisler K and Krishnamurthi S A balance of power Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking, (79-84)
- Maia E, Moreira N and Reis R Incomplete transition complexity of basic operations on finite languages Proceedings of the 18th international conference on Implementation and Application of Automata, (349-356)
- Kutrib M, Malcher A, Mereghetti C, Palano B and Wendlandt M Input-Driven queue automata Proceedings of the 18th international conference on Implementation and Application of Automata, (232-243)
- Holzer M and Jakobi S Brzozowski's minimization algorithm Proceedings of the 18th international conference on Implementation and Application of Automata, (181-192)
- Filiot E, Gauwin O, Reynier P and Servais F From Two-Way to One-Way Finite State Transducers Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (468-477)
- Alur R, Durand-Gasselin A and Trivedi A From Monadic Second-Order Definable String Transformations to Transducers Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (458-467)
- Yang X, Wang B, Qiu T, Wang Y and Li C Improving regular-expression matching on strings using negative factors Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, (361-372)
- Basin D, Jugé V, Klaedtke F and Zălinescu E (2013). Enforceable Security Policies Revisited, ACM Transactions on Information and System Security, 16:1, (1-26), Online publication date: 1-Jun-2013.
- Roszkowska E and Reveliotis S (2013). A distributed protocol for motion coordination in free-range vehicular systems, Automatica (Journal of IFAC), 49:6, (1639-1653), Online publication date: 1-Jun-2013.
- Chandrikakutty H, Unnikrishnan D, Tessier R and Wolf T High-performance hardware monitors to protect network processors from data plane attacks Proceedings of the 50th Annual Design Automation Conference, (1-6)
- Inverardi P and Tivoli M Automatic synthesis of modular connectors via composition of protocol mediation patterns Proceedings of the 2013 International Conference on Software Engineering, (3-12)
- Yu X and Becchi M GPU acceleration of regular expression matching for large datasets Proceedings of the ACM International Conference on Computing Frontiers, (1-10)
- Pighizzini G (2013). Two-Way Finite Automata, Fundamenta Informaticae, 126:2-3, (225-246), Online publication date: 1-Apr-2013.
- Coggins P (2013). A pedagogical example of a stretched password-based key derivation function, Journal of Computing Sciences in Colleges, 28:4, (125-131), Online publication date: 1-Apr-2013.
- Trafton J, Hiatt L, Harrison A, Tamborello F, Khemlani S and Schultz A (2013). ACT-R/E, Journal of Human-Robot Interaction, 2:1, (30-55), Online publication date: 27-Feb-2013.
- Choi H and Burgstaller B Non-blocking parallel subset construction on shared-memory multicore architectures Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140, (13-20)
- Bonchi F and Pous D (2013). Checking NFA equivalence with bisimulations up to congruence, ACM SIGPLAN Notices, 48:1, (457-468), Online publication date: 23-Jan-2013.
- Bonchi F and Pous D Checking NFA equivalence with bisimulations up to congruence Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (457-468)
- Wang P Motivation management in AGI systems Proceedings of the 5th international conference on Artificial General Intelligence, (352-361)
- Rozier K and Vardi M Deterministic compilation of temporal safety properties in explicit state model checking Proceedings of the 8th international conference on Hardware and Software: verification and testing, (243-259)
- Garzon M (2012). Ubiquity symposium: Evolutionary computation and the processes of life, Ubiquity, 2012:November, (1-16), Online publication date: 1-Nov-2012.
- Subramanian K, Hemalatha S and Venkat I On Watson-Crick automata Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology, (151-156)
- Salvagnin D and Walsh T A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 7514, (633-646)
- Atig M, Bouajjani A, Narayan Kumar K and Saivasan P Linear-Time model-checking for multithreaded programs under scope-bounding Proceedings of the 10th international conference on Automated Technology for Verification and Analysis, (152-166)
- Cassel S, Jonsson B, Howar F and Steffen B A succinct canonical register automaton model for data domains with binary relations Proceedings of the 10th international conference on Automated Technology for Verification and Analysis, (57-71)
- Güdemann M, Salaün G and Ouederni M Counterexample guided synthesis of monitors for realizability enforcement Proceedings of the 10th international conference on Automated Technology for Verification and Analysis, (238-253)
- Ceccherini-Silberstein T, Coornaert M, Fiorenzi F and Schupp P (2012). Groups, graphs, languages, automata, games and second-order monadic logic, European Journal of Combinatorics, 33:7, (1330-1368), Online publication date: 1-Oct-2012.
- Carayol A and Ésik Z A context-free linear ordering with an undecidable first-order theory Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (104-118)
- Jirásková G and Nagy B On union-free and deterministic union-free languages Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (179-192)
- Mateus P, Qiu D and Li L (2012). On the complexity of minimizing probabilistic and quantum automata, Information and Computation, 218, (36-53), Online publication date: 1-Sep-2012.
- Nagy B On efficient algorithms for SAT Proceedings of the 13th international conference on Membrane Computing, (295-310)
- Löding C and Repke S Regularity problems for weak pushdown ω-automata and games Proceedings of the 37th international conference on Mathematical Foundations of Computer Science, (764-776)
- Han Y, Ko S and Salomaa K Computing the edit-distance between a regular language and a context-free language Proceedings of the 16th international conference on Developments in Language Theory, (85-96)
- Lavado G, Pighizzini G and Seki S Converting nondeterministic automata and context-free grammars into parikh equivalent deterministic automata Proceedings of the 16th international conference on Developments in Language Theory, (284-295)
- Kutrib M, Malcher A and Wendlandt M States and heads do count for unary multi-head finite automata Proceedings of the 16th international conference on Developments in Language Theory, (214-225)
- Holzer M and Jakobi S From equivalence to almost-equivalence, and beyond--minimizing automata with errors Proceedings of the 16th international conference on Developments in Language Theory, (190-201)
- Holzer M, Jakobi S and McQuillan I Generalized derivations with synchronized context-free grammars Proceedings of the 16th international conference on Developments in Language Theory, (109-120)
- Hoffmann M, Holt D, Owens M and Thomas R Semigroups with a context-free word problem Proceedings of the 16th international conference on Developments in Language Theory, (97-108)
- Bouyer P, Markey N, Ouaknine J, Schnoebelen P and Worrell J (2012). On termination and invariance for faulty channel machines, Formal Aspects of Computing, 24:4-6, (595-607), Online publication date: 1-Jul-2012.
- Esparza J, Ganty P and Majumdar R A Perfect Model for Bounded Verification Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (285-294)
- Bundala D, Ouaknine J and Worrell J On the Magnitude of Completeness Thresholds in Bounded Model Checking Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (155-164)
- Koschmieder A and Leser U Regular path queries on large graphs Proceedings of the 24th international conference on Scientific and Statistical Database Management, (177-194)
- Degano P, Ferrari G, Galletta L and Mezzetti G Types for coordinating secure behavioural variations Proceedings of the 14th international conference on Coordination Models and Languages, (261-276)
- Tabor W, Cho P and Szkudlarek E Fractal unfolding Proceedings of the 3rd Workshop on Cognitive Modeling and Computational Linguistics, (41-50)
- Burgstaller B, Scholz B and Blieberger J (2012). A symbolic analysis framework for static analysis of imperative programming languages, Journal of Systems and Software, 85:6, (1418-1439), Online publication date: 1-Jun-2012.
- Losemann K and Martens W The complexity of evaluating path expressions in SPARQL Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, (101-112)
- Arora D, Hazela B and Saxena V (2012). Semantics for UML model transformation and generation of regular grammar, ACM SIGSOFT Software Engineering Notes, 37:3, (1-5), Online publication date: 16-May-2012.
- Bližnák M, Dulík T and Jašek R Round-trip software engineering with codedesigner RAD Proceedings of the 5th WSEAS congress on Applied Computing conference, and Proceedings of the 1st international conference on Biologically Inspired Computation, (68-73)
- Dennunzio A, Formenti E and Manzoni L (2012). Computing Issues of Asynchronous CA, Fundamenta Informaticae, 120:2, (165-180), Online publication date: 1-Apr-2012.
- LaValle S (2012). Sensing and Filtering, Foundations and Trends in Robotics, 1:4, (253-372), Online publication date: 1-Apr-2012.
- Sales A SAN lite-solver Proceedings of the 2012 Symposium on Theory of Modeling and Simulation - DEVS Integrative M&S Symposium, (1-8)
- Long Z, Calin G, Majumdar R and Meyer R Language-Theoretic abstraction refinement Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering, (362-376)
- Brihaye T, Bruyère V, De Pril J and Gimbert H Subgame perfection for equilibria in quantitative reachability games Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (286-300)
- Basin D, Jugé V, Klaedtke F and Zălinescu E Enforceable security policies revisited Proceedings of the First international conference on Principles of Security and Trust, (309-328)
- Hundeshagen N and Otto F Characterizing the rational functions by restarting transducers Proceedings of the 6th international conference on Language and Automata Theory and Applications, (325-336)
- Geffert V, Guillon B and Pighizzini G Two-Way automata making choices only at the endmarkers Proceedings of the 6th international conference on Language and Automata Theory and Applications, (264-276)
- Simmons R (2012). Profile Dickie Georgelooking back on 40 years at the NSA, XRDS: Crossroads, The ACM Magazine for Students, 18:3, (40-41), Online publication date: 1-Mar-2012.
- Bhattacharyya M (2012). Simulating a Turing machine, XRDS: Crossroads, The ACM Magazine for Students, 18:3, (43-45), Online publication date: 1-Mar-2012.
- David J (2012). Average complexity of Moore's and Hopcroft's algorithms, Theoretical Computer Science, 417, (50-65), Online publication date: 1-Feb-2012.
- Lavado G and Pighizzini G Parikh's theorem and descriptional complexity Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (361-372)
- Kari L, Kopecki S and Seki S Iterated hairpin completions of non-crossing words Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (337-348)
- Kotek T and Makowsky J (2012). A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths, Fundamenta Informaticae, 117:1-4, (199-213), Online publication date: 1-Jan-2012.
- Rampersad N, Shallit J and Xu Z (2012). The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages, Fundamenta Informaticae, 116:1-4, (223-236), Online publication date: 1-Jan-2012.
- Donald B The compass that steered robotics Logic and Program Semantics, (50-65)
- Bergenthum R, Desel J, Harrer A and Mauser S Modeling and mining of learnflows Transactions on Petri Nets and Other Models of Concurrency V, (22-50)
- Ionescu M, Păun G, Pérez-Jiménez M and Yokomori T (2011). Spiking Neural dP Systems, Fundamenta Informaticae, 111:4, (423-436), Online publication date: 1-Dec-2011.
- Diep M, Dwyer M and Elbaum S (2011). Lattice-Based Sampling for Path Property Monitoring, ACM Transactions on Software Engineering and Methodology, 21:1, (1-43), Online publication date: 1-Dec-2011.
- Alur R, Chaudhuri S and Madhusudan P (2011). Software model checking using languages of nested trees, ACM Transactions on Programming Languages and Systems, 33:5, (1-45), Online publication date: 1-Nov-2011.
- Bischof E and Sabitzer B Computer science in primary schools – not possible, but necessary?! Proceedings of the 5th international conference on Informatics in Schools: situation, Evolution and Perspectives, (94-105)
- Lin S, André É, Dong J, Sun J and Liu Y An efficient algorithm for learning event-recording automata Proceedings of the 9th international conference on Automated technology for verification and analysis, (463-472)
- Cassel S, Howar F, Jonsson B, Merten M and Steffen B A succinct canonical register automaton model Proceedings of the 9th international conference on Automated technology for verification and analysis, (366-380)
- Fu H Model checking EGF on basic parallel processes Proceedings of the 9th international conference on Automated technology for verification and analysis, (120-134)
- Turaev S, Othman M, Selamat M and Krassovitskiy A Parsing algorithms for grammars with regulated rewriting Proceedings of the 11th WSEAS international conference on Applied computer science, (103-109)
- Brijder R, Gillis J and Van Den Bussche J Graph-theoretic formalization of hybridization in DNA sticker complexes Proceedings of the 17th international conference on DNA computing and molecular programming, (49-63)
- Homenda W and Sitarek T Performing operations on structured information space of Braille music Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV, (232-241)
- Ben-David S, Chechik M, Gurfinkel A and Uchitel S CSSL Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, (37-47)
- Cojocaru L and Mäkinen E On the complexity of szilard languages of regulated grammars Proceedings of the 8th international conference on Theoretical aspects of computing, (77-94)
- Nessel J and Cimpa B The MovieOracle - Content Based Movie Recommendations Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03, (361-364)
- Fredrikson M, Christodorescu M and Jha S Dynamic behavior matching Proceedings of the 23rd international conference on Automated deduction, (252-267)
- Valdats M Transition function complexity of finite automata Proceedings of the 13th international conference on Descriptional complexity of formal systems, (301-313)
- Malcher A, Mereghetti C and Palano B Descriptional complexity of two-way pushdown automata with restricted head reversals Proceedings of the 13th international conference on Descriptional complexity of formal systems, (248-260)
- Alpoge L, Ang T, Schaeffer L and Shallit J Decidability and shortest strings in formal languages Proceedings of the 13th international conference on Descriptional complexity of formal systems, (55-67)
- Ibarra O and Yen H On two-way transducers Proceedings of the 15th international conference on Developments in language theory, (300-311)
- Holzer M, Kutrib M and Leiter U Nodes connected by path languages Proceedings of the 15th international conference on Developments in language theory, (276-287)
- Holzer M and Jakobi S Chop operations and expressions Proceedings of the 15th international conference on Developments in language theory, (264-275)
- Yu S and Gao Y State complexity research and approximation Proceedings of the 15th international conference on Developments in language theory, (46-57)
- Baroni P, Cerutti F, Dunne P and Giacomin M Computing with infinite argumentation frameworks Proceedings of the First international conference on Theory and Applications of Formal Argumentation, (197-214)
- Holzer M and Kutrib M Gaining power by input operations Proceedings of the 16th international conference on Implementation and application of automata, (16-29)
- Hanneforth T A practical algorithm for intersecting weighted context-free grammars with finite-state automata Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, (57-64)
- Brázdil T, Kiefer S, Kučera A and Vařeková I Runtime analysis of probabilistic programs with unbounded recursion Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (319-331)
- Zetzsche G On the capabilities of grammars, automata, and transducers controlled by monoids Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (222-233)
- Bojańczyk M, David C, Muscholl A, Schwentick T and Segoufin L (2011). Two-variable logic on data words, ACM Transactions on Computational Logic, 12:4, (1-26), Online publication date: 1-Jul-2011.
- Di Guglielmo G, Fujita M, Fummi F, Pravadelli G and Soffia S EFSM-based model-driven approach to concolic testing of system-level design Proceedings of the Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign, (201-209)
- Blondel V, Gaubert S and Portier N (2011). The set of realizations of a max-plus linear sequence is semi-polyhedral, Journal of Computer and System Sciences, 77:4, (820-833), Online publication date: 1-Jul-2011.
- Manea F Deciding according to the shortest computations Proceedings of the 7th conference on Models of computation in context: computability in Europe, (191-200)
- Veanes M and Bjørner N Symbolic tree transducers Proceedings of the 8th international conference on Perspectives of System Informatics, (377-393)
- Zuzak I, Budiselic I and Delac G Formal modeling of RESTful systems using finite-state machines Proceedings of the 11th international conference on Web engineering, (346-360)
- Hewlett D and Cohen P Fully unsupervised word segmentation with BVE and MDL Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2, (540-545)
- Crescenzi P, Gildea D, Marino A, Rossi G and Satta G Optimal head-driven parsing complexity for linear context-free rewriting systems Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1, (450-459)
- Deutch D and Milo T A quest for beauty and wealth (or, business processes for database researchers) Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (1-12)
- Mesbah A and Prasad M Automated cross-browser compatibility testing Proceedings of the 33rd International Conference on Software Engineering, (561-570)
- Yu F, Alkhalaf M and Bultan T Patching vulnerabilities with sanitization synthesis Proceedings of the 33rd International Conference on Software Engineering, (251-260)
- Mitankin P, Mihov S and Schulz K (2011). Deciding word neighborhood with universal neighborhood automata, Theoretical Computer Science, 412:22, (2340-2355), Online publication date: 1-May-2011.
- Leupold P and Otto F (2011). On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems, Fundamenta Informaticae, 112:2-3, (219-238), Online publication date: 1-Apr-2011.
- Chen Z (2011). On the Generative Power of ω-Grammars and ω-Automata, Fundamenta Informaticae, 111:2, (119-145), Online publication date: 1-Apr-2011.
- Maletti A (2011). An alternative to synchronous tree substitution grammars*, Natural Language Engineering, 17:2, (221-242), Online publication date: 1-Apr-2011.
- Møller A and Schwarz M HTML Validation of context-free languages Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software, (426-440)
- Cautis B, Deutsch A, Onose N and Vassalos V (2011). Querying XML data sources that export very large sets of views, ACM Transactions on Database Systems, 36:1, (1-42), Online publication date: 1-Mar-2011.
- Moore N (2011). Computational complexity of the problem of tree generation under fine-grained access control policies, Information and Computation, 209:3, (548-567), Online publication date: 1-Mar-2011.
- Bordihn H, Holzer M and Kutrib M (2011). Decidability of operation problems for T0L languages and subclasses, Information and Computation, 209:3, (344-352), Online publication date: 1-Mar-2011.
- Maletti A (2011). Survey, Acta Cybernetica, 20:2, (223-250), Online publication date: 1-Feb-2011.
- Esparza J and Ganty P Complexity of pattern-based verification for multithreaded programs Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (499-510)
- Henglein F and Nielsen L Regular expression containment Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (385-398)
- Madhusudan P and Parlato G The tree width of auxiliary storage Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (283-294)
- Esparza J and Ganty P (2011). Complexity of pattern-based verification for multithreaded programs, ACM SIGPLAN Notices, 46:1, (499-510), Online publication date: 26-Jan-2011.
- Henglein F and Nielsen L (2011). Regular expression containment, ACM SIGPLAN Notices, 46:1, (385-398), Online publication date: 26-Jan-2011.
- Madhusudan P and Parlato G (2011). The tree width of auxiliary storage, ACM SIGPLAN Notices, 46:1, (283-294), Online publication date: 26-Jan-2011.
- Hooimeijer P and Veanes M An evaluation of automata algorithms for string analysis Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation, (248-262)
- Chiniforooshan E, Daley M, Ibarra O, Kari L and Seki S One-reversal counter machines and multihead automata Proceedings of the 37th international conference on Current trends in theory and practice of computer science, (166-177)
- Gandhi A, Ke N and Khoussainov B Descriptional complexity of determinization and complementation for finite automata Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119, (95-104)
- Gandhi A, Ke N and Khoussainov B Descriptional complexity of determinization and complementation for finite automata Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119, (95-104)
- Tran N (2011). Characterizations and Existence of Easy Sets without Hard Subsets, Fundamenta Informaticae, 110:1-4, (321-328), Online publication date: 1-Jan-2011.
- Drewes F Selected decision problems for square-refinement collage grammars Algebraic Foundations in Computer Science, (1-29)
- Huova M, Karhumäki J, Saarela A and Saari K Local squares, periodicity and finite automata Rainbow of computer science, (90-101)
- Ésik Z and Kuich W A unifying Kleene theorem for weighted finite automata Rainbow of computer science, (76-89)
- Kaminski M and Tan T (2010). A Note on Two-pebble Automata Over Infinite Alphabets, Fundamenta Informaticae, 98:4, (379-390), Online publication date: 1-Dec-2010.
- Li M and Kokar M (2010). On the use of Q2abstractions to lower the computational cost of derivation of conflict resolution advisories in air traffic control, IEEE Transactions on Intelligent Transportation Systems, 11:4, (954-967), Online publication date: 1-Dec-2010.
- Zhang G (2010). Closures in Binary Partial Algebras, Electronic Notes in Theoretical Computer Science (ENTCS), 257, (3-18), Online publication date: 1-Dec-2010.
- Fanello S, Gori I and Pirri F Arm-hand behaviours modelling Proceedings of the 6th international conference on Advances in visual computing - Volume Part II, (616-627)
- Tabakov D and Vardi M Optimized temporal monitors for SystemC Proceedings of the First international conference on Runtime verification, (436-451)
- Dwyer M, Purandare R and Person S Runtime verification in context Proceedings of the First international conference on Runtime verification, (36-50)
- Lee J, Pham M, Lee J, Han W, Cho H, Yu H and Lee J Processing SPARQL queries with regular expressions in RDF databases Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics, (23-30)
- Purandare R, Dwyer M and Elbaum S (2010). Monitor optimization via stutter-equivalent loop transformation, ACM SIGPLAN Notices, 45:10, (270-285), Online publication date: 17-Oct-2010.
- Purandare R, Dwyer M and Elbaum S Monitor optimization via stutter-equivalent loop transformation Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (270-285)
- Veanes M, Bjørner N and De Moura L Symbolic automata constraint solving Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning, (640-654)
- Nakamura K and Imada K Incremental learning of cellular automata for parallel recognition of formal languages Proceedings of the 13th international conference on Discovery science, (117-131)
- Jain S and Kinber E Inductive inference of languages from samplings Proceedings of the 21st international conference on Algorithmic learning theory, (330-344)
- Sugiyama M, Hirowatari E, Tsuiki H and Yamamoto A Learning figures with the hausdorff metric by fractals Proceedings of the 21st international conference on Algorithmic learning theory, (315-329)
- Ouedraogo L, Khoumsi A and Nourelfath M (2010). SetExp, Real-Time Systems, 46:2, (189-250), Online publication date: 1-Oct-2010.
- Chen Z and Motet G Nevertrace claims for model checking Proceedings of the 17th international SPIN conference on Model checking software, (162-179)
- Chatterjee K and Henzinger T Probabilistic automata on infinite words Proceedings of the 8th international conference on Automated technology for verification and analysis, (1-16)
- Potapova A and Su J On nondeterministic workflow executions Proceedings of the 7th international conference on Web services and formal methods, (176-190)
- Kucukoguz E and Su J On lifecycle constraints of artifact-centric workflows Proceedings of the 7th international conference on Web services and formal methods, (71-85)
- Albert E, Arenas P, Genaim S, Puebla G and Deantes D From object fields to local variables Proceedings of the 17th international conference on Static analysis, (100-116)
- Basten H Tracking down the origins of ambiguity in context-free grammars Proceedings of the 7th International colloquium conference on Theoretical aspects of computing, (76-90)
- Chandramouli B, Goldstein J and Maier D (2010). High-performance dynamic pattern matching over disordered streams, Proceedings of the VLDB Endowment, 3:1-2, (220-231), Online publication date: 1-Sep-2010.
- Won S, Song I, Lee S and Park C (2010). Identification of finite state automata with a class of recurrent neural networks, IEEE Transactions on Neural Networks, 21:9, (1408-1421), Online publication date: 1-Sep-2010.
- Clemente L and Mayr R Multipebble simulations for alternating automata Proceedings of the 21st international conference on Concurrency theory, (297-312)
- Holzer M and Kutrib M Descriptional complexity of (un)ambiguous finite state machines and pushdown automata Proceedings of the 4th international conference on Reachability problems, (1-23)
- Li L and Qiu D Revisiting the power and equivalence of one-way quantum finite automata Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing, (1-8)
- Restivo A and Vaglica R Automata with extremal minimality conditions Proceedings of the 14th international conference on Developments in language theory, (399-410)
- Geffert V and Pighizzini G Two-way unary automata versus logarithmic space Proceedings of the 14th international conference on Developments in language theory, (197-208)
- Bordihn H, Kutrib M and Malcher A Undecidability and hierarchy results for parallel communicating finite automata Proceedings of the 14th international conference on Developments in language theory, (88-99)
- Holzer M and Kutrib M The complexity of regular(-like) expressions Proceedings of the 14th international conference on Developments in language theory, (16-30)
- Le Maout V Regular expressions at their best Proceedings of the 15th international conference on Implementation and application of automata, (310-320)
- Tîrnăucă C and Tîrnăucă C Types of trusted information that make DFA identification with correction queries feasible Proceedings of the 15th international conference on Implementation and application of automata, (272-281)
- Diekert V and Kopecki S Complexity results and the growths of hairpin completions of regular languages Proceedings of the 15th international conference on Implementation and application of automata, (105-114)
- Cui B, Gao Y, Kari L and Yu S State complexity of catenation combined with union and intersection Proceedings of the 15th international conference on Implementation and application of automata, (95-104)
- Cimatti A, Mover S, Roveri M and Tonetta S From sequential extended regular expressions to NFA with symbolic labels Proceedings of the 15th international conference on Implementation and application of automata, (87-94)
- Bulling N and Farwer B On the (Un-)Decidability of Model Checking Resource-Bounded Agents Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (567-572)
- Brabrand C and Thomsen J Typed and unambiguous pattern matching on strings using regular expressions Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, (243-254)
- Kazakov Y An extension of complex role inclusion axioms in the description logic SROIQ Proceedings of the 5th international conference on Automated Reasoning, (472-486)
- Ganty P, Majumdar R and Monmege B Bounded underapproximations Proceedings of the 22nd international conference on Computer Aided Verification, (600-614)
- Rudolph S and Giesbrecht E Compositional matrix-space models of language Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, (907-916)
- Consens M, Miller R, Rizzolo F and Vaisman A (2010). Exploring XML web collections with DescribeX, ACM Transactions on the Web, 4:3, (1-46), Online publication date: 1-Jul-2010.
- Wolpert D Inference concerning physical systems Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe, (438-447)
- Crochemore M, Cygan M, Iliopoulos C, Kubica M, Radoszewski J, Rytter W and Waleń T Algorithms for three versions of the shortest common superstring problem Proceedings of the 21st annual conference on Combinatorial pattern matching, (299-309)
- AitMous O, Bassino F and Nicaud C Building the minimal automaton of A*X in linear time, when X is of bounded cardinality Proceedings of the 21st annual conference on Combinatorial pattern matching, (275-287)
- Brihaye T, Bruyère V and De Pril J Equilibria in quantitative reachability games Proceedings of the 5th international conference on Computer Science: theory and Applications, (72-83)
- Sgarbas K (2010). Automata theory with modern applications by James A. Anderson, Cambridge University Press, 2006, viii+256 pages, ACM SIGACT News, 41:2, (43-46), Online publication date: 9-Jun-2010.
- Nagy B An automata-theoretic characterization of the chomsky-hierarchy Proceedings of the 7th annual conference on Theory and Applications of Models of Computation, (361-372)
- Gelade W, Idziaszek T, Martens W and Neven F Simplifying XML schema Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (251-260)
- Maletti A Why synchronous tree substitution grammars? Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (876-884)
- Dyer C and Resnik P Context-free reordering, finite-state translation Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (858-866)
- Shugrina M Formatting time-aligned ASR transcripts for readability Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (198-206)
- Iliopoulos C, Rahman M, Voráček M and Vagner L (2010). Finite automata based algorithms on subsequences and supersequences of degenerate strings, Journal of Discrete Algorithms, 8:2, (117-130), Online publication date: 1-Jun-2010.
- Aravantinos V, Caferra R and Peltier N Complexity of the satisfiability problem for a class of propositional schemata Proceedings of the 4th international conference on Language and Automata Theory and Applications, (58-69)
- Hovland D The inclusion problem for regular expressions Proceedings of the 4th international conference on Language and Automata Theory and Applications, (309-320)
- Buszkowski W and Lin Z Pregroup grammars with letter promotions Proceedings of the 4th international conference on Language and Automata Theory and Applications, (130-141)
- Bousquet N and Löding C Equivalence and inclusion problem for strongly unambiguous büchi automata Proceedings of the 4th international conference on Language and Automata Theory and Applications, (118-129)
- Kupferman O and Vardi M Synthesis of trigger properties Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (312-331)
- Bozzelli L, Legay A and Pinchinat S Hardness of preorder checking for basic formalisms Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (119-135)
- Bassino F, Giambruno L and Nicaud C Complexity of operations on cofinite languages Proceedings of the 9th Latin American conference on Theoretical Informatics, (222-233)
- La Torre S, Madhusudan P and Parlato G The language theory of bounded context-switching Proceedings of the 9th Latin American conference on Theoretical Informatics, (96-107)
- Bex G, Neven F, Schwentick T and Vansummeren S (2010). Inference of concise regular expressions and DTDs, ACM Transactions on Database Systems, 35:2, (1-47), Online publication date: 1-Apr-2010.
- Tong J, Boulé M and Zilic Z (2010). Defining and Providing Coverage for Assertion-Based Dynamic Verification, Journal of Electronic Testing: Theory and Applications, 26:2, (211-225), Online publication date: 1-Apr-2010.
- Cong M, An H, Cao L, Liu Y, Li P, Wang T, Yu Z and Liu D Pattern-unit based regular expression matching with reconfigurable function unit Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV, (427-440)
- Namjoshi K and Narlikar G Robust and fast pattern matching for intrusion detection Proceedings of the 29th conference on Information communications, (740-748)
- Fu Y and Lu H (2010). On the expressiveness of interaction, Theoretical Computer Science, 411:11-13, (1387-1451), Online publication date: 1-Mar-2010.
- Allender E, Loui M and Regan K Reducibility and completeness Algorithms and theory of computation handbook, (23-23)
- Allender E, Loui M and Regan K Complexity classes Algorithms and theory of computation handbook, (22-22)
- Jiang T, Li M, Ravikumar B and Regan K Computability Algorithms and theory of computation handbook, (21-21)
- Jiang T, Li M, Ravikumar B and Regan K Formal grammars and languages Algorithms and theory of computation handbook, (20-20)
- Jiang T, Li M and Ravikumar B Basic notions in computational complexity Algorithms and theory of computation handbook, (19-19)
- Kaczor O, Guéhéneuc Y and Hamel S (2010). Identification of design motifs with pattern matching algorithms, Information and Software Technology, 52:2, (152-168), Online publication date: 1-Feb-2010.
- Hibbs E The new primer on prime numbers Proceedings of the 2010 American conference on Applied mathematics, (146-151)
- Sánchez C and Leucker M Regular linear temporal logic with past Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation, (295-311)
- Simmonds J, Ben-David S and Chechik M Monitoring and recovery of web service applications The smart internet, (250-288)
- Ebert J and Bildhauer D Reverse engineering using graph queries Graph transformations and model-driven engineering, (335-362)
- Simmonds J, Ben-David S and Chechik M Monitoring and recovery of web service applications The smart internet, (250-288)
- Geffert V, Pighizzini G and Mereghetti C (2010). One Pebble Versus ϵ · log n Bits, Fundamenta Informaticae, 104:1-2, (55-69), Online publication date: 1-Jan-2010.
- Dassow J and Turaev S (2010). Petri net controlled grammars with a bounded number of additional places, Acta Cybernetica, 19:3, (609-634), Online publication date: 1-Jan-2010.
- Nederhof M and Satta G Algorithmic aspects of natural language processing Algorithms and theory of computation handbook, (23-23)
- Maler O On the Krohn-Rhodes cascaded decomposition theorem Time for verification, (260-278)
- Genkin D, Francez N and Kaminski M Mildly context-sensitive languages via buffer augmented pregroup grammars Time for verification, (144-166)
- Lin L, Prowell S and Poore J (2010). An axiom system for sequence-based specification, Theoretical Computer Science, 411:2, (360-376), Online publication date: 1-Jan-2010.
- Kadioglu S and Sellmann M (2010). Grammar constraints, Constraints, 15:1, (117-144), Online publication date: 1-Jan-2010.
- GüleşIr G, Berg K, Bergmans L and Akşit M (2009). Experimental evaluation of a tool for the verification and transformation of source code in event-driven systems, Empirical Software Engineering, 14:6, (720-777), Online publication date: 1-Dec-2009.
- Schwier J, Brooks R, Griffin C and Bukkapatnam S (2009). Zero knowledge hidden Markov model inference, Pattern Recognition Letters, 30:14, (1273-1280), Online publication date: 30-Oct-2009.
- Becchi M, Wiseman C and Crowley P Evaluating regular expression matching engines on network and general purpose processors Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, (30-39)
- Case J and Kötzing T Difficulties in forcing fairness of polynomial time inductive inference Proceedings of the 20th international conference on Algorithmic learning theory, (263-277)
- Dębowski Ł Computable Bayesian compression for uniformly discretizable statistical models Proceedings of the 20th international conference on Algorithmic learning theory, (53-67)
- Vasiliadis G, Polychronakis M, Antonatos S, Markatos E and Ioannidis S Regular Expression Matching on Graphics Hardware for Intrusion Detection Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection, (265-283)
- Katsirelos G, Maneth S, Narodytska N and Walsh T Restricted global grammar constraints Proceedings of the 15th international conference on Principles and practice of constraint programming, (501-508)
- Vega J and Königsberg Z Modeling the game of Arimaa with linguistic geometry Proceedings of the 5th international conference on Computational Intelligence and Games, (379-386)
- Jantke K Dramaturgical design of the narrative in digital games Proceedings of the 5th international conference on Computational Intelligence and Games, (88-95)
- Frisco P Conformon p systems and topology of information flow Proceedings of the 10th international conference on Membrane Computing, (30-53)
- Carpentieri M On multivariate genetic systems Proceedings of the 18th international conference on Fuzzy Systems, (35-40)
- Aizikowitz T and Kaminski M Linear conjunctive grammars and one-turn synchronized alternating pushdown automata Proceedings of the 14th international conference on Formal grammar, (1-16)
- Bubenzer J and Würzner K Joining composition and trimming of finite-state transducers Proceedings of the 8th international conference on Finite-state methods and natural language processing, (93-104)
- Maletti A and Vogler H Compositions of top-down tree transducers with ε-rules Proceedings of the 8th international conference on Finite-state methods and natural language processing, (69-80)
- Eğecioğlu Ö and Ibarra O On Stateless Multicounter Machines Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice, (178-187)
- Mesfar S and Silberztein M Transducer Minimization and Information Compression for NooJ Dictionaries Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008, (110-121)
- Kasprzik A Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008, (98-109)
- Ibarra O and Eğecioğlu Ö Hierarchies and Characterizations of Stateless Multicounter Machines Proceedings of the 15th Annual International Conference on Computing and Combinatorics, (408-417)
- Goel A, Roychoudhury A and Thiagarajan P (2009). Interacting process classes, ACM Transactions on Software Engineering and Methodology, 18:4, (1-47), Online publication date: 1-Jul-2009.
- Mulder W and Jacobs C Grid management support by means of collaborative learning agents Proceedings of the 6th international conference industry session on Grids meets autonomic computing, (43-50)
- Chattopadhyay I and Ray A Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models Proceedings of the 2009 conference on American Control Conference, (2403-2408)
- Qiu D and Liu F (2009). Fuzzy discrete-event systems under fuzzy observability and a test algorithm, IEEE Transactions on Fuzzy Systems, 17:3, (578-589), Online publication date: 1-Jun-2009.
- Eberbach E and Burgin M Evolutionary automata as foundation of evolutionary computation Proceedings of the Eleventh conference on Congress on Evolutionary Computation, (2149-2156)
- Seow K A dynamic programming approach to multi-level supervision Proceedings of the 2009 IEEE international conference on Robotics and Automation, (87-92)
- Mahmud J, Borodin Y, Ramakrishnan I and Ramakrishnan C Automated construction of web accessibility models from transaction click-streams Proceedings of the 18th international conference on World wide web, (871-880)
- Lustig Y and Vardi M Synthesis from Component Libraries Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504, (395-409)
- Saadawi H and Wainer G Verification of real-time DEVS models Proceedings of the 2009 Spring Simulation Multiconference, (1-8)
- Bhateja P Grammar based asynchronous testing Proceedings of the 2nd India software engineering conference, (105-110)
- Jürgensen H and McQuillan I (2009). Homomorphisms preserving types of density, Acta Cybernetica, 19:2, (499-516), Online publication date: 1-Feb-2009.
- Grahne G, Thomo A and Wadge W (2008). Preferential Regular Path Queries, Fundamenta Informaticae, 89:2-3, (259-288), Online publication date: 15-Jan-2009.
- Smith R, Estan C, Jha S and Siahaan I Fast Signature Matching Using Extended Finite Automaton (XFA) Proceedings of the 4th International Conference on Information Systems Security, (158-172)
- Becchi M and Crowley P Extending finite automata to efficiently match Perl-compatible regular expressions Proceedings of the 2008 ACM CoNEXT Conference, (1-12)
- Wayner P (2008). Disappearing Cryptography, 10.5555/1523275, Online publication date: 3-Dec-2008.
- Hines P (2008). Machine semantics, Theoretical Computer Science, 409:1, (1-23), Online publication date: 1-Dec-2008.
- Ghelli G, Colazzo D and Sartiani C Linear time membership in a class of regular expressions with interleaving and counting Proceedings of the 17th ACM conference on Information and knowledge management, (389-398)
- Unold O (2008). Grammar-based classifier system, WSEAS Transactions on Computers, 7:10, (1584-1593), Online publication date: 1-Oct-2008.
- Denis F and Esposito Y (2008). On Rational Stochastic Languages, Fundamenta Informaticae, 86:1,2, (41-77), Online publication date: 1-Oct-2008.
- Torre S, Madhusudan P and Parlato G An Infinite Automaton Characterization of Double Exponential Time Proceedings of the 22nd international workshop on Computer Science Logic, (33-48)
- Hodkinson I, Montanari A and Sciavicco G Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T Proceedings of the 22nd international workshop on Computer Science Logic, (308-322)
- Engelfriet J, Lilin E and Maletti A Extended Multi Bottom-Up Tree Transducers Proceedings of the 12th international conference on Developments in Language Theory, (289-300)
- Bassino F, Giambruno L and Nicaud C The Average State Complexity of the Star of a Finite Set of Words Is Linear Proceedings of the 12th international conference on Developments in Language Theory, (134-145)
- Imada K and Nakamura K Towards machine learning of grammars and compilers of programming languages Proceedings of the 2008th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II, (98-112)
- Wocjan P, Janzing D and Decker T (2008). Measuring 4-local qubit observables could probabilistically solve PSPACE, Quantum Information & Computation, 8:8, (741-755), Online publication date: 1-Sep-2008.
- Uchida Y, Ito T, Okabe H, Sakamoto M, Furutani H and Kono M (2008). Four-dimensional multi-inkdot finite automata, WSEAS Transactions on Computers, 7:9, (1437-1446), Online publication date: 1-Sep-2008.
- Arvind V and Mukhopadhyay P Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, (276-289)
- Sakarovitch J and Souza R On the Decidability of Bounded Valuedness for Transducers Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science, (588-600)
- Gao Y, Salomaa K and Yu S (2008). The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal, Fundamenta Informaticae, 83:1-2, (75-89), Online publication date: 15-Aug-2008.
- Viide J, Helin A, Laakso M, Pietikäinen P, Seppänen M, Halunen K, Puuperä R and Röning J Experiences with model inference assisted fuzzing Proceedings of the 2nd conference on USENIX Workshop on offensive technologies, (1-6)
- Fujiyoshi A, Suzuki M and Uchida S Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics, (415-429)
- Sakamoto M, Tomozoe N, Furutani H, Kono M, Ito T, Uchida Y and Okabe H A survey of three-dimensional automata Proceedings of the 12th WSEAS international conference on Computers, (399-407)
- Kadioglu S and Sellmann M Efficient context-free grammar constraints Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (310-316)
- Gruber H and Holzer M Finite Automata, Digraph Connectivity, and Regular Expression Size Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (39-50)
- Axelsson R, Heljanko K and Lange M Analyzing Context-Free Grammars Using an Incremental SAT Solver Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (410-422)
- Brázdil T, Forejt V and Kučera A Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (148-159)
- Zinsmeister H Freshmen's CL curriculum Proceedings of the Third Workshop on Issues in Teaching Computational Linguistics, (19-26)
- He H and Singh A Graphs-at-a-time Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (405-418)
- Bedregal B (2007). Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages, Fundamenta Informaticae, 81:4, (367-377), Online publication date: 1-Jun-2008.
- Grahne G, Thomo A and Wadge W (2008). Preferential Regular Path Queries, Fundamenta Informaticae, 89:2-3, (259-288), Online publication date: 1-Apr-2008.
- Denis F and Esposito Y (2008). On Rational Stochastic Languages, Fundamenta Informaticae, 86:1,2, (41-77), Online publication date: 1-Apr-2008.
- Chatterjee K, Sen K and Henzinger T Model-checking ω-regular properties of interval Markov chains Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (302-317)
- Godoy G, Maneth S and Tison S Classes of tree homomorphisms with decidable preservation of regularity Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (127-141)
- La Torre S, Madhusudan P and Parlato G Context-bounded analysis of concurrent queue systems Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems, (299-314)
- Lal A, Touili T, Kidd N and Reps T Interprocedural analysis of concurrent programs under a context bound Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems, (282-298)
- Bakewell A and Ghica D On-the-fly techniques for game-based software model checking Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems, (78-92)
- Cunningham D, Gudka K and Eisenbach S Keep off the grass Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction, (276-290)
- Polycarpou I Induction as a tool for conceptual coherence in computer science Proceedings of the 46th annual ACM Southeast Conference, (440-445)
- Collignon B, Vanderdonckt J and Calvary G An intelligent editor for multi-presentation user interfaces Proceedings of the 2008 ACM symposium on Applied computing, (1634-1641)
- Chalopin J and Métivier Y (2007). An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm, Fundamenta Informaticae, 80:1-3, (221-246), Online publication date: 1-Mar-2008.
- Gaži P and Rovan B Assisted problem solving and decompositions of finite automata Proceedings of the 34th conference on Current trends in theory and practice of computer science, (292-303)
- Chaudhuri S (2008). Subcubic algorithms for recursive state machines, ACM SIGPLAN Notices, 43:1, (159-169), Online publication date: 14-Jan-2008.
- Chaudhuri S Subcubic algorithms for recursive state machines Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (159-169)
- Gao Y, Salomaa K and Yu S (2008). The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal, Fundamenta Informaticae, 83:1-2, (75-89), Online publication date: 1-Jan-2008.
- Vardi M From monadic logic to PSL Pillars of computer science, (656-681)
- Bradford P Quickest path distances on context-free labeled graphs Proceedings of the 6th WSEAS international conference on Information security and privacy, (22-29)
- Bedregal B (2007). Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages, Fundamenta Informaticae, 81:4, (367-377), Online publication date: 1-Dec-2007.
- Lin T and Giles C (2007). Group-Linking Method, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:12, (2916-2929), Online publication date: 1-Dec-2007.
- Araujo L (2007). How evolutionary algorithms are applied to statistical natural language processing, Artificial Intelligence Review, 28:4, (275-303), Online publication date: 1-Dec-2007.
- Campos M, López D and Peris P Incremental Multiple Sequence Alignment Progress in Pattern Recognition, Image Analysis and Applications, (604-613)
- Liou C and Cheng W Resolving Hidden Representations Neural Information Processing, (254-263)
- Mousavi A, Far B and Eberlein A An approach for generating state machine designs from scenarios Proceedings of the 11th IASTED International Conference on Software Engineering and Applications, (523-529)
- Curilem S, Barbosa A and de Azevedo F (2007). Intelligent tutoring systems, Computers & Education, 49:3, (545-561), Online publication date: 1-Nov-2007.
- Troncoso-Pastoriza J, Katzenbeisser S and Celik M Privacy preserving error resilient dna searching through oblivious automata Proceedings of the 14th ACM conference on Computer and communications security, (519-528)
- Gan Y, Chechik M, Nejati S, Bennett J, O'Farrell B and Waterhouse J Runtime monitoring of web service conversations Proceedings of the 2007 conference of the center for advanced studies on Collaborative research, (42-57)
- Hammerschmidt B, Werner C, Brandt Y, Linnemann V, Groppe S and Fischer S Incremental validation of string-based XML data in databases, file systems, and streams Proceedings of the 11th East European conference on Advances in databases and information systems, (314-329)
- Loukanova R Linear context free languages Proceedings of the 4th international conference on Theoretical aspects of computing, (351-365)
- Leucker M and Sánchez C Regular linear temporal logic Proceedings of the 4th international conference on Theoretical aspects of computing, (291-305)
- Acharya M, Xie T, Pei J and Xu J Mining API patterns as partial orders from source code Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, (25-34)
- Aminof B, Murano A and Vardi M Pushdown module checking with imperfect information Proceedings of the 18th international conference on Concurrency Theory, (460-475)
- Wang B Automatic derivation of compositional rules in automated compositional reasoning Proceedings of the 18th international conference on Concurrency Theory, (303-316)
- Natchetoi Y, Wu H and Babin G A context-dependent XML compression approach to enable business applications on mobile devices Proceedings of the 13th international Euro-Par conference on Parallel Processing, (911-920)
- Bhateja P, Gastin P, Mukund M and Kumar K Local testing of message sequence charts is difficult Proceedings of the 16th international conference on Fundamentals of Computation Theory, (76-87)
- Freund R, Păun G and Pérez-Jiménez M Polarizationless P systems with active membranes working in the minimally parallel mode Proceedings of the 6th international conference on Unconventional Computation, (62-76)
- Sunckel B (2007). On Metalinear CD Grammar Systems, Fundamenta Informaticae, 76:3, (383-397), Online publication date: 1-Aug-2007.
- Corazza A and Satta G (2007). Probabilistic Context-Free Grammars Estimated from Infinite Distributions, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:8, (1379-1393), Online publication date: 1-Aug-2007.
- Hromkovi J and Schnitger G (2007). Comparing the size of NFAs with and without ε-transitions, Theoretical Computer Science, 380:1-2, (100-114), Online publication date: 20-Jul-2007.
- Brabrand C, Giegerich R and Møller A Analyzing ambiguity of context-free grammars Proceedings of the 12th international conference on Implementation and application of automata, (214-225)
- Mráz F, Plátek M and Otto F A measure for the degree of nondeterminism of context-free languages Proceedings of the 12th international conference on Implementation and application of automata, (192-202)
- Carrasco R, Daciuk J and Forcada M An implementation of deterministic tree automata minimization Proceedings of the 12th international conference on Implementation and application of automata, (122-129)
- Salomaa K, Yu S and Zan J Deterministic caterpillar expressions Proceedings of the 12th international conference on Implementation and application of automata, (97-108)
- Kutrib M, Malcher A and Werlein L Regulated nondeterminism in pushdown automata Proceedings of the 12th international conference on Implementation and application of automata, (85-96)
- Garibay O and Wu A Analyzing the effects of module encapsulation on search space bias Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1234-1241)
- Shayani H and Bentley P A more bio-plausible approach to the evolutionary inference of finite state machines Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, (2937-2944)
- Sinha N and Clarke E SAT-based compositional verification using lazy learning Proceedings of the 19th international conference on Computer aided verification, (39-54)
- Li Y and Pedrycz W (2007). Minimization of lattice finite automata and its application to the decomposition of lattice languages, Fuzzy Sets and Systems, 158:13, (1423-1436), Online publication date: 1-Jul-2007.
- Park S (2007). The election problem in asynchronous distributed systems with bounded faulty processes, The Journal of Supercomputing, 41:1, (89-104), Online publication date: 1-Jul-2007.
- Singhoff F and Plantec A Towards user-level extensibility of an Ada library Proceedings of the 12th international conference on Reliable software technologies, (180-191)
- Van Hee K, Serebrenik A, Sidorova N and Van Der Aalst W History-dependent Petri nets Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency, (164-183)
- Case J Resource Restricted Computability Theoretic Learning Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (115-124)
- Harel D Statecharts in the making Proceedings of the third ACM SIGPLAN conference on History of programming languages, (5-1-5-43)
- Nagy B On 5' → 3' sensing Watson-Crick finite automata Proceedings of the 13th international conference on DNA computing, (256-262)
- Bernasconi A, Bodei C and Pagli L Knitting for fun Proceedings of the 4th international conference on Fun with algorithms, (53-65)
- Ferrarotti F and Turull Torres J (2007). Arity and alternation, Annals of Mathematics and Artificial Intelligence, 50:1-2, (111-141), Online publication date: 1-Jun-2007.
- Pivato M (2007). Defect particle kinematics in one-dimensional cellular automata, Theoretical Computer Science, 377:1-3, (205-228), Online publication date: 25-May-2007.
- Zaraket F, Aziz A and Khurshid S Sequential Circuits for Relational Analysis Proceedings of the 29th international conference on Software Engineering, (13-22)
- Kumar V, Madhusudan P and Viswanathan M Visibly pushdown automata for streaming XML Proceedings of the 16th international conference on World Wide Web, (1053-1062)
- Motahari Nezhad H, Benatallah B, Martens A, Curbera F and Casati F Semi-automated adaptation of service interactions Proceedings of the 16th international conference on World Wide Web, (993-1002)
- Pourvatan B and Rouhy N An alternative algorithm for constraint automata product Proceedings of the 2007 international conference on Fundamentals of software engineering, (412-422)
- Serrano J and Ossowski S (2007). A compositional framework for the specification of interaction protocols in multiagent organizations, Web Intelligence and Agent Systems, 5:2, (197-214), Online publication date: 1-Apr-2007.
- Raghavachari M and Shmueli O (2007). Efficient Revalidation of XML Documents, IEEE Transactions on Knowledge and Data Engineering, 19:4, (554-567), Online publication date: 1-Apr-2007.
- Hemaspaandra E, Hemaspaandra L and Rothe J (2007). Anyone but him, Artificial Intelligence, 171:5-6, (255-285), Online publication date: 1-Apr-2007.
- Roşu G An effective algorithm for the membership problem for extended regular expressions Proceedings of the 10th international conference on Foundations of software science and computational structures, (332-345)
- Sunckel B (2007). On Metalinear CD Grammar Systems, Fundamenta Informaticae, 76:3, (383-397), Online publication date: 1-Mar-2007.
- Calvanese D, De Giacomo G, Lenzerini M and Vardi M (2007). View-based query processing, Theoretical Computer Science, 371:3, (169-182), Online publication date: 25-Feb-2007.
- Otero J, Graña J and Vilares M Contextual spelling correction Proceedings of the 11th international conference on Computer aided systems theory, (290-296)
- KešElj V and Cercone N (2007). A formal approach to subgrammar extraction for NLP, Mathematical and Computer Modelling: An International Journal, 45:3-4, (394-403), Online publication date: 1-Feb-2007.
- Chalopin J and Métivier Y (2007). An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm, Fundamenta Informaticae, 80:1-3, (221-246), Online publication date: 1-Jan-2007.
- Lamperti G, Zanella M and Zanni D (2007). Incremental processing of temporal observations in Model-Based Reasoning, AI Communications, 20:1, (27-37), Online publication date: 1-Jan-2007.
- Drinić M, Kirovski D and Vo H (2007). PPMexe, ACM Transactions on Programming Languages and Systems, 29:1, (3-es), Online publication date: 1-Jan-2007.
- Kumar S, Turner J and Williams J Advanced algorithms for fast and scalable deep packet inspection Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems, (81-92)
- Kari L, Losseva E, Konstantinidis S, Sosík P and Thierrin G (2006). A Formal Language Analysis of DNA Hairpin Structures, Fundamenta Informaticae, 71:4, (453-475), Online publication date: 1-Dec-2006.
- Szwast W (2006). On the generator problem, Mathematical Logic Quarterly, 36:1, (23-27), Online publication date: 28-Nov-2006.
- Cesati M and Dilanni M (2006). Computation Models for Parameterized Complexity, Mathematical Logic Quarterly, 43:2, (179-202), Online publication date: 13-Nov-2006.
- Kandulski M (2006). On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars, Mathematical Logic Quarterly, 41:2, (217-235), Online publication date: 13-Nov-2006.
- Case J (2006). Effectivizing Inseparability, Mathematical Logic Quarterly, 37:7, (97-111), Online publication date: 13-Nov-2006.
- Damas C, Lambeau B and van Lamsweerde A Scenarios, goals, and state machines Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, (197-207)
- Mason J, Watkins K, Eisner J and Stubblefield A A natural language approach to automated cryptanalysis of two-time pads Proceedings of the 13th ACM conference on Computer and communications security, (235-244)
- Rubin S, Jha S and Miller B Protomatching network traffic for high throughputnetwork intrusion detection Proceedings of the 13th ACM conference on Computer and communications security, (47-58)
- Chen S, Zhang Y and Trappe W 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, (1-12)
- Tamm H, Nykänen M and Ukkonen E (2006). On size reduction techniques for multitape automata, Theoretical Computer Science, 363:2, (234-246), Online publication date: 28-Oct-2006.
- Cavaliere M and Sedwards S Modelling cellular processes using membrane systems with peripheral and integral proteins Proceedings of the 2006 international conference on Computational Methods in Systems Biology, (108-126)
- Thurston A and Cordy J A backtracking LR algorithm for parsing ambiguous context-dependent languages Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research, (4-es)
- Picantin M (2006). Finite transducers for divisibility monoids, Theoretical Computer Science, 362:1, (207-221), Online publication date: 11-Oct-2006.
- Neary T and Woods D (2006). Small fast universal turing machines, Theoretical Computer Science, 362:1, (171-195), Online publication date: 11-Oct-2006.
- Domaratzki M, Rozenberg G and Salomaa K (2006). Interpreted Trajectories, Fundamenta Informaticae, 73:1,2, (81-97), Online publication date: 1-Oct-2006.
- Zhang T, Sipma H and Manna Z (2006). Decision procedures for term algebras with integer constraints, Information and Computation, 204:10, (1526-1574), Online publication date: 1-Oct-2006.
- Wang S, Wang S, Cheng L, Greiner R and Schuurmans D Stochastic analysis of lexical and semantic enhanced structural language model Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (97-111)
- Nakamura K Incremental learning of context free grammars by bridging rule generation and search for semi-optimum rule sets Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (72-83)
- Alvarez G, García P and Ruiz J A merging states algorithm for inference of RFSAs Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (340-341)
- Peris P, López D, Campos M and Sempere J Protein motif prediction by grammatical inference Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (175-187)
- Drewes F, Hoffmann B, Janssens D, Minas M and Van Eetvelde N Adaptive star grammars Proceedings of the Third international conference on Graph Transformations, (77-91)
- Burgstaller B, Scholz B and Blieberger J Symbolic analysis of imperative programming languages Proceedings of the 7th joint conference on Modular Programming Languages, (172-194)
- Kumar S, Dharmapurikar S, Yu F, Crowley P and Turner J Algorithms to accelerate multiple regular expressions matching for deep packet inspection Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, (339-350)
- Loos R, Martín-Vide C and Mitrana V Solving SAT and HPP with Accepting Splicing Systems Parallel Problem Solving from Nature - PPSN IX, (771-777)
- Balan M and Jürgensen H Peptide computing Proceedings of the 5th international conference on Unconventional Computation, (57-71)
- Kari L, Losseva E, Konstantinidis S, Sosík P and Thierrin G (2006). A Formal Language Analysis of DNA Hairpin Structures, Fundamenta Informaticae, 71:4, (453-475), Online publication date: 1-Sep-2006.
- Bex G, Neven F, Schwentick T and Tuyls K Inference of concise DTDs from XML data Proceedings of the 32nd international conference on Very large data bases, (115-126)
- Martens W, Neven F, Schwentick T and Bex G (2006). Expressiveness and complexity of XML Schema, ACM Transactions on Database Systems, 31:3, (770-813), Online publication date: 1-Sep-2006.
- Ritchie G (2006). The transformational creativity hypothesis, New Generation Computing, 24:3, (241-266), Online publication date: 1-Sep-2006.
- Hosoya H and Murata M (2006). Boolean operations and inclusion test for attribute-element constraints, Theoretical Computer Science, 360:1, (327-351), Online publication date: 21-Aug-2006.
- Demri S (2006). LTL Over integer periodicity constraints, Theoretical Computer Science, 360:1, (96-123), Online publication date: 21-Aug-2006.
- Yu S On the state complexity of combined operations Proceedings of the 11th international conference on Implementation and Application of Automata, (11-22)
- Messerschmidt H, Mráz F, Otto F and Plátek M Correctness preservation and complexity of simple RL-automata Proceedings of the 11th international conference on Implementation and Application of Automata, (162-172)
- Baclet M and Pagetti C Around hopcroft’s algorithm Proceedings of the 11th international conference on Implementation and Application of Automata, (114-125)
- Alur R, Chaudhuri S and Madhusudan P Languages of nested trees Proceedings of the 18th international conference on Computer Aided Verification, (329-342)
- Armoni R, Korchemny D, Tiemeyer A, Vardi M and Zbar Y Deterministic dynamic monitors for linear-time assertions Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification, (163-177)
- McTague C and Crutchfield J (2006). Automated pattern detection, Theoretical Computer Science, 359:1, (306-328), Online publication date: 14-Aug-2006.
- Hendrix J, Ohsaki H and Viswanathan M Propositional tree automata Proceedings of the 17th international conference on Term Rewriting and Applications, (50-65)
- Kumar S, Dharmapurikar S, Yu F, Crowley P and Turner J (2006). Algorithms to accelerate multiple regular expressions matching for deep packet inspection, ACM SIGCOMM Computer Communication Review, 36:4, (339-350), Online publication date: 11-Aug-2006.
- Buszkowski W On the complexity of the equational theory of relational action algebras Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra, (106-119)
- Loos R (2006). An alternative definition of splicing, Theoretical Computer Science, 358:1, (75-87), Online publication date: 31-Jul-2006.
- Li L and Qiu D (2006). Determination of equivalence between quantum sequential machines, Theoretical Computer Science, 358:1, (65-74), Online publication date: 31-Jul-2006.
- Frisco P Infinite hierarchies of conformon-p systems Proceedings of the 7th international conference on Membrane Computing, (395-408)
- Chiang D The weak generative capacity of linear tree-adjoining grammars Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, (25-32)
- Nagy B Left-most derivation and shadow-pushdown automata for context-sensitive languages Proceedings of the 10th WSEAS international conference on Computers, (1015-1020)
- Karhumäki J, Kunc M and Okhotin A Communication of two stacks and rewriting Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (468-479)
- Neary T and Woods D P-completeness of cellular automaton rule 110 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I, (132-143)
- Felfernig A Diagnosing faulty transitions in recommender user interface descriptions Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems, (869-878)
- Ravikumar B On some variations of two-way probabilistic finite automata models Proceedings of the 10th international conference on Developments in Language Theory, (443-454)
- Santean N and Yu S On weakly ambiguous finite transducers Proceedings of the 10th international conference on Developments in Language Theory, (156-167)
- Han Y, Salomaa K and Wood D Prime decompositions of regular languages Proceedings of the 10th international conference on Developments in Language Theory, (145-155)
- Kutrib M and Malcher A Context-Dependent nondeterminism for pushdown automata Proceedings of the 10th international conference on Developments in Language Theory, (133-144)
- Brodie B, Taylor D and Cytron R A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching Proceedings of the 33rd annual international symposium on Computer Architecture, (191-202)
- Messerschmidt H and Otto F On nonforgetting restarting automata that are deterministic and/or monotone Proceedings of the First international computer science conference on Theory and Applications, (247-258)
- Bonet B Bounded branching and modalities in non-deterministic planning Proceedings of the Sixteenth International Conference on International Conference on Automated Planning and Scheduling, (42-51)
- Ishdorj T Minimal parallelism for polarizationless p systems Proceedings of the 12th international conference on DNA Computing, (17-32)
- Jones R and Wray R (2006). Comparative Analysis of Frameworks for Knowledge‐Intensive Intelligent Agents, AI Magazine, 27:2, (57-70), Online publication date: 1-Jun-2006.
- Park S Solving election problem in asynchronous distributed systems Proceedings of the 6th international conference on Computational Science - Volume Part I, (736-743)
- Solanki M, Cau A and Zedan H ASDL Proceedings of the 15th international conference on World Wide Web, (687-696)
- El-Fakih K, Petrenko A and Yevtushenko N FSM test translation through context Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems, (245-258)
- Park S The election problem in asynchronous distributed systems with bounded faulty processes Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V, (68-77)
- Kang H, Kim K, Hong S and Lee D A model for security vulnerability pattern Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III, (385-394)
- D'Alessandro F, Intrigila B and Varricchio S (2006). On the structure of the counting function of sparse context-free languages, Theoretical Computer Science, 356:1, (104-117), Online publication date: 5-May-2006.
- Ibarra O and Ravikumar B (2006). On partially blind multihead finite automata, Theoretical Computer Science, 356:1, (190-199), Online publication date: 5-May-2006.
- Touati S and Barthou D On the decidability of phase ordering problem in optimizing compilation Proceedings of the 3rd conference on Computing frontiers, (147-156)
- Brodie B, Taylor D and Cytron R (2006). A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching, ACM SIGARCH Computer Architecture News, 34:2, (191-202), Online publication date: 1-May-2006.
- Domaratzki M, Rozenberg G and Salomaa K (2006). Interpreted Trajectories, Fundamenta Informaticae, 73:1,2, (81-97), Online publication date: 1-Apr-2006.
- Armoni M and Gal-Ezer J (2006). Reduction -- an abstract thinking pattern, ACM SIGCSE Bulletin, 38:1, (389-393), Online publication date: 31-Mar-2006.
- Agrawal M, Stephan F, Thiagarajan P and Yang S Behavioural approximations for restricted linear differential hybrid automata Proceedings of the 9th international conference on Hybrid Systems: computation and control, (4-18)
- Emmi M and Majumdar R Decision problems for the verification of real-time software Proceedings of the 9th international conference on Hybrid Systems: computation and control, (200-211)
- Stefanescu D and Thomo A Enhanced regular path queries on semistructured databases Proceedings of the 2006 international conference on Current Trends in Database Technology, (700-711)
- Deshmukh J, Emerson E and Gupta P Automatic verification of parameterized data structures Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (27-41)
- Garay J and Huelsbergen L Software integrity protection using timed executable agents Proceedings of the 2006 ACM Symposium on Information, computer and communications security, (189-200)
- Klein J, Hélouët L and Jézéquel J Semantic-based weaving of scenarios Proceedings of the 5th international conference on Aspect-oriented software development, (27-38)
- Bedregal B and Figueira S Classical computability and fuzzy turing machines Proceedings of the 7th Latin American conference on Theoretical Informatics, (154-165)
- Polycarpou I Computer science students' difficulties with proofs by induction Proceedings of the 44th annual ACM Southeast Conference, (601-606)
- Smith G Inductive bases and their application to searches for minimal unary NFAs Proceedings of the 44th annual ACM Southeast Conference, (470-475)
- Balarin F and Passerone R Functional verification methodology based on formal interface specification and transactor generation Proceedings of the conference on Design, automation and test in Europe: Proceedings, (1013-1018)
- Armoni M and Gal-Ezer J Reduction -- an abstract thinking pattern Proceedings of the 37th SIGCSE technical symposium on Computer science education, (389-393)
- Liskovets V (2006). Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, 154:3, (537-551), Online publication date: 1-Mar-2006.
- Bonizzoni P, De Felice C, Mauri G and Zizza R (2006). Linear splicing and syntactic monoid, Discrete Applied Mathematics, 154:3, (452-470), Online publication date: 1-Mar-2006.
- Abiteboul S, Segoufin L and Vianu V (2006). Representing and querying XML with incomplete information, ACM Transactions on Database Systems, 31:1, (208-254), Online publication date: 1-Mar-2006.
- Li Y (2006). A categorical approach to lattice-valued fuzzy automata, Fuzzy Sets and Systems, 157:6, (855-864), Online publication date: 1-Mar-2006.
- Ciobanu G, Păun G and Ştefănescu G (2006). P transducers, New Generation Computing, 24:1, (1-28), Online publication date: 1-Mar-2006.
- Kumar G and Murthy K UCSG shallow parser Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing, (156-167)
- Ferrarotti F and Torres J Arity and alternation Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems, (92-115)
- Felfernig A and Shchekotykhin K Debugging user interface descriptions of knowledge-based recommender applications Proceedings of the 11th international conference on Intelligent user interfaces, (234-241)
- Rosenberg A State Theoretical Computer Science, (375-398)
- Even G On teaching fast adder designs Theoretical Computer Science, (313-347)
- Kersting K, De Raedt L and Raiko T (2006). Logical hidden Markov models, Journal of Artificial Intelligence Research, 25:1, (425-456), Online publication date: 1-Jan-2006.
- Wang G and Zhang W Build a dictionary, learn a grammar, decipher stegoscripts, and discover genomic regulatory elements Proceedings of the 2005 joint annual satellite conference on Systems biology and regulatory genomics, (80-94)
- Damas C, Lambeau B, Dupont P and van Lamsweerde A (2005). Generating Annotated Behavior Models from End-User Scenarios, IEEE Transactions on Software Engineering, 31:12, (1056-1073), Online publication date: 1-Dec-2005.
- Mouza C and Rigaux P (2005). Mobility Patterns, Geoinformatica, 9:4, (297-319), Online publication date: 1-Dec-2005.
- Asveld P (2005). Fuzzy context-free languages, Theoretical Computer Science, 347:1-2, (191-213), Online publication date: 30-Nov-2005.
- Asveld P (2005). Fuzzy context-free languages, Theoretical Computer Science, 347:1-2, (167-190), Online publication date: 30-Nov-2005.
- Wich K (2005). Sublogarithmic ambiguity, Theoretical Computer Science, 345:2-3, (473-504), Online publication date: 22-Nov-2005.
- Hemaspaandra E, Hemaspaandra L and Hempel H (2005). All superlinear inverse schemes are coNP-hard, Theoretical Computer Science, 345:2-3, (345-358), Online publication date: 22-Nov-2005.
- Ying M (2005). A theory of computation based on quantum logic (I), Theoretical Computer Science, 344:2-3, (134-207), Online publication date: 17-Nov-2005.
- Verlan S (2005). A boundary result on enhanced time-varying distributed H systems with parallel computations, Theoretical Computer Science, 344:2-3, (226-242), Online publication date: 17-Nov-2005.
- García P, Ruiz J, Cano A and Alvarez G Inference improvement by enlarging the training set while learning DFAs Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications, (59-70)
- Ben-David S, Fisman D and Ruah S The safety simple subset Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing, (14-29)
- Inverardi P, Mostarda L, Tivoli M and Autili M Synthesis of correct and distributed adaptors for component-based systems Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, (405-409)
- Goldstine J, Leung H and Wotschke D (2005). Measuring nondeterminism in pushdown automata, Journal of Computer and System Sciences, 71:4, (440-466), Online publication date: 1-Nov-2005.
- Cai J and Zhu H (2005). Progress in computational complexity theory, Journal of Computer Science and Technology, 20:6, (735-750), Online publication date: 1-Nov-2005.
- Bauk S Revisiting the election problem in asynchronous distributed systems Proceedings of the 6th international conference on Advanced Parallel Processing Technologies, (141-150)
- Ng Y, Ono H and Shinohara T Measuring over-generalization in the minimal multiple generalizations of biosequences Proceedings of the 8th international conference on Discovery Science, (176-188)
- Bustan D, Flaisher A, Grumberg O, Kupferman O and Vardi M Regular vacuity Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (191-206)
- Sánchez C, Slanina M, Sipma H and Manna Z Expressive completeness of an event-pattern reactive programming language Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (529-532)
- Berger S, Coquery E, Drabent W and Wilk A Descriptive typing rules for
xcerpt Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning, (85-100) - Ochoa C, Puebla G and Hermenegildo M Removing superfluous versions in polyvariant specialization of prolog programs Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation, (80-97)
- Inoue A, Ito A, Inoue K and Okazaki T (2005). Some properties of one-pebble turing machines with sublogarithmic space, Theoretical Computer Science, 341:1, (138-149), Online publication date: 5-Sep-2005.
- Sasahara K and Ikegami T Evolution of song communication in a 2d space Proceedings of the 8th European conference on Advances in Artificial Life, (835-844)
- Wermelinger M and Dias A (2005). A prolog toolkit for formal languages and automata, ACM SIGCSE Bulletin, 37:3, (330-334), Online publication date: 1-Sep-2005.
- Nakamura K and Matsumoto M (2005). Incremental learning of context free grammars based on bottom-up parsing and search, Pattern Recognition, 38:9, (1384-1392), Online publication date: 1-Sep-2005.
- Bhadra J, Martin A and Abraham J (2005). A formal framework for verification of embedded custom memories of the Motorola MPC7450 microprocessor, Formal Methods in System Design, 27:1-2, (67-112), Online publication date: 1-Sep-2005.
- García E, Correcher A, Morant F, Quiles E and Blasco R (2005). Modular Fault Diagnosis Based on Discrete Event Systems, Discrete Event Dynamic Systems, 15:3, (237-256), Online publication date: 1-Sep-2005.
- Baldoni M, Baroglio C, Martelli A, Patti V and Schifanella C Verifying the conformance of web services to global interaction protocols Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes, (257-271)
- Cristau J, Löding C and Thomas W Deterministic automata on unranked trees Proceedings of the 15th international conference on Fundamentals of Computation Theory, (68-79)
- Holzer M and Otto F Shrinking multi-pushdown automata Proceedings of the 15th international conference on Fundamentals of Computation Theory, (305-316)
- Iwamoto C, Nakashiba Y, Morita K and Imai K Translational lemmas for alternating TMs and PRAMs Proceedings of the 15th international conference on Fundamentals of Computation Theory, (137-148)
- Hemaspaandra L and Thakur M Query-Monotonic Turing Reductions Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (895-904)
- Eisner C, Fisman D and Havlicek J A topological characterization of weakness Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, (1-8)
- Alur R, Kumar V, Madhusudan P and Viswanathan M Congruences for visibly pushdown languages Proceedings of the 32nd international conference on Automata, Languages and Programming, (1102-1114)
- Abdulla P, Deneux J, Ouaknine J and Worrell J Decidability and complexity results for timed automata via channel machines Proceedings of the 32nd international conference on Automata, Languages and Programming, (1089-1101)
- Murawski A, Ong C and Walukiewicz I Idealized algol with ground recursion, and DPDA equivalence Proceedings of the 32nd international conference on Automata, Languages and Programming, (917-929)
- Hemaspaandra E, Hemaspaandra L and Rothe J Anyone but him Proceedings of the 20th national conference on Artificial intelligence - Volume 1, (95-101)
- Jurdziński T, Mráz F, Otto F and Plátek M Monotone deterministic RL-Automata don't need auxiliary symbols Proceedings of the 9th international conference on Developments in Language Theory, (284-295)
- Geffert V, Mereghetti C and Pighizzini G Complementing two-way finite automata Proceedings of the 9th international conference on Developments in Language Theory, (260-271)
- Boyland J (2005). Remote attribute grammars, Journal of the ACM, 52:4, (627-687), Online publication date: 1-Jul-2005.
- Verdu-Mas J, Carrasco R and Calera-Rubio J (2005). Parsing with Probabilistic Strictly Locally Testable Tree Languages, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:7, (1040-1050), Online publication date: 1-Jul-2005.
- Sakakibara Y (2005). Grammatical Inference in Bioinformatics, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:7, (1051-1062), Online publication date: 1-Jul-2005.
- MacWhinney B Item-based constructions and the logical problem Proceedings of the Workshop on Psychocomputational Models of Human Language Acquisition, (53-68)
- Wermelinger M and Dias A A prolog toolkit for formal languages and automata Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education, (330-334)
- Anselmo M, Giammarresi D and Madonia M (2005). New operations and regular expressions for two-dimensional languages over one-letter alphabet, Theoretical Computer Science, 340:2, (408-431), Online publication date: 27-Jun-2005.
- Baldoni M, Baroglio C, Martelli A and Patti V Verification of protocol conformance and agent interoperability Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems, (265-283)
- Câmpeanu C, Păun A and Smith J An incremental algorithm for constructing minimal deterministic finite cover automata Proceedings of the 10th international conference on Implementation and Application of Automata, (90-103)
- Žd'árek J and Melichar B On two-dimensional pattern matching by finite automata Proceedings of the 10th international conference on Implementation and Application of Automata, (329-340)
- Tamm H, Nykänen M and Ukkonen E Size reduction of multitape automata Proceedings of the 10th international conference on Implementation and Application of Automata, (307-318)
- Fujiyoshi A and Kawaharada I Deterministic recognition of trees accepted by a linear pushdown tree automaton Proceedings of the 10th international conference on Implementation and Application of Automata, (129-140)
- Carlucci L, Jain S, Kinber E and Stephan F Variations on u-shaped learning Proceedings of the 18th annual conference on Learning Theory, (382-397)
- Sanders R, Bræk R, von Bochmann G and Amyot D Service discovery and component reuse with semantic interfaces Proceedings of the 12th international conference on Model Driven, (85-102)
- Arslan A Regular expression constrained sequence alignment Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (322-333)
- Ilie L, Solis-Oba R and Yu S Reducing the size of NFAs by using equivalences and preorders Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (310-321)
- Unold O Playing a toy-grammar with GCS Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II, (300-309)
- Abiteboul S, Milo T and Benjelloun O Regular rewriting of active XML and unambiguity Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (295-303)
- Benedikt M, Fan W and Geerts F XPath satisfiability in the presence of DTDs Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (25-36)
- Elder M (2005). A context-free and a 1-counter geodesic language for a Baumslag-Solitar group, Theoretical Computer Science, 339:2, (344-371), Online publication date: 12-Jun-2005.
- Murawski A (2005). Functions with local state, Theoretical Computer Science, 338:1-3, (315-349), Online publication date: 10-Jun-2005.
- Costagliola G, Ferrucci F and Gravino C (2005). Adding symbolic information to picture models, Theoretical Computer Science, 337:1-3, (51-104), Online publication date: 9-Jun-2005.
- Moriya E, Hofbauer D, Huber M and Otto F (2005). On state-alternating context-free grammars, Theoretical Computer Science, 337:1-3, (183-216), Online publication date: 9-Jun-2005.
- McQuillan I (2005). The generative capacity of block-synchronized context-free grammars, Theoretical Computer Science, 337:1-3, (119-133), Online publication date: 9-Jun-2005.
- Karhumäki J, Plandowski W and Rytter W (2005). On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science, 337:1-3, (105-118), Online publication date: 9-Jun-2005.
- Bompadre A and Orlin J Using grammars to generate very large scale neighborhoods for the traveling salesman problem and other sequencing problems Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization, (437-451)
- Finkel O Borel ranks and wadge degrees of context free ω-languages Proceedings of the First international conference on Computability in Europe: new Computational Paradigms, (129-138)
- Ibarra O and Păun A Counting time in computing with cells Proceedings of the 11th international conference on DNA Computing, (112-128)
- Jacobsson H (2005). Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review, Neural Computation, 17:6, (1223-1263), Online publication date: 1-Jun-2005.
- Kersting K An Inductive Logic Programming Approach to Statistical Relational Learning Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning, (1-228)
- Toman D and Weddell G (2005). On reasoning about structural equality in XML, Theoretical Computer Science, 336:1, (181-203), Online publication date: 25-May-2005.
- Deutsch A and Tannen V (2005). XML Queries and constraints, containment and reformulation, Theoretical Computer Science, 336:1, (57-87), Online publication date: 25-May-2005.
- Calvanese D, De Giacomo G and Vardi M (2005). Decidable containment of recursive queries, Theoretical Computer Science, 336:1, (33-56), Online publication date: 25-May-2005.
- Rigau J, Feixas M and Sbert M An information-theoretic framework for image complexity Proceedings of the First Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging, (177-184)
- Buhler J, Keich U and Sun Y (2005). Designing seeds for similarity search in genomic DNA, Journal of Computer and System Sciences, 70:3, (342-363), Online publication date: 1-May-2005.
- Karvi T, Tienari M and Kaivola R (2005). Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics, Formal Methods in System Design, 26:3, (293-317), Online publication date: 1-May-2005.
- Ljunglöf P A polynomial time extension of parallel multiple context-free grammar Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics, (177-188)
- Leuschel M and Turner E Visualising larger state spaces in ProB Proceedings of the 4th international conference on Formal Specification and Development in Z and B, (6-23)
- O'Connell T and Stearns R (2005). Mechanism design for software agents with complete information, Decision Support Systems, 39:2, (197-217), Online publication date: 1-Apr-2005.
- Francel M and John D Constructing an even grammar from a 2-element sample Proceedings of the 43rd annual ACM Southeast Conference - Volume 1, (69-74)
- Gruner S and Naven S Tool support for plagiarism detection in text documents Proceedings of the 2005 ACM symposium on Applied computing, (776-781)
- Stefanescu D, Thomo A and Thomo L Distributed evaluation of generalized path queries Proceedings of the 2005 ACM symposium on Applied computing, (610-616)
- Reynal M (2005). A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, 36:1, (53-70), Online publication date: 1-Mar-2005.
- Brandenburg F and Skodinis K (2005). Finite graph automata for linear and boundary graph languages, Theoretical Computer Science, 332:1-3, (199-232), Online publication date: 28-Feb-2005.
- Jeandel E Topological automata Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (389-398)
- Wolff K and Yameogo W Turing machine representation in temporal concept analysis Proceedings of the Third international conference on Formal Concept Analysis, (360-374)
- Knight K and Graehl J An overview of probabilistic tree transducers for natural language processing Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing, (1-24)
- Roggia K, Hoff M and Menezes P Computation of partial automata through span composition Proceedings of the 10th international conference on Computer Aided Systems Theory, (15-20)
- Malcher A (2005). On two-way communication in cellular automata with a fixed number of cells, Theoretical Computer Science, 330:2, (325-338), Online publication date: 2-Feb-2005.
- Kutrib M (2005). On the descriptional power of heads, counters, and pebbles, Theoretical Computer Science, 330:2, (311-324), Online publication date: 2-Feb-2005.
- Kappes M and Nießner F (2005). Succinct representations of languages by DFA with different levels of reliability, Theoretical Computer Science, 330:2, (299-310), Online publication date: 2-Feb-2005.
- Niemann G and Otto F (2005). The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages, Information and Computation, 197:1-2, (1-21), Online publication date: 1-Feb-2005.
- Flesca S and Greco S (2005). Partially ordered regular languages for graph queries, Journal of Computer and System Sciences, 70:1, (1-25), Online publication date: 1-Feb-2005.
- Kumar N, Kumar V and Viswanathan M On the complexity of error explanation Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation, (448-464)
- Calvanese D, De Giacomo G, Lenzerini M and Vardi M View-based query processing Proceedings of the 10th international conference on Database Theory, (321-336)
- Nash A, Remmel J and Vianu V PTIME queries revisited Proceedings of the 10th international conference on Database Theory, (274-288)
- Kappes M (2005). On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars, Fundamenta Informaticae, 64:1-4, (229-239), Online publication date: 1-Jan-2005.
- Cavaliere M and Sburlan D (2005). Time and Synchronization in Membrane Systems, Fundamenta Informaticae, 64:1-4, (65-77), Online publication date: 1-Jan-2005.
- Bergstra J and Middelburg C Model theory for process algebra Processes, Terms and Cycles, (445-495)
- Badr Y and Chbeir R Automatic image description based on textual data Journal on Data Semantics VII, (196-218)
- Nowostawski M, Purvis M and Cranefield S An architecture for self-organising evolvable virtual machines Engineering Self-Organising Systems, (100-122)
- Eisman G and Ravikumar B Approximate recognition of non-regular languages by finite automata Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38, (219-227)
- Henzinger T, Majumdar R and Raskin J (2005). A classification of symbolic transition systems, ACM Transactions on Computational Logic, 6:1, (1-32), Online publication date: 1-Jan-2005.
- Lee D, Liu C and Yannakakis M Protocol system integration, interface and interoperability Proceedings of the 8th international conference on Principles of Distributed Systems, (1-19)
- Tajima Y, Tomita E, Wakatsuki M and Terada M (2004). Polynomial time learning of simple deterministic languages via queries and a representative sample, Theoretical Computer Science, 329:1, (203-221), Online publication date: 13-Dec-2004.
- Bordihn H, Holzer M and Kutrib M Input reversals and iterated pushdown automata Proceedings of the 8th international conference on Developments in Language Theory, (102-113)
- Anselmo M, Giammarresi D and Madonia M Regular expressions for two-dimensional languages over one-letter alphabet Proceedings of the 8th international conference on Developments in Language Theory, (63-75)
- Green T, Gupta A, Miklau G, Onizuka M and Suciu D (2004). Processing XML streams with deterministic automata and stream indexes, ACM Transactions on Database Systems, 29:4, (752-788), Online publication date: 12-Dec-2004.
- Domaratzki M (2004). Trajectory-Based Embedding Relations, Fundamenta Informaticae, 59:4, (349-363), Online publication date: 1-Dec-2004.
- Shen X, Zhong Y and Ding C (2004). Locality phase prediction, ACM SIGOPS Operating Systems Review, 38:5, (165-176), Online publication date: 1-Dec-2004.
- Shen X, Zhong Y and Ding C (2004). Locality phase prediction, ACM SIGARCH Computer Architecture News, 32:5, (165-176), Online publication date: 1-Dec-2004.
- Krishna S and Pâun A (2004). Results on catalytic and evolution-communication P systems, New Generation Computing, 22:4, (377-394), Online publication date: 1-Dec-2004.
- Dersanambika K, Krithivasan K, Martin-Vide C and Subramanian K Hexagonal pattern languages Proceedings of the 10th international conference on Combinatorial Image Analysis, (52-64)
- Xie G, Li C and Dang Z (2004). Linear reachability problems and minimal solutions to linear Diophantine equation systems, Theoretical Computer Science, 328:1-2, (203-219), Online publication date: 29-Nov-2004.
- Tamm H and Ukkonen E (2004). Bideterministic automata and minimal representations of regular languages, Theoretical Computer Science, 328:1-2, (135-149), Online publication date: 29-Nov-2004.
- Ravikumar B and Eisman G (2004). Weak minimization of DFA, Theoretical Computer Science, 328:1-2, (113-133), Online publication date: 29-Nov-2004.
- Lombardy S, Régis-Gianas Y and Sakarovitch J (2004). Introducing VAUCANSON, Theoretical Computer Science, 328:1-2, (77-96), Online publication date: 29-Nov-2004.
- Gerede Ç, Hull R, Ibarra O and Su J Automated composition of e-services Proceedings of the 2nd international conference on Service oriented computing, (252-262)
- Hore B, Hacigumus H, Iyer B and Mehrotra S Indexing text data under space constraints Proceedings of the thirteenth ACM international conference on Information and knowledge management, (198-207)
- Shen X, Zhong Y and Ding C (2004). Locality phase prediction, ACM SIGPLAN Notices, 39:11, (165-176), Online publication date: 1-Nov-2004.
- Chen H and Pucella R (2004). A coalgebraic approach to Kleene algebra with tests, Theoretical Computer Science, 327:1-2, (23-44), Online publication date: 25-Oct-2004.
- Hemaspaandra L and Thakur M (2004). Lower bounds and the hardness of counting properties, Theoretical Computer Science, 326:1-3, (1-28), Online publication date: 20-Oct-2004.
- Shen X, Zhong Y and Ding C Locality phase prediction Proceedings of the 11th international conference on Architectural support for programming languages and operating systems, (165-176)
- Chung T, Park D, Ryu Y and Hong S LSTAFF Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications, (704-712)
- Madhu M and Krithivasan K (2004). Length synchronization context-free grammars, Journal of Automata, Languages and Combinatorics, 9:4, (457-464), Online publication date: 1-Oct-2004.
- Jurdziński T, Lorys K, Niemann G and Otto F (2004). Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages, Journal of Automata, Languages and Combinatorics, 9:4, (407-437), Online publication date: 1-Oct-2004.
- Seinstra F, Koelma D and Bagdanov A (2004). Finite State Machine-Based Optimization of Data Parallel Regular Domain Problems Applied in Low-Level Image Processing, IEEE Transactions on Parallel and Distributed Systems, 15:10, (865-877), Online publication date: 1-Oct-2004.
- Barbé A, von Haeseler F and Skordev G (2004). Scaling properties of generalized Carlitz sequences of polynomials, Discrete Applied Mathematics, 143:1-3, (166-181), Online publication date: 30-Sep-2004.
- Cortese P, Di Battista G, Patrignani M and Pizzonia M Clustering cycles into cycles of clusters Proceedings of the 12th international conference on Graph Drawing, (100-110)
- Baldoni M, Baroglio C, Martelli A, Patti V and Schifanella C Verifying protocol conformance for logic-based communicating agents Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems, (196-212)
- Karhumäki J Finite sets of words and computing Proceedings of the 4th international conference on Machines, Computations, and Universality, (36-49)
- Antunes C and Oliveira A Constraint relaxations for discovering unknown sequential patterns Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases, (11-32)
- Borchardt B (2004). A pumping lemma and decidability problems for recognizable tree series, Acta Cybernetica, 16:4, (509-544), Online publication date: 1-Sep-2004.
- Kerren A (2004). Generation as method for explorative learning in computer science education, ACM SIGCSE Bulletin, 36:3, (77-81), Online publication date: 1-Sep-2004.
- Phoha V, Nadgar A, Ray A and Phoha S (2004). Supervisory Control of Software Systems, IEEE Transactions on Computers, 53:9, (1187-1199), Online publication date: 1-Sep-2004.
- Llorens M and Oliver J (2004). Structural and Dynamic Changes in Concurrent Systems, IEEE Transactions on Computers, 53:9, (1147-1158), Online publication date: 1-Sep-2004.
- Bhattacharyya S and Murthy P (2004). The CBP Parameter, Journal of VLSI Signal Processing Systems, 38:2, (131-146), Online publication date: 1-Sep-2004.
- Alexeev B (2004). Minimal DFA for testing divisibility, Journal of Computer and System Sciences, 69:2, (235-243), Online publication date: 1-Sep-2004.
- Nederhof M and Satta G Kullback-Leibler distance between probabilistic context-free grammars and probabilistic finite automata Proceedings of the 20th international conference on Computational Linguistics, (71-es)
- Ravikumar B (2004). Peg-solitaire, string rewriting systems and finite automata, Theoretical Computer Science, 321:2-3, (383-394), Online publication date: 16-Aug-2004.
- Bouyer P, Dufourd C, Fleury E and Petit A (2004). Updatable timed automata, Theoretical Computer Science, 321:2-3, (291-345), Online publication date: 16-Aug-2004.
- Cavaliere M and Leupold P (2004). Evolution and observation, Theoretical Computer Science, 321:2-3, (233-248), Online publication date: 16-Aug-2004.
- Garzon M and Deaton R (2004). Codeword design and information encoding in DNA ensembles, Natural Computing: an international journal, 3:3, (253-292), Online publication date: 1-Aug-2004.
- Vasconcelos W, Robertson D, Sierra C, Esteva M, Sabater J and Wooldridge M (2004). Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming, Annals of Mathematics and Artificial Intelligence, 41:2-4, (135-169), Online publication date: 1-Aug-2004.
- Choudhury M, Basu A and Sarkar S 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, (20-26)
- Champarnaud J, Nicart F and Ziadi D Computing the follow automaton of an expression Proceedings of the 9th international conference on Implementation and Application of Automata, (90-101)
- Bordihn H, Holzer M and Kutrib M Some non-semi-decidability problems for linear and deterministic context-free languages Proceedings of the 9th international conference on Implementation and Application of Automata, (68-79)
- Tischler G Parametric weighted finite automata for figure drawing Proceedings of the 9th international conference on Implementation and Application of Automata, (259-268)
- Krawetz B, Lawrence J and Shallit J State complexity and the monoid of transformations of a finite set Proceedings of the 9th international conference on Implementation and Application of Automata, (213-224)
- John S Minimal unambiguous εNFA Proceedings of the 9th international conference on Implementation and Application of Automata, (190-201)
- Seow K, Ma C and Yokoo M Multiagent Planning as Control Synthesis Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2, (972-979)
- Kappes M (2004). On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars, Fundamenta Informaticae, 64:1-4, (229-239), Online publication date: 1-Jul-2004.
- Cavaliere M and Sburlan D (2004). Time and Synchronization in Membrane Systems, Fundamenta Informaticae, 64:1-4, (65-77), Online publication date: 1-Jul-2004.
- Kerren A Generation as method for explorative learning in computer science education Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, (77-81)
- Núñez M, Rodríguez I and Rubio F A formal framework to reduce communications in communication systems Proceedings of the 4th international conference on Innovative Internet Community Systems, (69-80)
- Domaratzki M (2004). Deletion along trajectories, Theoretical Computer Science, 320:2-3, (293-313), Online publication date: 14-Jun-2004.
- Freund R, Oswald M and Păun A P systems generating trees Proceedings of the 5th international conference on Membrane Computing, (309-319)
- Cavaliere M and Sburlan D Time–independent p systems Proceedings of the 5th international conference on Membrane Computing, (239-258)
- Hull R and Su J Tools for design of composite Web services Proceedings of the 2004 ACM SIGMOD international conference on Management of data, (958-961)
- Abiteboul S, Benjelloun O, Cautis B, Manolescu I, Milo T and Preda N Lazy query evaluation for Active XML Proceedings of the 2004 ACM SIGMOD international conference on Management of data, (227-238)
- Cavaliere M, Jonoska N, Yogev S, Piran R, Keinan E and Seeman N Biomolecular implementation of computing devices with unbounded memory Proceedings of the 10th international conference on DNA computing, (35-49)
- Câmpeanu C and Păun A Computing beyond the turing limit using the h systems Proceedings of the 10th international conference on DNA computing, (24-34)
- Alhazov A and Cavaliere M Computing by observing bio-systems Proceedings of the 10th international conference on DNA computing, (1-13)
- Rintanen J Complexity of planning with partial observability Proceedings of the Fourteenth International Conference on International Conference on Automated Planning and Scheduling, (345-354)
- Di Fabbrizio G and Lewis C An xpath-based discourse analysis module for spoken dialogue systems Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, (408-409)
- Balsamo S, Di Marco A, Inverardi P and Simeoni M (2004). Model-Based Performance Prediction in Software Development, IEEE Transactions on Software Engineering, 30:5, (295-310), Online publication date: 1-May-2004.
- van Zijl L (2004). Generalized acceptance, succinctness and supernondeterministic finite automata, Theoretical Computer Science, 313:1, (159-172), Online publication date: 16-Feb-2004.
- Arenas M, Fan W and Libkin L Consistency of XML specifications Inconsistency Tolerance, (15-41)
- Lavie A and Rosé C Optimal ambiguity packing in context-free parsers with interleaved unification New developments in parsing technology, (307-321)
- Kiefer B and Krieger H A context-free superset approximation of unification-based grammars New developments in parsing technology, (229-250)
- Bunt H, Carroll J and Satta G Development in parsing technology New developments in parsing technology, (1-18)
- Santean N (2004). Bimachines and structurally-reversed automata, Journal of Automata, Languages and Combinatorics, 9:1, (121-146), Online publication date: 1-Jan-2004.
- Guaiana G, Restivo A and Salemi S (2004). On the trace product and some families of languages closed under partial commutations, Journal of Automata, Languages and Combinatorics, 9:1, (61-79), Online publication date: 1-Jan-2004.
- Chen D and Wong R Optimizing the lazy DFA approach for XML stream processing Proceedings of the 15th Australasian database conference - Volume 27, (131-140)
- Ferrarotti F and Turull-Torres J On the computation of approximations of database queries Proceedings of the 15th Australasian database conference - Volume 27, (27-37)
- Gottlob G and Koch C (2004). Monadic datalog and the expressive power of languages for Web information extraction, Journal of the ACM, 51:1, (74-113), Online publication date: 1-Jan-2004.
- Cienciala L and Ciencialová L (2004). Membrane automata with priorities, Journal of Computer Science and Technology, 19:1, (89-97), Online publication date: 1-Jan-2004.
- Cooper K and Torczon L (2003). Engineering a Compiler, 10.5555/2737838, Online publication date: 11-Dec-2003.
- Oflazer K (2003). Dependency Parsing with an Extended Finite-State Approach, Computational Linguistics, 29:4, (515-544), Online publication date: 1-Dec-2003.
- Beaubouef T (2003). Why computer science students need language, ACM SIGCSE Bulletin, 35:4, (51-54), Online publication date: 1-Dec-2003.
- Calvanese D, De Giacomo G, Lenzerini M and Vardi M (2003). Reasoning on regular path queries, ACM SIGMOD Record, 32:4, (83-92), Online publication date: 1-Dec-2003.
- Diao Y, Altinel M, Franklin M, Zhang H and Fischer P (2003). Path sharing and predicate evaluation for high-performance XML filtering, ACM Transactions on Database Systems, 28:4, (467-516), Online publication date: 1-Dec-2003.
- Bailey M and Davidson J (2003). Automatic Detection and Diagnosis of Faults in Generated Code for Procedure Calls, IEEE Transactions on Software Engineering, 29:11, (1031-1042), Online publication date: 1-Nov-2003.
- Van Bragt D and La Poutré J (2003). Why Agents for Automated Negotiations Should Be Adaptive, Netnomics, 5:2, (101-118), Online publication date: 1-Nov-2003.
- Jain S and Kinber E (2003). Intrinsic complexity of learning geometrical concepts from positive data, Journal of Computer and System Sciences, 67:3, (546-607), Online publication date: 1-Nov-2003.
- Ly O (2003). Automatic graphs and D0L-sequences of finite graphs, Journal of Computer and System Sciences, 67:3, (497-545), Online publication date: 1-Nov-2003.
- Sommer R and Paxson V Enhancing byte-level network intrusion detection signatures with context Proceedings of the 10th ACM conference on Computer and communications security, (262-271)
- Murata M, Tozawa A, Kudo M and Hada S XML access control using static analysis Proceedings of the 10th ACM conference on Computer and communications security, (73-84)
- Giannakopoulou D and Magee J (2003). Fluent model checking for event-based systems, ACM SIGSOFT Software Engineering Notes, 28:5, (257-266), Online publication date: 1-Sep-2003.
- Giannakopoulou D and Magee J Fluent model checking for event-based systems Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, (257-266)
- Chalup S and Blair A (2003). Incremental training of first order recurrent neural networks to predict a context-sensitive language, Neural Networks, 16:7, (955-972), Online publication date: 1-Sep-2003.
- Domaratzki M (2003). Trajectory-based embedding relations, Fundamenta Informaticae, 59:4, (349-363), Online publication date: 1-Aug-2003.
- Watson B and Watson R (2003). A Boyer--Moore-style algorithm for regular expression pattern matching, Science of Computer Programming, 48:2-3, (99-117), Online publication date: 1-Aug-2003.
- Watson B (2003). A new algorithm for the construction of minimal acyclic DFAs, Science of Computer Programming, 48:2-3, (81-97), Online publication date: 1-Aug-2003.
- Yamamoto H and Miyazaki T A fast bit-parallel algorithm for matching extended regular expressions Proceedings of the 9th annual international conference on Computing and combinatorics, (222-231)
- Fischer E and Makowsky J The specker-blatter theorem revisited Proceedings of the 9th annual international conference on Computing and combinatorics, (90-101)
- Frishert M, Cleophas L and Watson B The effect of rewriting regular expressions on their accepting automata Proceedings of the 8th international conference on Implementation and application of automata, (304-306)
- Castaño J LR parsing for global index languages (GILs) Proceedings of the 8th international conference on Implementation and application of automata, (269-281)
- Daley M, Eramian M and McQuillan I Bag automata and stochastic retrieval of biomolecules in solution Proceedings of the 8th international conference on Implementation and application of automata, (239-250)
- Ravikumar B Weak minimization of DFA Proceedings of the 8th international conference on Implementation and application of automata, (226-238)
- Hosoya H and Murata M Boolean operations for attribute-element constraints Proceedings of the 8th international conference on Implementation and application of automata, (201-212)
- Xie G, Li C and Dang Z New complexity results for some linear counting problems using minimal solutions to linear diophantine equations Proceedings of the 8th international conference on Implementation and application of automata, (163-175)
- Guingne F, Kempe A and Nicart F Running time complexity of printing an acyclic automaton Proceedings of the 8th international conference on Implementation and application of automata, (131-140)
- Lombardy S, Poss R, Régis-Gianas Y and Sakarovitch J Introducing VAUCANSON Proceedings of the 8th international conference on Implementation and application of automata, (96-107)
- Karhumäki J Automata on words Proceedings of the 8th international conference on Implementation and application of automata, (3-11)
- Hemaspaandra L, Mukherji P and Tantau T Computation with absolutely no space overhead Proceedings of the 7th international conference on Developments in language theory, (325-336)
- Giammarresi D Computing languages by (Bounded) local sets Proceedings of the 7th international conference on Developments in language theory, (304-315)
- Anselmo M and Madonia M Covering problems from a formal language point of view Proceedings of the 7th international conference on Developments in language theory, (122-133)
- Madani O, Hanks S and Condon A (2003). On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, 147:1-2, (5-34), Online publication date: 1-Jul-2003.
- Kim K and Dean T (2003). Solving factored MDPs using non-homogeneous partitions, Artificial Intelligence, 147:1-2, (225-251), Online publication date: 1-Jul-2003.
- Holzer M and Kutrib M Flip-pushdown automata Proceedings of the 30th international conference on Automata, languages and programming, (490-501)
- Christensen A, Møller A and Schwartzbach M Precise analysis of string expressions Proceedings of the 10th international conference on Static analysis, (1-18)
- Gupta A and Suciu D Stream processing of XPath queries with predicates Proceedings of the 2003 ACM SIGMOD international conference on Management of data, (419-430)
- Milo T, Abiteboul S, Amann B, Benjelloun O and Ngoc F Exchanging intensional XML data Proceedings of the 2003 ACM SIGMOD international conference on Management of data, (289-300)
- Grahne G and Thomo A 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, (111-122)
- Hull R, Benedikt M, Christophides V and Su J E-services Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (1-14)
- Park S About the relationship between election problem and failure detector in asynchronous distributed systems Proceedings of the 1st international conference on Computational science: PartI, (185-193)
- de A. Barreto G, Araújo A and Kremer S (2003). A taxonomy for spatiotemporal connectionist networks revisited, Neural Computation, 15:6, (1255-1320), Online publication date: 1-Jun-2003.
- Chesñevar C, Cobo M and Yurcik W (2003). Using theoretical computer simulators for formal languages and automata theory, ACM SIGCSE Bulletin, 35:2, (33-37), Online publication date: 1-Jun-2003.
- Sullivan P (2003). Cut, paste and filter, Discrete Applied Mathematics, 128:2-3, (465-485), Online publication date: 1-Jun-2003.
- Bultan T, Fu X, Hull R and Su J Conversation specification Proceedings of the 12th international conference on World Wide Web, (403-410)
- Flanagan C and Qadeer S Thread-modular model checking Proceedings of the 10th international conference on Model checking software, (213-224)
- Wu T and Pottenger W A semi-supervised algorithm for pattern discovery in information extraction from textual data Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining, (117-123)
- Austin A and Egerstedt M Mode reconstruction for source coding and multi-modal control Proceedings of the 6th international conference on Hybrid systems: computation and control, (36-49)
- Lanotte R, Maggiolo-Schettini A, Peron A and Tini S (2003). Dynamic Hierarchical Machines, Fundamenta Informaticae, 54:2-3, (237-252), Online publication date: 1-Apr-2003.
- Xu S and Chee Y (2003). Transformation-Based Diagnosis of Student Programs for Programming Tutoring Systems, IEEE Transactions on Software Engineering, 29:4, (360-384), Online publication date: 1-Apr-2003.
- Carton O and Michel M (2003). Unambiguous Büchi automata, Theoretical Computer Science, 297:1-3, (37-81), Online publication date: 17-Mar-2003.
- Grahne G and Thomo A (2003). Algebraic rewritings for optimizing regular path queries, Theoretical Computer Science, 296:3, (453-471), Online publication date: 14-Mar-2003.
- Peña J, Corchuelo R and Arjona J A top down approach for MAS protocol descriptions Proceedings of the 2003 ACM symposium on Applied computing, (45-49)
- Fernau H (2003). Nonterminal complexity of programmed grammars, Theoretical Computer Science, 296:2, (225-251), Online publication date: 8-Mar-2003.
- Beneventano D, Bergamaschi S and Sartori C (2003). Description logics for semantic query optimization in object-oriented database systems, ACM Transactions on Database Systems, 28:1, (1-50), Online publication date: 1-Mar-2003.
- De Moor O, Lacey D and Van Wyk E (2003). Universal Regular Path Queries, Higher-Order and Symbolic Computation, 16:1-2, (15-35), Online publication date: 1-Mar-2003.
- Dillon L and Stirewalt R (2003). Inference Graphs, IEEE Transactions on Software Engineering, 29:2, (133-150), Online publication date: 1-Feb-2003.
- Shankar P, Dasgupta A, Deshmukh K and Rajan B (2003). On viewing block codes as finite automata, Theoretical Computer Science, 290:3, (1775-1797), Online publication date: 3-Jan-2003.
- Beaudry M, Holzer M, Niemann G and Otto F (2003). McNaughton families of languages, Theoretical Computer Science, 290:3, (1581-1628), Online publication date: 3-Jan-2003.
- Jain S (2003). The Intrinsic Complexity of Learning: A Survey, Fundamenta Informaticae, 57:1, (17-37), Online publication date: 1-Jan-2003.
- Jain S (2003). The Intrinsic Complexity of Learning: A Survey, Fundamenta Informaticae, 57:1, (17-37), Online publication date: 1-Jan-2003.
- Brzozowski J Sequential machine Encyclopedia of Computer Science, (1564-1569)
- Goldstine J Formal languages Encyclopedia of Computer Science, (716-720)
- Case J Automata theory Encyclopedia of Computer Science, (112-117)
- Herman G Algorithms, theory of Encyclopedia of Computer Science, (51-53)
- Zhang F and Cheung T (2003). Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines, IEEE Transactions on Software Engineering, 29:1, (1-14), Online publication date: 1-Jan-2003.
- Amadio R, Lugiez D and Vanackère V (2003). On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science, 290:1, (695-740), Online publication date: 1-Jan-2003.
- Denis F, Lemay A and Terlutte A (2002). Residual Finite State Automata, Fundamenta Informaticae, 51:4, (339-368), Online publication date: 1-Dec-2002.
- Beaubouef T (2002). Why computer science students need math, ACM SIGCSE Bulletin, 34:4, (57-59), Online publication date: 1-Dec-2002.
- Wagner D and Soto P Mimicry attacks on host-based intrusion detection systems Proceedings of the 9th ACM conference on Computer and communications security, (255-264)
- Chen H and Wagner D MOPS Proceedings of the 9th ACM conference on Computer and communications security, (235-244)
- Chen Y, Davidson S and Zheng Y XKvalidator Proceedings of the eleventh international conference on Information and knowledge management, (446-452)
- Plasil F and Visnovsky S (2002). Behavior Protocols for Software Components, IEEE Transactions on Software Engineering, 28:11, (1056-1076), Online publication date: 1-Nov-2002.
- Brit H, Moran S and Taubenfeld G (2002). Public data structures, Theoretical Computer Science, 289:1, (401-423), Online publication date: 23-Oct-2002.
- Champarnaud J and Ziadi D (2002). Canonical derivatives, partial derivatives and finite automaton constructions, Theoretical Computer Science, 289:1, (137-163), Online publication date: 23-Oct-2002.
- Brooks R and Orr N (2002). A Model for Mobile Code Using Interacting Automata, IEEE Transactions on Mobile Computing, 1:4, (313-326), Online publication date: 1-Oct-2002.
- Nicodème P, Salvy B and Flajolet P (2002). Motif statistics, Theoretical Computer Science, 287:2, (593-617), Online publication date: 28-Sep-2002.
- Horváth S, Leupold P and Lischke G Roots and powers of regular languages Proceedings of the 6th international conference on Developments in language theory, (220-230)
- Adorna H On the separation between k-party and (k - 1)-party nondeterministic message complexities Proceedings of the 6th international conference on Developments in language theory, (152-161)
- Hoogeboom H Carriers and counters Proceedings of the 6th international conference on Developments in language theory, (140-151)
- Seibert S Efficient transformations from regular expressions to finite automata Proceedings of the 6th international conference on Developments in language theory, (28-42)
- Hazzan O (2002). Reducing abstraction level when learning computability theory concepts, ACM SIGCSE Bulletin, 34:3, (156-160), Online publication date: 1-Sep-2002.
- Chan C, Garofalakis M and Rastogi R RE-Tree Proceedings of the 28th international conference on Very Large Data Bases, (251-262)
- Ludäscher B, Mukhopadhyay P and Papakonstantinou Y A transducer-based XML query processor Proceedings of the 28th international conference on Very Large Data Bases, (227-238)
- de la Puente A, Alfonso R and Moreno M Automatic composition of music by means of grammatical evolution Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications, (148-155)
- Vasconcelos W, Sabater J, Sierra C and Querol J Skeleton-based agent development for electronic institutions Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (696-703)
- Stone M Lexicalized grammar 101 Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1, (77-84)
- Holub J Dynamic programming Proceedings of the 7th international conference on Implementation and application of automata, (295-300)
- Caron P and Flouret M Star normal form, rational expressions, and glushkov WFAs properties Proceedings of the 7th international conference on Implementation and application of automata, (248-254)
- Brüggemann-Klein A and Wood D On predictive parsing and extended context-free grammars Proceedings of the 7th international conference on Implementation and application of automata, (239-247)
- Czyzowicz J, Fraczak W, Pelc A and Rytter W Prime decompositions of regular prefix codes Proceedings of the 7th international conference on Implementation and application of automata, (85-94)
- Câmpeanu C, Salomaa K and Yu S Regex and extended regex Proceedings of the 7th international conference on Implementation and application of automata, (77-84)
- Câmpeanu C and Paun A The number of similarity relations and the number of minimal deterministic finite cover automata Proceedings of the 7th international conference on Implementation and application of automata, (67-76)
- Anselmo M, Giammarresi D and Varricchio S Finite automata and non-self-embedding grammars Proceedings of the 7th international conference on Implementation and application of automata, (47-56)
- Siegmund R and Müller D (2002). Automatic Synthesis of Communication Controller Hardware from Protocol Specifications, IEEE Design & Test, 19:4, (84-95), Online publication date: 1-Jul-2002.
- Padovan B, Sackmann S, Eymann T and Pippow I (2002). A Prototype for an Agent-Based Secure Electronic Marketplace Including Reputation-Tracking Mechanisms, International Journal of Electronic Commerce, 6:4, (93-113), Online publication date: 1-Jul-2002.
- Hazzan O Reducing abstraction level when learning computability theory concepts Proceedings of the 7th annual conference on Innovation and technology in computer science education, (156-160)
- Lanotte R, Maggiolo-Schettini A, Peron A and Tini S (2002). Dynamic hierarchical machines, Fundamenta Informaticae, 54:2-3, (237-252), Online publication date: 15-Jun-2002.
- Siegmund R and Müller D A novel synthesis technique for communication controller hardware from declarative data communication protocol specifications Proceedings of the 39th annual Design Automation Conference, (602-607)
- Chung C, Min J and Shim K APEX Proceedings of the 2002 ACM SIGMOD international conference on Management of data, (121-132)
- Segoufin L and Vianu V Validating streaming XML documents Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (53-64)
- Gottlob G and Koch C Monadic datalog and the expressive power of languages for web information extraction Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (17-28)
- de la Puente A, Alfonso R and Moreno M (2002). Automatic composition of music by means of grammatical evolution, ACM SIGAPL APL Quote Quad, 32:4, (148-155), Online publication date: 1-Jun-2002.
- Sorin D, Plakal M, Condon A, Hill M, Martin M and Wood D (2002). Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol, IEEE Transactions on Parallel and Distributed Systems, 13:6, (556-578), Online publication date: 1-Jun-2002.
- Ross B (2002). The evolution of stochastic regular motifs for protein sequences, New Generation Computing, 20:2, (187-213), Online publication date: 1-Jun-2002.
- Chrzastowski-Wachtel P and Tyszkiewicz J A maple package for conditional event algebras Proceedings of the 2002 international conference on Conditionals, Information, and Inference, (131-151)
- Bailey J, Poulovassilis A and Wood P An event-condition-action language for XML Proceedings of the 11th international conference on World Wide Web, (486-495)
- Watanabe T, Sugawara K and Sugihara H (2002). A New Pattern Representation Scheme Using Data Compression, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:5, (579-590), Online publication date: 1-May-2002.
- Knapik T (2002). Checking Simple Properties of Transition Systems Defined by Thue Specifications, Journal of Automated Reasoning, 28:4, (337-369), Online publication date: 1-May-2002.
- Delorme M and Mazoyer J (2002). Pebble automata, Fundamenta Informaticae, 52:1-3, (81-132), Online publication date: 1-Apr-2002.
- Denis F, Lemay A and Terlutte A (2002). Residual Finite State Automata, Fundamenta Informaticae, 51:4, (339-368), Online publication date: 30-Mar-2002.
- Kučera A and Mayr R (2002). Simulation preorder over simple process algebras, Information and Computation, 173:2, (184-198), Online publication date: 15-Mar-2002.
- Rasmussen S, Baas N, Mayer B, Nilsson M and Olesen M (2002). Ansatz for dynamical hierarchies, Artificial Life, 7:4, (329-353), Online publication date: 1-Mar-2002.
- Bruhn P and Geyer-Schulz A (2002). Genetic programming over context-free languages with linear constraints for the knapsack problem, Evolutionary Computation, 10:1, (51-74), Online publication date: 1-Mar-2002.
- Grinder M (2002). Animating automata, ACM SIGCSE Bulletin, 34:1, (63-67), Online publication date: 1-Mar-2002.
- Grinder M Animating automata Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (63-67)
- Lee D and Yannakakis M (2002). Closed Partition Lattice and Machine Decomposition, IEEE Transactions on Computers, 51:2, (216-228), Online publication date: 1-Feb-2002.
- Sanders W and Meyer J Stochastic activity networks Lectures on formal methods and performance analysis, (315-343)
- Kim C (2002). Two undecidability results for chain code picture languages, Theoretical Computer Science, 270:1-2, (969-976), Online publication date: 6-Jan-2002.
- Ewert S and van der Walt A (2002). A pumping lemma for random permitting context languages, Theoretical Computer Science, 270:1-2, (959-967), Online publication date: 6-Jan-2002.
- Iwamoto C, Hatsuyama T, Morita K and Imai K (2002). Constructible functions in cellular automata and their applications to hierarchy results, Theoretical Computer Science, 270:1-2, (797-809), Online publication date: 6-Jan-2002.
- Zhang L, Inoue K, Ito A and Wang Y (2002). Probabilistic rebound Turing machines, Theoretical Computer Science, 270:1-2, (739-760), Online publication date: 6-Jan-2002.
- Kuča A and Mayr R (2002). Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Theoretical Computer Science, 270:1-2, (677-700), Online publication date: 6-Jan-2002.
- Shallit J and Wang M (2002). On two-sided infinite fixed points of morphisms, Theoretical Computer Science, 270:1-2, (659-675), Online publication date: 6-Jan-2002.
- Bergman C and Slutzki G (2002). Computational complexity of some problems involving congruences on algebras, Theoretical Computer Science, 270:1-2, (591-608), Online publication date: 6-Jan-2002.
- Cherubini A, Reghizzi S and San Pietro P (2002). Associative language descriptions, Theoretical Computer Science, 270:1-2, (463-491), Online publication date: 6-Jan-2002.
- Case J, Jain S and Suraj M (2002). Control structures in hypothesis spaces, Theoretical Computer Science, 270:1-2, (287-308), Online publication date: 6-Jan-2002.
- Grädel E, Thomas W and Wilke T Literature Automata logics, and infinite games, (365-376)
- Hoogeboom H and van Vugt N Upper bounds for restricted splicing Formal and natural computing, (361-375)
- Delorme M and Mazoyer J (2002). Pebble Automata. Figures Families Recognition and Universality, Fundamenta Informaticae, 52:1-3, (81-132), Online publication date: 1-Jan-2002.
- Nipkow T, Wenzel M and Paulson L (2002). Isabelle/HOL, 10.5555/1791547, Online publication date: 1-Jan-2002.
- Müller P (2002). Modular specification and verification of object-oriented programs, 10.5555/1767748, Online publication date: 1-Jan-2002.
- Shatkay H and Kaelbling L (2002). Learning geometrically-constrained hidden Markov models for robot navigation, Journal of Artificial Intelligence Research, 16:1, (167-207), Online publication date: 1-Jan-2002.
- Venkateswaran J, Jafferali M and Son Y Distributed simulation Proceedings of the 33nd conference on Winter simulation, (856-862)
- Yilmaz L Verification and validation Proceedings of the 33nd conference on Winter simulation, (586-594)
- Xiao Y, Sabry A and Ariola Z (2001). From Syntactic Theories to Interpreters, Higher-Order and Symbolic Computation, 14:4, (387-409), Online publication date: 1-Dec-2001.
- Ross B (2001). Logic-based genetic programming with definite clause translation grammars, New Generation Computing, 19:4, (313-337), Online publication date: 1-Dec-2001.
- Giannakopoulou D and Havelund K Automata-Based Verification of Temporal Properties on Running Programs Proceedings of the 16th IEEE international conference on Automated software engineering
- Nitta N, Takata Y and Seki H An efficient security verification method for programs with stack inspection Proceedings of the 8th ACM conference on Computer and Communications Security, (68-77)
- Yevtushenko N, Villa T, Brayton R, Petrenko A and Sangiovanni-Vincentelli A Solution of parallel language equations for logic synthesis Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (103-110)
- Scheutz M (2001). Computational versus Causal Complexity, Minds and Machines, 11:4, (543-566), Online publication date: 1-Nov-2001.
- (2001). Language Learning from Texts, Journal of Computer and System Sciences, 63:3, (305-354), Online publication date: 1-Nov-2001.
- Meyer L (2001). Aspects of complexity of probabilistic learning under monotonicity constraints, Theoretical Computer Science, 268:2, (275-322), Online publication date: 17-Oct-2001.
- Kuich W Forty years of formal power series in automata theory A half-century of automata theory, (49-71)
- Hopcroft J Automata theory A half-century of automata theory, (37-47)
- Hartmanis J Undecidability and incompleteness results in automata theory A half-century of automata theory, (21-35)
- Pérez-Ortiz J, Calera-Rubio J and Forcada M (2001). Online Text Prediction with Recurrent Neural Networks, Neural Processing Letters, 14:2, (127-140), Online publication date: 1-Oct-2001.
- Matsushita T and Runciman C (2001). The accepting power of unary string logic programs, Theoretical Computer Science, 266:1-2, (59-79), Online publication date: 6-Sep-2001.
- Danvy O and Nielsen L Defunctionalization at work Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (162-174)
- Bréhélin L, Gascuel O and Caraux G (2001). 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, 23:9, (997-1008), Online publication date: 1-Sep-2001.
- Champarnaud J and Ziadi D (2001). From Mirkin's Prebases to Antimirov's Word Partial Derivatives, Fundamenta Informaticae, 45:3, (195-205), Online publication date: 1-Aug-2001.
- Sgarbas K, Fakotakis N and Kokkinakis G Incremental construction of compact acyclic NFAs Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, (482-489)
- Johnson M Joint and conditional estimation of tagging and parsing models Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, (322-329)
- Dowding J, Hockey B, Gawron J and Culy C Practical issues in compiling typed unification grammars for speech recognition Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, (164-171)
- Aycock J (2001). Why bison is becoming extinct, XRDS: Crossroads, The ACM Magazine for Students, 7:5, (3-3), Online publication date: 5-Jul-2001.
- Reiss S and Renieris M Encoding program executions Proceedings of the 23rd International Conference on Software Engineering, (221-230)
- Kurt Stirewalt R and Dillon L A component-based approach to building formal analysis tools Proceedings of the 23rd International Conference on Software Engineering, (167-176)
- Janicki R and Sekerinski E (2001). Foundations of the Trace Assertion Method of Module Interface Specification, IEEE Transactions on Software Engineering, 27:7, (577-598), Online publication date: 1-Jul-2001.
- O'connor L (2001). On String Replacement Exponentiation, Designs, Codes and Cryptography, 23:2, (173-184), Online publication date: 1-Jul-2001.
- Parekh R and Honavar V (2001). Learning DFA from Simple Examples, Machine Language, 44:1-2, (9-35), Online publication date: 1-Jul-2001.
- Chatterjee S, Parker E, Hanlon P and Lebeck A Exact analysis of the cache behavior of nested loops Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, (286-297)
- Seawright A and Brewer F Clairvoyant Readings in hardware/software co-design, (375-388)
- Harel D, Lachover H, Naamad A, Pnueli A, Politi M, Sherman R, Shtull-Trauring A and Trakhtenbrot M STATEMATE Readings in hardware/software co-design, (135-146)
- Edwards S, Lavagno L, Lee E and Sangiovanni-Vincentelli A Design of embedded systems Readings in hardware/software co-design, (86-107)
- Roark B (2001). Probabilistic top-down parsing and language modeling, Computational Linguistics, 27:2, (249-276), Online publication date: 1-Jun-2001.
- Sherwood T and Calder B Automated design of finite state machine predictors for customized processors Proceedings of the 28th annual international symposium on Computer architecture, (86-97)
- Chatterjee R, Ryder B and Landi W (2001). Complexity of Points-To Analysis of Java in the Presence of Exceptions, IEEE Transactions on Software Engineering, 27:6, (481-512), Online publication date: 1-Jun-2001.
- Ho E and Chan L (2001). Analyzing Holistic Parsers: Implications for Robust Parsing and Systematicity, Neural Computation, 13:5, (1137-1170), Online publication date: 1-May-2001.
- Sherwood T and Calder B (2001). Automated design of finite state machine predictors for customized processors, ACM SIGARCH Computer Architecture News, 29:2, (86-97), Online publication date: 1-May-2001.
- Al-Kofahi K, Tyrrell A, Vachher A and Jackson P A machine learning approach to prior case retrieval Proceedings of the 8th international conference on Artificial intelligence and law, (88-93)
- Chatterjee S, Parker E, Hanlon P and Lebeck A (2001). Exact analysis of the cache behavior of nested loops, ACM SIGPLAN Notices, 36:5, (286-297), Online publication date: 1-May-2001.
- Dowling C and Hockemeyer C (2001). Automata for the Assessment of Knowledge, IEEE Transactions on Knowledge and Data Engineering, 13:3, (451-461), Online publication date: 1-May-2001.
- Andries M, Cabibbo L, Paredaens J and van den Bussche J (2001). Applying an update method to a set of receivers, ACM Transactions on Database Systems, 26:1, (1-40), Online publication date: 1-Mar-2001.
- Hosoya H and Pierce B (2001). Regular expression pattern matching for XML, ACM SIGPLAN Notices, 36:3, (67-80), Online publication date: 1-Mar-2001.
- Power J and Malloy B Exploiting metrics to facilitate grammar transformation into LALR format Proceedings of the 2001 ACM symposium on Applied computing, (636-640)
- Diehl S and Kerren A (2001). Levels of exploration, ACM SIGCSE Bulletin, 33:1, (60-64), Online publication date: 1-Mar-2001.
- Carrasco R and Forcada M (2001). Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks, IEEE Transactions on Knowledge and Data Engineering, 13:2, (148-156), Online publication date: 1-Mar-2001.
- Kremer S (2001). Spatiotemporal Connectionist Networks: A Taxonomy and Review, Neural Computation, 13:2, (249-306), Online publication date: 1-Feb-2001.
- Chang H, Wu S and Jou Y (2001). Real-time protocol analysis for detecting link-state routing protocol attacks, ACM Transactions on Information and System Security, 4:1, (1-36), Online publication date: 1-Feb-2001.
- Diehl S and Kerren A Levels of exploration Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, (60-64)
- Champarnaud J and Ziadi D (2001). From Mirkin's Prebases to Antimirov's Word Partial Derivatives, Fundamenta Informaticae, 45:3, (195-205), Online publication date: 5-Jan-2001.
- Clarke E and Schlingloff B Model checking Handbook of automated reasoning, (1635-1790)
- Rendell P Turing universality of the game of life Collision-based computing, (513-539)
- Forcada M and Carrasco R Finite-state computation in analog neural networks Emergent neural computational architectures based on neuroscience, (480-493)
- Moisl H Linguistic computation with state space trajectories Emergent neural computational architectures based on neuroscience, (442-460)
- Hosoya H and Pierce B Regular expression pattern matching for XML Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (67-80)
- Thirunarayan K and Ewing R (2001). Structural Operational Semantics for a Portable Subset of Behavioral VHDL-93, Formal Methods in System Design, 18:1, (69-88), Online publication date: 1-Jan-2001.
- Ross B (2000). Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions, Applied Intelligence, 13:3, (285-300), Online publication date: 29-Nov-2000.
- Arnold S, Mark L and Goldthwaite J Programming by voice, VocalProgramming Proceedings of the fourth international ACM conference on Assistive technologies, (149-155)
- Albrecht J, Hümmer W, Lehner W and Schlesinger L Query optimization by using derivability in a data warehouse environment Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP, (49-56)
- Lorentz R Creating Difficult Instances of the Post Correspondence Problem Revised Papers from the Second International Conference on Computers and Games, (214-228)
- Hosoya H, Vouillon J and Pierce B (2000). Regular expression types for XML, ACM SIGPLAN Notices, 35:9, (11-22), Online publication date: 1-Sep-2000.
- Hosoya H, Vouillon J and Pierce B Regular expression types for XML Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, (11-22)
- Hartmann J, Imoberdorf C and Meisinger M (2000). UML-Based integration testing, ACM SIGSOFT Software Engineering Notes, 25:5, (60-70), Online publication date: 1-Sep-2000.
- Hartmann J, Imoberdorf C and Meisinger M UML-Based integration testing Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis, (60-70)
- Wada T and Matsuyama T (2000). Multiobject Behavior Recognition by Event Driven Selective Attention Method, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:8, (873-887), Online publication date: 1-Aug-2000.
- Ramirez-Serrano A, Zhu S and Benhabib B (2000). Moore Automata for the Supervisory Control of Robotic Manufacturing Workcells, Autonomous Robots, 9:1, (59-69), Online publication date: 1-Aug-2000.
- Young-Lai M and Tompa F (2000). Stochastic Grammatical Inference of Text Database Structure, Machine Language, 40:2, (111-137), Online publication date: 1-Aug-2000.
- Schneider K Parsing schemata for grammars with variable number and order of constituents Proceedings of the 18th conference on Computational linguistics - Volume 2, (733-739)
- Johnson M and Roark B Compact non-left-recursive grammars using the selective left-corner transform and factoring Proceedings of the 18th conference on Computational linguistics - Volume 1, (355-361)
- Calvanese D, Giuseppe de Giacomo , Lenzerini M and Vardi M View-Based Query Processing and Constraint Satisfaction Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Bergman C and Slutzki G Computational Complexity of Some Problems Involving Congruences on Algebras Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Garofalakis M, Gionis A, Rastogi R, Seshadri S and Shim K (2000). XTRACT, ACM SIGMOD Record, 29:2, (165-176), Online publication date: 1-Jun-2000.
- Liefke H and Suciu D (2000). XMill, ACM SIGMOD Record, 29:2, (153-164), Online publication date: 1-Jun-2000.
- Garofalakis M, Gionis A, Rastogi R, Seshadri S and Shim K XTRACT Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (165-176)
- Liefke H and Suciu D XMill Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (153-164)
- Motwani R, Panigrahy R, Saraswat V and Ventkatasubramanian S On the decidability of accessibility problems (extended abstract) Proceedings of the thirty-second annual ACM symposium on Theory of computing, (306-315)
- Davulcu H, Yang G, Kifer M and Ramakrishnan I Computational aspects of resilient data extraction from semistructured sources (extended abstract) Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (136-144)
- Calvanese D, Vardi M, de Giacomo G and Lenzerini M View-based query processing for regular path queries with inverse Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (58-66)
- Papakonstantinou Y and Vianu V DTD inference for views of XML data Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (35-46)
- Dawson M, Medler D, Mccaughan D, Willson L and Carbonaro M (2000). Using Extra Output Learning to Insert a Symbolic Theory into a Connectionist Network, Minds and Machines, 10:2, (171-201), Online publication date: 1-May-2000.
- Yoon J Compound noun segmentation based on lexical data extracted from corpus Proceedings of the sixth conference on Applied natural language processing, (196-203)
- Le Maitre J, rcoux Y and Murisasco E SgmlQL + XGQL = powerful XML pattern-matching and data-manipulation in a single language Content-Based Multimedia Information Access - Volume 2, (1346-1362)
- Karhumäki J, Plandowski W and Rytter W (2000). Pattern-matching problems for two-dimensional images described by finite automata, Nordic Journal of Computing, 7:1, (1-13), Online publication date: 1-Mar-2000.
- Lanctot J, Li M and Yang E Estimating DNA sequence entropy Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (409-418)
- Walker D A type system for expressive security policies Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (254-267)
- Heath J and Welsch L Difficulties in parsing SGML Proceedings of the ACM conference on Document processing systems, (71-77)
- Debouk R, Lafortune S and Teneketzis D (2000). Coordinated Decentralized Protocols for Failure Diagnosisof Discrete Event Systems, Discrete Event Dynamic Systems, 10:1-2, (33-86), Online publication date: 1-Jan-2000.
- Alon N, Krivelevich M, Newman I and Szegedy M Regular Languages are Testable with a Constant Number of Queries Proceedings of the 40th Annual Symposium on Foundations of Computer Science
- Lundqvist K and Asplund L (1999). A formal model of the Ada Ravenscar tasking profile; delay until, ACM SIGAda Ada Letters, XIX:3, (15-21), Online publication date: 1-Sep-1999.
- Lundqvist K and Asplund L A formal model of the Ada Ravenscar tasking profile; delay until Proceedings of the 1999 annual ACM SIGAda international conference on Ada, (15-21)
- Kappes M (1999). Multi-Bracketed Contextual Rewriting Grammars, Fundamenta Informaticae, 38:3, (257-280), Online publication date: 1-Aug-1999.
- Bultan T, Gerber R and Pugh W (1999). Model-checking concurrent systems with unbounded integer variables, ACM Transactions on Programming Languages and Systems, 21:4, (747-789), Online publication date: 1-Jul-1999.
- Eisner J and Satta G 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, (457-464)
- Al-Kofahi K, Grom B and Jackson P 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, (138-146)
- Miller R and Myers B Lightweight structured text processing Proceedings of the annual conference on USENIX Annual Technical Conference, (10-10)
- Carmel D and Markovitch S (1999). Exploration Strategies for Model-based Learning in Multi-agent Systems, Autonomous Agents and Multi-Agent Systems, 2:2, (141-172), Online publication date: 1-Jun-1999.
- O'Connor L An analysis of exponentiation based on formal languages Proceedings of the 17th international conference on Theory and application of cryptographic techniques, (375-388)
- Bonner A Workflow, transactions and datalog Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (294-305)
- Amano M and Iwama K Undecidability on quantum finite automata Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (368-375)
- Puri A (1999). An Undecidable Problem for Timed Automata, Discrete Event Dynamic Systems, 9:2, (135-146), Online publication date: 1-May-1999.
- Formisano A and Policriti A (1999). T-Resolution, Journal of Automated Reasoning, 22:4, (433-483), Online publication date: 1-May-1999.
- Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
- Lillibridge M (1999). Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC, Higher-Order and Symbolic Computation, 12:1, (75-104), Online publication date: 1-Apr-1999.
- Müller-Olm M A modal fixpoint logic with chop Proceedings of the 16th annual conference on Theoretical aspects of computer science, (510-520)
- Lautemann C, Schweikardt N and Schwentick T A logical characterisation of linear time on nondeterministic turing machines Proceedings of the 16th annual conference on Theoretical aspects of computer science, (143-152)
- Preoteasa V (1999). A Relation Between Unambiguous Regular Expressions and Abstract Data Types, Fundamenta Informaticae, 40:1, (53-77), Online publication date: 1-Jan-1999.
- Wang F and Lo C (1999). Procedure-Level Verification of Real-time Concurrent Systems, Real-Time Systems, 16:1, (81-114), Online publication date: 1-Jan-1999.
- Gupta S (1998). Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997), ACM SIGACT News, 29:4, (5-10), Online publication date: 1-Dec-1998.
- Nakamura K, Takagi K, Kimura S and Watanabe K Waiting false path analysis of sequential logic circuits for performance optimization Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (392-395)
- Kamhi G and Fix L Adaptive variable reordering for symbolic model checking Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (359-365)
- LUNZE J (1998). Brief Paper, Automatica (Journal of IFAC), 34:11, (1439-1444), Online publication date: 1-Nov-1998.
- Bhansali S and Hoar T (1998). Automated Software Synthesis, IEEE Transactions on Software Engineering, 24:10, (848-862), Online publication date: 1-Oct-1998.
- Seligman M, Boitet C and Meddeb-Hamrouni B Transforming lattices into non-deterministic automata with optional null arcs Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2, (1205-1211)
- Mori S and Nagao M A stochastic language model using dependency and its improvement by word clustering Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2, (898-904)
- Bose S, Agrawal P and Agrawal V (1998). Deriving Logic Systems for Path Delay Test Generation, IEEE Transactions on Computers, 47:8, (829-846), Online publication date: 1-Aug-1998.
- Meyer L Aspects of complexity of conservative probabilistic learning Proceedings of the eleventh annual conference on Computational learning theory, (72-78)
- Passerone R, Rowson J and Sangiovanni-Vincentelli A Automatic synthesis of interfaces between incompatible protocols Proceedings of the 35th annual Design Automation Conference, (8-13)
- Satta G (1998). Review of "Parsing with principles and classes of information" by Paola Merlo. Kluwer Academic Publishers 1996., Computational Linguistics, 24:1, (167-172), Online publication date: 1-Mar-1998.
- Ball T (1998). On the limit of control flow analysis for regression test selection, ACM SIGSOFT Software Engineering Notes, 23:2, (134-142), Online publication date: 1-Mar-1998.
- Ball T On the limit of control flow analysis for regression test selection Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis, (134-142)
- Buhrman H, Kadin J and Thierauf T (1998). Functions Computable with Nonadaptive Queries to NP, Theory of Computing Systems, 31:1, (77-92), Online publication date: 1-Feb-1998.
- Asperti A and Mairson H Parallel beta reduction is not elementary recursive Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (303-315)
- Schubert A Second-order unification and type inference for Church-style polymorphism Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (279-288)
- Karshmer A, Gupta G, Geiiger S and Weaver C Reading and writing mathematics Proceedings of the third international ACM conference on Assistive technologies, (136-143)
- Leuschel M, Martens B and De Schreye D (1998). Controlling generalization and polyvariance in partial deduction of normal logic programs, ACM Transactions on Programming Languages and Systems, 20:1, (208-258), Online publication date: 1-Jan-1998.
- Cohen W (1998). Hardness Results for Learning First-Order Representations and Programming by Demonstration, Machine Language, 30:1, (57-87), Online publication date: 1-Jan-1998.
- Ţiplea F and Mäkinen E (1997). Jumping Petri Nets. Specific Properties, Fundamenta Informaticae, 32:3,4, (373-392), Online publication date: 1-Dec-1997.
- Plümer L and Gröger G (1997). Achieving Integrity in Geographic Information Systems—Maps and Nested Maps, Geoinformatica, 1:4, (345-367), Online publication date: 1-Dec-1997.
- Wolf W (1997). Redundancy Removal during High-Level Synthesis Using Scheduling Don‘t-Cares, Journal of Electronic Testing: Theory and Applications, 11:3, (211-225), Online publication date: 1-Dec-1997.
- Suzuki Y and Tanaka H (1997). Symbolic chemical system based on abstract rewriting system and its behavior pattern, Artificial Life and Robotics, 1:4, (211-219), Online publication date: 1-Dec-1997.
- Berry D and Weber M A pragmatic, rigorous integration of structural and behavioral modeling notations Proceedings of the 1st International Conference on Formal Engineering Methods
- Belli F and Dreyer J Program Segmentation for Controlling Test Coverage Proceedings of the Eighth International Symposium on Software Reliability Engineering
- Zhou L, Rundensteiner E and Shin K (1997). Schema Evolution of an Object-Oriented Real-Time Database System for Manufacturing Automation, IEEE Transactions on Knowledge and Data Engineering, 9:6, (956-977), Online publication date: 1-Nov-1997.
- Palopoli L and Torlone R (1997). Generalized Production Rules as a Basis for Integrating Active and Deductive Databases, IEEE Transactions on Knowledge and Data Engineering, 9:6, (848-862), Online publication date: 1-Nov-1997.
- Münke M, Lamersdorf W, Christiansen B and Müller-Jones K Type Management Proceedings of the 1st International Conference on Enterprise Distributed Object Computing, (78-89)
- Lorenz D (1997). Tiling design patterns—a case study using the interpreter pattern, ACM SIGPLAN Notices, 32:10, (206-217), Online publication date: 9-Oct-1997.
- Lorenz D Tiling design patterns—a case study using the interpreter pattern Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (206-217)
- Narendran P and Otto F (1997). Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories, Journal of Automated Reasoning, 19:1, (87-115), Online publication date: 1-Aug-1997.
- Noguet D A massively parallel implementation of the watershed based on cellular automata Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
- Marcoux Y and Sévigny M Querying hierarchical text and acyclic hypertext with generalized context-free grammars Computer-Assisted Information Searching on Internet, (546-561)
- Fortnow L Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Karg C LR(k) Testing is Average Case Complete Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Regan K Polynomial Vicinity Circuits and Nonlinear Lower Bounds Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Vollmer H and Wagner K On Operators of Higher Types Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Buhrman H, Fortnow L and Torenvliet L Six Hypotheses in Search of a Theorem Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Lange K, McKenzie P and Tapp A Reversible Space Equals Deterministic Space Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Liu T, Sajid K, Aziz A and Singhal V Optimizing designs containing black boxes Proceedings of the 34th annual Design Automation Conference, (113-116)
- Mohri M (1997). Finite-state transducers in language and speech processing, Computational Linguistics, 23:2, (269-311), Online publication date: 1-Jun-1997.
- Atzeni P and Mecca G Cut and paste Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (144-153)
- Abiteboul S and Vianu V Regular path queries with constraints Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (122-133)
- Mäkinen E and Ţiplea F (1997). Pattern Ambiguities for Pure Context—Free Grammars, Fundamenta Informaticae, 30:2, (183-191), Online publication date: 1-Apr-1997.
- Bazzi R, Neiger G and Peterson G (1997). On the use of registers in achieving wait-free consensus, Distributed Computing, 10:3, (117-127), Online publication date: 1-Apr-1997.
- Abiteboul S, Vardi M and Vianu V (1997). Fixpoint logics, relational machines, and computational complexity, Journal of the ACM, 44:1, (30-56), Online publication date: 15-Jan-1997.
- Swamy G Formal Verification of Digital Systems Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
- Burkart O (1997). Automatic verification of sequential infinite-state processes, 10.5555/1744266, Online publication date: 1-Jan-1997.
- Nakayama K, Yamaguchi K and Kawai S I-regular expression Proceedings of the sixth international conference on Information and knowledge management, (40-50)
- Buchsbaum A and Giancarlo R (1997). Algorithmic aspects in speech recognition, ACM Journal of Experimental Algorithmics, 2, (1-es), Online publication date: 1-Jan-1997.
- Rus D and Subramanian D (1997). Customizing information capture and access, ACM Transactions on Information Systems, 15:1, (67-101), Online publication date: 1-Jan-1997.
- Giammarresi D and Restivo A (1996). TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY, Fundamenta Informaticae, 25:3,4, (399-422), Online publication date: 1-Dec-1996.
- Drewes F and Kreowski H (1996). (UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE GRAMMARS, Fundamenta Informaticae, 25:3,4, (295-325), Online publication date: 1-Dec-1996.
- Olstad B and Torp A (1996). Encoding of a priori Information in Active Contour Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:9, (863-872), Online publication date: 1-Sep-1996.
- Han Y and Hemaspaandra L (1996). Pseudorandom generators and the frequency of simplicity, Journal of Cryptology, 9:4, (251-261), Online publication date: 1-Sep-1996.
- Sima'an K Computational complexity of probabilistic disambiguation by means of tree-grammars Proceedings of the 16th conference on Computational linguistics - Volume 2, (1175-1180)
- Vogel C, Hahn U and Branigan H Cross-serial dependencies are not hard to process Proceedings of the 16th conference on Computational linguistics - Volume 1, (157-162)
- Bacchus F, Boutilier C and Grove A Rewarding behaviors Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2, (1160-1167)
- Wanke E (1996). Undecidability of restricted uniform recurrence equations, Acta Informatica, 33:5, (463-475), Online publication date: 1-Aug-1996.
- Heilbrunner S (1996). A direct complement construction forLR(1) grammars, Acta Informatica, 33:5, (781-797), Online publication date: 1-Aug-1996.
- Tiuryn J and Urzyczyn P The Subtyping Problem for Second-Order Types is Undecidable Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- Bergadano F, Catalano D and Varricchio S Learning Sat-k-DNF formulas from membership queries Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (126-130)
- Wieringa R and Saake G (1996). Formal analysis of the Shlaer-Mellor method, Requirements Engineering, 1:2, (106-131), Online publication date: 1-Jun-1996.
- Atlee J and Buckley M A logic-model semantics for SCR software requirements Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis, (280-292)
- Atlee J and Buckley M (1996). A logic-model semantics for SCR software requirements, ACM SIGSOFT Software Engineering Notes, 21:3, (280-292), Online publication date: 1-May-1996.
- Omlin C and Lee Giles C (1996). Rule Revision With Recurrent Neural Networks, IEEE Transactions on Knowledge and Data Engineering, 8:1, (183-188), Online publication date: 1-Feb-1996.
- Jain S and Sharma A Elementary formal systems, intrinsic complexity, and procrastination Proceedings of the ninth annual conference on Computational learning theory, (181-192)
- Baliga G, Case J and Jain S Synthesizing enumeration techniques for language learning Proceedings of the ninth annual conference on Computational learning theory, (169-180)
- Yücesan E and Jacobson S (1996). Computational issues for accessibility in discrete event simulation, ACM Transactions on Modeling and Computer Simulation, 6:1, (53-75), Online publication date: 1-Jan-1996.
- Bala V and Rubin N Efficient instruction scheduling using finite state automata Proceedings of the 28th annual international symposium on Microarchitecture, (46-56)
- Aziz A, Balarin F, Brayton R and Sangiovanni-Vincentelli A Sequential synthesis using S1S Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, (612-617)
- Gabler T and März-Rössel S An approach to guided incremental specification Proceedings of the conference on European design automation, (368-373)
- Yücesan E and Jacobson S On the simultaneous construction of sample paths Proceedings of the 27th conference on Winter simulation, (357-361)
- Fishwick P Simulation model design Proceedings of the 27th conference on Winter simulation, (209-211)
- Kremer S Finite state automata that recurrent cascade-correlation cannot represent Proceedings of the 9th International Conference on Neural Information Processing Systems, (612-618)
- Sane A and Campbell R (1995). Object-oriented state machines, ACM SIGPLAN Notices, 30:10, (17-32), Online publication date: 17-Oct-1995.
- Sane A and Campbell R Object-oriented state machines Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications, (17-32)
- Hoffman D and Strooper P (1995). State abstraction and modular software development, ACM SIGSOFT Software Engineering Notes, 20:4, (53-61), Online publication date: 1-Oct-1995.
- Hoffman D and Strooper P State abstraction and modular software development Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, (53-61)
- Bourdeau R and Cheng B (1995). A Formal Semantics for Object Model Diagrams, IEEE Transactions on Software Engineering, 21:10, (799-821), Online publication date: 1-Oct-1995.
- Breslauer D and Galil Z (1995). Finding all periods and initial palindromes of a string in parallel, Algorithmica, 14:4, (355-366), Online publication date: 1-Oct-1995.
- On Reachability Analysis of Communicating Finite State Machines Proceedings of the 4th International Conference on Computer Communications and Networks
- Gabarró J and Serna M (1995). Rational Processes And Linear Systems In Gsp, Fundamenta Informaticae, 24:3, (283-302), Online publication date: 1-Aug-1995.
- Reif J Parallel molecular computation Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, (213-223)
- Dobkin D and Gunopulos D Concept learning with geometric hypotheses Proceedings of the eighth annual conference on Computational learning theory, (329-336)
- Beaudry M and Mckenzie P (1995). Circuits, Matrices, and Nonassociative Computation, Journal of Computer and System Sciences, 50:3, (441-455), Online publication date: 1-Jun-1995.
- Hellerstein L, Raghavan V, Pillaipakkamnatt K and Wilkins D How many queries are needed to learn? Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (190-199)
- Wood P Magic factoring of closure programs (extended abstract) Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (174-183)
- Wilson R (1995). Integrating a breadth-first curriculum with relevant programming projects in CS1/CS2, ACM SIGCSE Bulletin, 27:1, (214-217), Online publication date: 15-Mar-1995.
- Wilson R Integrating a breadth-first curriculum with relevant programming projects in CS1/CS2 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (214-217)
- Corno F, Cusinato M, Ferrero M and Prinetto P Proving testing preorders for process algebra descriptions Proceedings of the 1995 European conference on Design and Test
- Cheung B Ambiguity in context-free grammars Proceedings of the 1995 ACM symposium on Applied computing, (272-276)
- Bailey M and Davidson J A formal model and specification language for procedure calling conventions Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (298-310)
- Brookes S and Dancanet D Sequential algorithms, deterministic parallelism, and intensional expressiveness Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (13-24)
- Kannan S, Sweedyk Z and Mahaney S Counting and random generation of strings in regular languages Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, (551-557)
- Kambhampati S (1995). A comparative analysis of partial order planning and task reduction planning, ACM SIGART Bulletin, 6:1, (16-25), Online publication date: 11-Jan-1995.
- Mellier P and Grize F (1995). OVIDE, ACM SIGPLAN Notices, 30:1, (53-61), Online publication date: 3-Jan-1995.
- Donald B (1995). On information invariants in robotics, Artificial Intelligence, 72:1-2, (217-304), Online publication date: 1-Jan-1995.
- Fishwick P Simulation model design Proceedings of the 26th conference on Winter simulation, (173-175)
- Zhang D and Nguyen D (1994). PREPARE, IEEE Transactions on Knowledge and Data Engineering, 6:6, (983-989), Online publication date: 1-Dec-1994.
- Balarin F and Sangiovanni-Vincentelli A Iterative algorithms for formal verification of embedded real-time systems Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, (450-457)
- Nestor J and Lee E Prerequisite confidentiality Proceedings of the 2nd ACM Conference on Computer and communications security, (282-293)
- Whittaker J and Thomason M (1994). A Markov Chain Model for Statistical Software Testing, IEEE Transactions on Software Engineering, 20:10, (812-824), Online publication date: 1-Oct-1994.
- Lin B, Ykman-Couvreur C and Vanbekbergen P A general state graph transformation framework for asynchronous synthesis Proceedings of the conference on European design automation, (448-453)
- Buchenrieder K and Veith C 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, (60-65)
- Regan K and Wang J (1994). The quasilinear isomorphism challenge, ACM SIGACT News, 25:3, (106-113), Online publication date: 1-Sep-1994.
- Borowsky E, Gafni E and Afek Y Consensus power makes (some) sense! (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, (363-372)
- Brit H and Moran S Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, (52-60)
- Gerdemann D Parsing as tree traversal Proceedings of the 15th conference on Computational linguistics - Volume 1, (396-400)
- Kiraz G Multi-tape two-level morphology Proceedings of the 15th conference on Computational linguistics - Volume 1, (180-186)
- Erol K, Hendler J and Nau D HTN planning Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (1123-1128)
- Hummel J, Hendren L and Nicolau A A general data dependence test for dynamic, pointer-based data structures Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (218-229)
- Du M and Chang S (1994). An Approach to Designing Very Fast Approximate String Matching Algorithms, IEEE Transactions on Knowledge and Data Engineering, 6:4, (620-633), Online publication date: 1-Aug-1994.
- Jain S and Sharma A On the intrinsic complexity of language identification Proceedings of the seventh annual conference on Computational learning theory, (278-286)
- Balcázar J, Díaz J, Gavaldà R and Watanabe O An optimal parallel algorithm for learning DFA Proceedings of the seventh annual conference on Computational learning theory, (208-217)
- Aziz A, Taşiran S and Brayton R BDD variable ordering for interacting finite state machines Proceedings of the 31st annual Design Automation Conference, (283-288)
- Lam W, Brayton R and Sangiovanni-Vincentelli A Exact minimum cycle times for finite state machines Proceedings of the 31st annual Design Automation Conference, (100-105)
- Puri R and Gu J A modular partitioning approach for asynchronous circuit synthesis Proceedings of the 31st annual Design Automation Conference, (63-69)
- Hummel J, Hendren L and Nicolau A (1994). A general data dependence test for dynamic, pointer-based data structures, ACM SIGPLAN Notices, 29:6, (218-229), Online publication date: 1-Jun-1994.
- Seawright A and Brewer F (1994). Clairvoyant, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2:2, (172-185), Online publication date: 1-Jun-1994.
- Paul S and Prakash A (1994). A Framework for Source Code Search Using Program Patterns, IEEE Transactions on Software Engineering, 20:6, (463-475), Online publication date: 1-Jun-1994.
- Suciu D and Paredaens J 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, (201-209)
- Chaudhuri S and Vardi M 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, (107-116)
- Fortnow L and Whang D Optimality and domination in repeated games with bounded players Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (741-749)
- Condon A, Hellerstein L, Pottle S and Wigderson A On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (676-685)
- Cheung S and Kramer J An integrated method for effective behaviour analysis of distributed systems Proceedings of the 16th international conference on Software engineering, (309-320)
- Puri R and Gu J A divide-and-conquer approach for asynchronous interface synthesis Proceedings of the 7th international symposium on High-level synthesis, (118-125)
- Lagarias J and Shor P (1994). Cube-tilings of źn and nonlinear codesand nonlinear codes, Discrete & Computational Geometry, 11:4, (359-391), Online publication date: 1-Apr-1994.
- Friedman N and Halpern J A knowledge-based framework for belief change part I Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge, (44-64)
- Pattis R (1994). Teaching EBNF first in CS 1, ACM SIGCSE Bulletin, 26:1, (300-303), Online publication date: 12-Mar-1994.
- Pattis R Teaching EBNF first in CS 1 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (300-303)
- Bird S and Ellison T (1994). One-level phonology, Computational Linguistics, 20:1, (55-90), Online publication date: 1-Mar-1994.
- Matos A (1994). An introduction to ultimately periodic sets of integers, ACM SIGACT News, 25:1, (90-96), Online publication date: 1-Mar-1994.
- Lustman F (1994). Specifying Transaction-Based Information Systems with Regular Expressions, IEEE Transactions on Software Engineering, 20:3, (207-217), Online publication date: 1-Mar-1994.
- Luo G, von Bochmann G and Petrenko A (1994). Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method, IEEE Transactions on Software Engineering, 20:2, (149-162), Online publication date: 1-Feb-1994.
- Vanbekbergen P, Lin B, Goossens G and Man H (1994). A generalized state assignment theory for transformations on signal transition graphs, Journal of VLSI Signal Processing Systems, 7:1-2, (101-115), Online publication date: 1-Feb-1994.
- Jeuring J (1994). The derivation of on-line algorithms, with an application to finding palindromes, Algorithmica, 11:2, (146-184), Online publication date: 1-Feb-1994.
- Higashino T and Bochmann G (1994). Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters, IEEE Transactions on Software Engineering, 20:1, (29-42), Online publication date: 1-Jan-1994.
- Müller T Employing finite automata for resource scheduling Proceedings of the 26th annual international symposium on Microarchitecture, (12-20)
- Cheung S and Kramer J Enhancing compositional reachability analysis with context constraints Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, (115-125)
- Rus D and Subramanian D Multi-media RISC informatics Proceedings of the second international conference on Information and knowledge management, (283-294)
- Cheung S and Kramer J (1993). Enhancing compositional reachability analysis with context constraints, ACM SIGSOFT Software Engineering Notes, 18:5, (115-125), Online publication date: 1-Dec-1993.
- Kolen J Fool's gold Proceedings of the 7th International Conference on Neural Information Processing Systems, (501-508)
- Jing H, Das A and Chung M (1993). Linear recursive networks and their applications in topological design and data routing, ACM SIGCOMM Computer Communication Review, 23:4, (249-257), Online publication date: 1-Oct-1993.
- Regan K (1993). Machine models and linear time complexity, ACM SIGACT News, 24:3, (5-15), Online publication date: 1-Oct-1993.
- Jing H, Das A and Chung M Linear recursive networks and their applications in topological design and data routing Conference proceedings on Communications architectures, protocols and applications, (249-257)
- Wu P and Wang F (1993). Applying classification and inheritance into compiling, ACM SIGPLAN OOPS Messenger, 4:4, (33-43), Online publication date: 1-Oct-1993.
- Lin T Concurrent automata, database computers, and security Proceedings on the 1992-1993 workshop on New security paradigms, (94-104)
- Jain S and Sharma A Probability is more powerful than team for language identification from positive data Proceedings of the sixth annual conference on Computational learning theory, (192-198)
- Kilian J and Siegelmann H On the power of sigmoid neural networks Proceedings of the sixth annual conference on Computational learning theory, (137-143)
- Wu J and Li L The regular problem and green equivalences for special monoids Proceedings of the 1993 international symposium on Symbolic and algebraic computation, (78-85)
- Ahonen H, Mannila H and Nikunen E Forming grammars for structured documents Proceedings of the 2nd International Conference on Knowledge Discovery in Databases, (314-325)
- Kupiec J MURAX Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, (181-190)
- Seawright A and Brewer F High-level symbolic construction technique for high performance sequential synthesis Proceedings of the 30th international Design Automation Conference, (424-428)
- Krieger H, Pirker H and Nerbonne J Feature-based allomorphy Proceedings of the 31st annual meeting on Association for Computational Linguistics, (140-147)
- Jones N Constant time factors do matter Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (602-611)
- Impagliazzo R, Paturi R and Saks M Size-depth trade-offs for threshold circuits Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (541-550)
- Lieberherr K and Xiao C (1993). Formal Foundations for Object-Oriented Data Modeling, IEEE Transactions on Knowledge and Data Engineering, 5:3, (462-478), Online publication date: 1-Jun-1993.
- Hemaspaandra L (1993). Lowness, ACM SIGACT News, 24:2, (10-14), Online publication date: 1-Apr-1993.
- Lieberherr K and Xiao C (1993). Object-Oriented Software Evolution, IEEE Transactions on Software Engineering, 19:4, (313-343), Online publication date: 1-Apr-1993.
- Yamazaki K The generating power of the boundary NLC graph grammars Proceedings of the 1993 ACM conference on Computer science, (404-409)
- Codish M, Debray S and Giacobazzi R Compositional analysis of modular logic programs Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (451-464)
- Kozen D, Palsberg J and Schwartzbach M Efficient recursive subtyping Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (419-428)
- Cleaveland R and Hennessy M (2022). Testing equivalence as a bisimulation equivalence, Formal Aspects of Computing, 5:1, (1-20), Online publication date: 1-Jan-1993.
- Yücesan E and Jacobson S Building correct simulation models is difficult Proceedings of the 24th conference on Winter simulation, (783-790)
- Smolensky P Harmonic grammars for formal languages Proceedings of the 6th International Conference on Neural Information Processing Systems, (847-854)
- Das S, Giles C and Sun G Using prior knowledge in a NNPDA to learn context-free languages Proceedings of the 6th International Conference on Neural Information Processing Systems, (65-72)
- Stolcke A and Omohundro S Hidden Markov model induction by Bayesian model merging Proceedings of the 6th International Conference on Neural Information Processing Systems, (11-18)
- Vanbekbergen P, Lin B, Goosens G and De Man H A generalized state assignment theory for transformation on signal transition graphs Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, (112-117)
- Wu S and Manber U (1992). Fast text searching, Communications of the ACM, 35:10, (83-91), Online publication date: 1-Oct-1992.
- Lin-Kriz Y and Pan V On parallel complexity of integer linear programming, GCD and the iterated mod function Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (124-137)
- Mark L and Cochrane R (1992). Grammars and Relations, IEEE Transactions on Software Engineering, 18:9, (840-849), Online publication date: 1-Sep-1992.
- Kese R, Dudda F and Kugler M Automatic proofreading of frozen phrases in German Proceedings of the 14th conference on Computational linguistics - Volume 3, (1029-1033)
- Kese R, Dudda F and Kugler M Automatic proofreading of frozen phrases in German Proceedings of the 14th conference on Computational linguistics - Volume 3, (1029-1033)
- Seawright A and Brewer F Synthesis from production-based specifications Proceedings of the 29th ACM/IEEE Design Automation Conference, (194-199)
- Bonner A The complexity of reusing and modifying rulebases Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (316-330)
- Siegelmann H and Sontag E On the computational power of neural nets Proceedings of the fifth annual workshop on Computational learning theory, (440-449)
- Case J, Jain S and Sharma A On learning limiting programs Proceedings of the fifth annual workshop on Computational learning theory, (193-202)
- Cohen W and Hirsh H Learnability of description logics Proceedings of the fifth annual workshop on Computational learning theory, (116-127)
- Sipser M The history and status of the P versus NP question Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (603-618)
- Cai J Parallel computation over hyperbolic groups Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (106-115)
- Hannay D (1992). Hypercard automata simulation, ACM SIGCSE Bulletin, 24:2, (55-58), Online publication date: 1-Jun-1992.
- Clote P (1992). A time-space hierarchy between polynomial time and polynomial space, Mathematical Systems Theory, 25:2, (77-92), Online publication date: 1-Jun-1992.
- O'Connor L and Snider T Suffix trees and string complexity Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques, (138-152)
- Wu P, Wang F and Young K An object-oriented specification and its generation for compiler Proceedings of the 1992 ACM annual conference on Communications, (323-330)
- Wu P, Wang F and Young K (1992). Scanning regular languages by dual finite automata, ACM SIGPLAN Notices, 27:4, (12-16), Online publication date: 1-Apr-1992.
- Kese R, Dudda F, Heyer G and Kugler M Extended spelling correction for German Proceedings of the third conference on Applied natural language processing, (126-132)
- Fellah A and Yu S Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, (1159-1166)
- Pierce B Bounded quantification is undecidable Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (305-315)
- Wu P and Wang F (1992). An object-oriented specification for compiler, ACM SIGPLAN Notices, 27:1, (85-94), Online publication date: 1-Jan-1992.
- Giles C, Miller C, Chen D, Sun G, Chen H and Lee Y Extracting and learning an unknown grammar with recurrent neural networks Proceedings of the 5th International Conference on Neural Information Processing Systems, (317-324)
- Bretschneider F, Kopf C and Zolg M Process control for large complex systems Proceedings of the 23rd conference on Winter simulation, (1091-1100)
- Sridhar M and Raghavendra C (1991). Fault-Tolerant Networks Based on the de Bruijn Graph, IEEE Transactions on Computers, 40:10, (1167-1174), Online publication date: 1-Oct-1991.
- Kim S, McNaughton R and McCloskey R (1991). A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata, IEEE Transactions on Computers, 40:10, (1087-1093), Online publication date: 1-Oct-1991.
- Kristol D, Lee D, Netravali A and Sabnani K (1991). Efficient gateway synthesis from formal specifications, ACM SIGCOMM Computer Communication Review, 21:4, (89-97), Online publication date: 1-Aug-1991.
- Kristol D, Lee D, Netravali A and Sabnani K Efficient gateway synthesis from formal specifications Proceedings of the conference on Communications architecture & protocols, (89-97)
- Perlin M LR recursive transition networks for Earley and Tomita parsing Proceedings of the 29th annual meeting on Association for Computational Linguistics, (98-105)
- Rekers J and Koorn W (1991). Substring parsing for arbitrary context-free grammars, ACM SIGPLAN Notices, 26:5, (59-66), Online publication date: 1-May-1991.
- Sidhu D, Chung A and Blumer T (1991). Experience with formal methods in protocol development, ACM SIGCOMM Computer Communication Review, 21:2, (81-101), Online publication date: 1-Apr-1991.
- Hill J and Wayne A (1991). A CYK approach to parsing in parallel: a case study, ACM SIGCSE Bulletin, 23:1, (240-245), Online publication date: 1-Mar-1991.
- Hill J and Wayne A A CYK approach to parsing in parallel: a case study Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (240-245)
- Jaffe M, Leveson N, Heimdahl M and Melhart B (1991). Software Requirements Analysis for Real-Time Process-Control Systems, IEEE Transactions on Software Engineering, 17:3, (241-258), Online publication date: 1-Mar-1991.
- Wolf W Decomposing data machines Proceedings of the conference on European design automation, (378-382)
- Pratt V Modeling concurrency with geometry Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (311-322)
- Henglein F and Mairson H The complexity of type inference for higher-order lambda calculi Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (119-130)
- Hojati R Layout optimization by pattern modification Proceedings of the 27th ACM/IEEE Design Automation Conference, (632-637)
- Spreitzer M Comparing structurally different views of a VLSI design Proceedings of the 27th ACM/IEEE Design Automation Conference, (200-212)
- Ko K Integral equations, systems of quadratic equations, and exponential time completeness Proceedings of the twenty-third annual ACM symposium on Theory of Computing, (10-20)
- Burshteyn B (1990). Generation and recognition of formal languages by modifiable grammars, ACM SIGPLAN Notices, 25:12, (45-53), Online publication date: 1-Dec-1990.
- Ravikumar B (1990). Some applications of a technique of Sakoda and Sipser, ACM SIGACT News, 21:4, (73-77), Online publication date: 1-Nov-1990.
- Sarkar V and Cann D (1990). POSC—a partitioning and optimizing SISAL compiler, ACM SIGARCH Computer Architecture News, 18:3b, (148-164), Online publication date: 1-Sep-1990.
- Shiroshita T (1990). A data processing performance model for the OSI application layer protocols, ACM SIGCOMM Computer Communication Review, 20:4, (60-68), Online publication date: 1-Aug-1990.
- Shiroshita T A data processing performance model for the OSI application layer protocols Proceedings of the ACM symposium on Communications architectures & protocols, (60-68)
- Cohen J (1990). Constraint logic programming languages, Communications of the ACM, 33:7, (52-68), Online publication date: 1-Jul-1990.
- Hemmendinger D (1990). Specifying Ada Server Tasks with Executable Formal Grammars, IEEE Transactions on Software Engineering, 16:7, (741-754), Online publication date: 1-Jul-1990.
- Sarkar V and Cann D POSC—a partitioning and optimizing SISAL compiler Proceedings of the 4th international conference on Supercomputing, (148-164)
- Atallah M, Callahan P and Goodrich M P-complete geometric problems Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (317-326)
- Anderson R, Beame P and Ruzzo W Low overhead parallel schedules for task graphs Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (66-75)
- Saraiya Y (1990). Hard problems for simple logic programs, ACM SIGMOD Record, 19:2, (64-73), Online publication date: 1-May-1990.
- Saraiya Y Hard problems for simple logic programs Proceedings of the 1990 ACM SIGMOD international conference on Management of data, (64-73)
- Kauranen K and Makinen E (1990). A note on Cohen's formal model for computer viruses, ACM SIGSAC Review, 8:2, (40-43), Online publication date: 1-May-1990.
- Harel D, Pnueli A, Lachover H, Naamad A, Politi M, Sherman R, Shtull-Trauring A and Trakhtenbrot M (1990). STATEMATE, IEEE Transactions on Software Engineering, 16:4, (403-414), Online publication date: 1-Apr-1990.
- Hseush W and Kaiser G (1990). Modeling concurrency in parallel debugging, ACM SIGPLAN Notices, 25:3, (11-20), Online publication date: 1-Mar-1990.
- Chapman N (2022). Defining, analysing and implementing communication protocols using attribute grammars, Formal Aspects of Computing, 2:1, (359-392), Online publication date: 1-Mar-1990.
- Hseush W and Kaiser G Modeling concurrency in parallel debugging Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, (11-20)
- Johnsonbaugh R and Miller D Converses of pumping lemmas Proceedings of the twenty-first SIGCSE technical symposium on Computer science education, (27-30)
- Johnsonbaugh R and Miller D (1990). Converses of pumping lemmas, ACM SIGCSE Bulletin, 22:1, (27-30), Online publication date: 1-Feb-1990.
- Lee D and Lochovsky F (1990). HYTREM-A Hybrid Text-Retrieval Machine for Large Databases, IEEE Transactions on Computers, 39:1, (111-123), Online publication date: 1-Jan-1990.
- Savitch W (1989). A formal model for context-free languages augmented with reduplication, Computational Linguistics, 15:4, (250-261), Online publication date: 1-Dec-1989.
- Mairson H Deciding ML typability is complete for deterministic exponential time Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (382-401)
- Schmidt-Schauss M (1989). Unification in permutative equational theories is undecidable, Journal of Symbolic Computation, 8:4, (415-421), Online publication date: 1-Oct-1989.
- Mamrak S, Kaelbling M, Nicholas C and Share M (1989). Chameleon, IEEE Transactions on Software Engineering, 15:9, (1090-1108), Online publication date: 1-Sep-1989.
- Salomon D and Cormack G (1989). Scannerless NSLR(1) parsing of programming languages, ACM SIGPLAN Notices, 24:7, (170-178), Online publication date: 1-Jul-1989.
- Salomon D and Cormack G Scannerless NSLR(1) parsing of programming languages Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (170-178)
- Hull R and Su J On accessing object-oriented databases: expressive power, complexity, and restrictions Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (147-158)
- Hull R and Su J (1989). On accessing object-oriented databases: expressive power, complexity, and restrictions, ACM SIGMOD Record, 18:2, (147-158), Online publication date: 1-Jun-1989.
- Parberry I (1989). A Note on Nondeterminism in Small, Fast Parallel Computers, IEEE Transactions on Computers, 38:5, (766-767), Online publication date: 1-May-1989.
- Bonner A Hypothetical datalog negation and linear recursion Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (286-300)
- Sagiv Y and Vardi M Safety of datalog queries over infinite databases Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (160-171)
- Vardi M Invited talk: automata theory for database theoreticians Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (83-92)
- Lin T Extensions of pushdown automata and Petri nets Proceedings of the 17th conference on ACM Annual Computer Science Conference, (414-414)
- Birget J Proof of a conjecture of R. Kannan Proceedings of the twenty-first annual ACM symposium on Theory of computing, (445-453)
- Pitt L and Warmuth M The minimum consistent DFA problem cannot be approximated within and polynomial Proceedings of the twenty-first annual ACM symposium on Theory of computing, (421-432)
- Afrati F and Cosmadakis S Expressiveness of restricted recursive queries Proceedings of the twenty-first annual ACM symposium on Theory of computing, (113-126)
- Giles C, Sun G, Chen H, Lee Y and Chen D Higher order recurrent networks & grammatical inference Proceedings of the 3rd International Conference on Neural Information Processing Systems, (380-387)
- Culik K and Yu S (1988). The emptiness problem for CA limit sets, Mathematical and Computer Modelling: An International Journal, 11, (363-366), Online publication date: 31-Dec-1988.
- Rothstein J (1988). Bus versus cellular automata, and ultimate limitations of parallel processing, Mathematical and Computer Modelling: An International Journal, 11, (357-362), Online publication date: 31-Dec-1988.
- Jagielski R (1988). Visual simulation of finite state machines, ACM SIGCSE Bulletin, 20:4, (38-40), Online publication date: 1-Dec-1988.
- Schruben L and Yucesan E Simulation graphs Proceedings of the 20th conference on Winter simulation, (504-508)
- Hewett R and Slutzki G (1988). Comparisons between some pumping conditions for context-free languages, Mathematical Systems Theory, 21:1, (223-233), Online publication date: 1-Dec-1988.
- Ibarra O and Ravikumar B (1988). Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties, Mathematical Systems Theory, 21:1, (1-17), Online publication date: 1-Dec-1988.
- Sidhu D and Aristizabal J (1988). Constructing Submodule Specifications and Network Protocols, IEEE Transactions on Software Engineering, 14:11, (1565-1577), Online publication date: 1-Nov-1988.
- Moses Y and Tuttle M (1988). Programming simultaneous actions using common knowledge, Algorithmica, 3:1-4, (121-169), Online publication date: 1-Nov-1988.
- Yonezawa A and Ohsawa I Object-oriented parallel parsing for context-free grammars Proceedings of the 12th conference on Computational linguistics - Volume 2, (773-778)
- Harel D (1988). On visual formalisms, Communications of the ACM, 31:5, (514-530), Online publication date: 1-May-1988.
- Harel D, Lachover H, Naamad A, Pnueli A, Politi M, Sherman R and Shtul-Trauring a Statemate: a working environment for the development of complex reactive systems Proceedings of the 10th international conference on Software engineering, (396-406)
- Ramakrishnan R, Beeri C and Krishnamurthy R Optimizing existential datalog queries Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (89-102)
- Chomicki J and Imieliński T Temporal deductive databases and infinite objects Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (61-73)
- Headington M (1988). Introducing finite automata in the first course, ACM SIGCSE Bulletin, 20:1, (163-167), Online publication date: 1-Feb-1988.
- Headington M Introducing finite automata in the first course Proceedings of the nineteenth SIGCSE technical symposium on Computer science education, (163-167)
- Liu K Extending Earley's context-free parsing algorithm for string pattern matching Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (500-509)
- Bryant B, Edupuganty B, Sundararaghavan K and Takaoka T Two-level grammar Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (469-474)
- Ko K Relativized polynomial time hierarchies having exactly K levels Proceedings of the twentieth annual ACM symposium on Theory of computing, (245-253)
- Cohen J (1988). A view of the origins and development of Prolog, Communications of the ACM, 31:1, (26-36), Online publication date: 1-Jan-1988.
- Schruben L A “disposable” graphical event synthesizer for teaching simulation model building Proceedings of the 19th conference on Winter simulation, (72-76)
- Karlin A, Trickey H and Ullman J (1987). Algorithms for the compilation of regular expressions into PLAs, Algorithmica, 2:1-4, (283-314), Online publication date: 1-Nov-1987.
- Cai J and Paige R Binding performance at language design time Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (85-97)
- Devadas S, Ma H and Newton A On the verification of sequential machines at differing levels of abstraction Proceedings of the 24th ACM/IEEE Design Automation Conference, (271-276)
- Alpern B and Schneider F (1987). Recognizing safety and liveness, Distributed Computing, 2:3, (117-126), Online publication date: 1-Sep-1987.
- Moshier M and Rounds W On the succinctness properties of unordered context-free grammars Proceedings of the 25th annual meeting on Association for Computational Linguistics, (112-116)
- Beeri C, Kanellakis P, Bancilhon F and Ramakrishnan R Bounds on the propagation of selection into logic programs Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (214-226)
- Hill R Event-response systems Proceedings of the SIGCHI/GI Conference on Human Factors in Computing Systems and Graphics Interface, (241-248)
- Williams K and Meybodi M (1987). Representing problems as string transformations, ACM SIGACT News, 18:3, (29-30), Online publication date: 1-Apr-1987.
- Hill R (1986). Event-response systems, ACM SIGCHI Bulletin, 18:4, (241-248), Online publication date: 1-Apr-1987.
- Mills J (1987). Coming to grips with a RISC: a report of the progress of the LOW RISC design group, ACM SIGARCH Computer Architecture News, 15:1, (53-62), Online publication date: 1-Mar-1987.
- Allender E Some consequences of the existence of pseudorandom generators Proceedings of the nineteenth annual ACM symposium on Theory of computing, (151-159)
- Hemachandra L The strong exponential hierarchy collapses Proceedings of the nineteenth annual ACM symposium on Theory of computing, (110-122)
- Maass W, Schnitger G and Szemeredi E Two tapes are better than one for off-line Turing machines Proceedings of the nineteenth annual ACM symposium on Theory of computing, (94-100)
- Kuo Y and Kung L (1986). Algorithmic state machine implementation with hybrid microprocessing/microprogramming scheme, ACM SIGMICRO Newsletter, 17:4, (54-67), Online publication date: 21-Dec-1986.
- McKay K, Buzacott J, Moore J and Strang C Software engineerng applied to discrete event simulations Proceedings of the 18th conference on Winter simulation, (485-493)
- Kuo Y and Kung L Algorithmic state machine implementation with hybrid microprocessing/microprogramming scheme Proceedings of the 19th annual workshop on Microprogramming, (54-67)
- Mansour Y and Zaks S 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, (151-160)
- Lee D (1986). ALTEP — A cellular processor for high-speed pattern matching, New Generation Computing, 4:3, (225-244), Online publication date: 1-Sep-1986.
- Supowit K and Friedman S A new method for verifying sequential circuits Proceedings of the 23rd ACM/IEEE Design Automation Conference, (200-207)
- Huang S and Tripathi S (1986). Finite State Model and Compatibility Theory, IEEE Transactions on Computers, 35:7, (591-601), Online publication date: 1-Jul-1986.
- Ibarra O, Kim S and Palis M (1986). Designing systolic algorithms using sequential machines, IEEE Transactions on Computers, 35:6, (531-542), Online publication date: 10-Jun-1986.
- Hill R (1986). Event-response systems, ACM SIGCHI Bulletin, 17:SI, (241-248), Online publication date: 1-May-1986.
- Megiddo N and Wigderson A On play by means of computing machines Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, (259-274)
- Halpern J Reasoning about knowledge Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, (1-17)
- Dixon R and Hemmendinger D Analyzing synchronization problems by using event histories as languages Proceedings of the 1986 ACM fourteenth annual conference on Computer science, (183-188)
- Huynh D 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, (405-412)
- Cosmadakis S and Kanellakis P Equational theories and database constraints Proceedings of the seventeenth annual ACM symposium on Theory of computing, (273-284)
- Gazdar G and Pullum G (1985). Computationally relevant properties of natural languages and their grammars, New Generation Computing, 3:3, (273-306), Online publication date: 1-Sep-1985.
- Halpern J and Moses Y A guide to the modal logics of knowledge and belief Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1, (480-490)
- Cosmadakis S and Kanellakis P Parallel evaluation of recursive rule queries Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, (280-293)
- Hurson A and Shirazi S The design of a hardware recognizer for utilization in scanning operations Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, (112-119)
- Ponder C and Patt Y Alternative proposals for implementing Prolog concurrently and implications regarding their respective microarchitectures Proceedings of the 17th annual workshop on Microprogramming, (192-203)
- Ponder C and Patt Y (1984). Alternative proposals for implementing Prolog concurrently and implications regarding their respective microarchitectures, ACM SIGMICRO Newsletter, 15:4, (192-203), Online publication date: 1-Dec-1984.
- Loka R (1984). A note on parallel parsing, ACM SIGPLAN Notices, 19:7, (22-24), Online publication date: 1-Jul-1984.
- Nix R Editing by example Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (186-195)
- Loka R (1984). A note on parallel parsing, ACM SIGPLAN Notices, 19:1, (57-59), Online publication date: 1-Jan-1984.
- Kegley R and Boggess L 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, (310-313)
- Iwama K Unique decomposability of shuffled strings Proceedings of the fifteenth annual ACM symposium on Theory of computing, (374-381)
- Engelfriet J Iterated pushdown automata and complexity classes Proceedings of the fifteenth annual ACM symposium on Theory of computing, (365-373)
- Myers D The random access hierarchy Proceedings of the fifteenth annual ACM symposium on Theory of computing, (355-364)
- Kannan R Alternation and the power of nondeterminism Proceedings of the fifteenth annual ACM symposium on Theory of computing, (344-346)
- Weinman J (1983). Nestable bracketed comments, ACM SIGPLAN Notices, 18:10, (44-47), Online publication date: 1-Oct-1983.
- Bergstra J and Klop J (1983). A proof rule for restoring logic circuits, Integration, the VLSI Journal, 1:2-3, (161-178), Online publication date: 1-Oct-1983.
- Kanellakis P and Smolka S CCS expressions, finite state processes, and three problems of equivalence Proceedings of the second annual ACM symposium on Principles of distributed computing, (228-240)
- Perrault C On the mathematical properties of linguistic theories Proceedings of the 21st annual meeting on Association for Computational Linguistics, (98-105)
- Lee E Applications of fuzzy languages and pictorial databases to decision support systems design Proceedings of the May 16-19, 1983, national computer conference, (437-451)
- Haskin R and Hollaar L (1983). Operational characteristics of a harware-based pattern matcher, ACM Transactions on Database Systems, 8:1, (15-40), Online publication date: 1-Mar-1983.
- Chua Y and Winton C An upper level computer science curriculum Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (77-81)
- Chua Y and Winton C (1983). An upper level computer science curriculum, ACM SIGCSE Bulletin, 15:1, (77-81), Online publication date: 1-Feb-1983.
- Yamaguchi K and Kunil T (1982). PICCOLO Logic for a Picture Database Computer and Its Implementation, IEEE Transactions on Computers, 31:10, (983-996), Online publication date: 1-Oct-1982.
- Auwera Y and Bernard L (1982). New proposal for a common command language in information systems, ACM SIGMOD Record, 13:1, (51-78), Online publication date: 1-Sep-1982.
- Mandrioli D (1982). On teaching theoretical foundations of Computer Science, ACM SIGACT News, 14:4, (58-69), Online publication date: 1-Sep-1982.
- Fürer M The tight deterministic time hierarchy Proceedings of the fourteenth annual ACM symposium on Theory of computing, (8-16)
- Teel B and Wilde D A logic minimizer for VLSI PLA design Proceedings of the 19th Design Automation Conference, (156-162)
- Walsh T (1982). The busy beaver on a one-way infinite tape, ACM SIGACT News, 14:1, (38-43), Online publication date: 1-Jan-1982.
- Berwick R Computational complexity and lexical functional grammar Proceedings of the 19th annual meeting on Association for Computational Linguistics, (7-12)
- Adachi A, Iwata S and Kasai T Low level complexity for combinatorial games Proceedings of the thirteenth annual ACM symposium on Theory of computing, (228-237)
- Monien B and Sudborough I Bandwidth constrained NP-Complete problems Proceedings of the thirteenth annual ACM symposium on Theory of computing, (207-217)
- Ukkonen E and Soisalon-Soininen E LALR(k) testing is PSPACE-complete Proceedings of the thirteenth annual ACM symposium on Theory of computing, (202-206)
- Simon J Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version) Proceedings of the thirteenth annual ACM symposium on Theory of computing, (158-167)
- Chan T Reversal complexity of counter machines Proceedings of the thirteenth annual ACM symposium on Theory of computing, (146-157)
- Muller D and Schupp P Pushdown automata, graphs, ends, second-order logic, and reachability problems Proceedings of the thirteenth annual ACM symposium on Theory of computing, (46-54)
- Ibarra O and Leininger B The complexity of the equivalence problem for straight-line programs Proceedings of the twelfth annual ACM symposium on Theory of computing, (273-280)
- Ukkonen E 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, (29-38)
- Cargal J Social relations as algebraic relations Proceedings of the 12th conference on Winter simulation, (139-153)
- Martin T and Azvine B A virtual machine for event sequence identification using fuzzy tolerance 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), (1080-1087)
Index Terms
- Introduction To Automata Theory, Languages, And Computation
Recommendations
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications VLimited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...