Introduction To Automata Theory, Languages, And Computation

Authors:
John E. Hopcroft;Jeffrey D. Ullman
Affiliations:
-;-
Venue:
Introduction To Automata Theory, Languages, And Computation
Year:
1990

Citing 0
Cited 1641

A distributed alternative to finite-state-machine specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Access methods for text

ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Editing by example

ACM Transactions on Programming Languages and Systems (TOPLAS)
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness

Journal of the ACM (JACM) - The MIT Press scientific computation series
Designing systolic algorithms using sequential machines

IEEE Transactions on Computers - The MIT Press scientific computation series
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks

IEEE Transactions on Computers
On the bit complexity of distributed computations in a ring with a leader

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Parallel evaluation of recursive rule queries

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Algorithmic state machine implementation with hybrid microprocessing/microprogramming scheme

MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
Equational theories and database constraints

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Representing problems as string transformations

ACM SIGACT News
Two tapes are better than one for off-line Turing machines

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The strong exponential hierarchy collapses

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Some consequences of the existence of pseudorandom generators

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Bounds on the propagation of selection into logic programs

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A view of the origins and development of Prolog

Communications of the ACM
On the verification of sequential machines at differing levels of abstraction

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Binding performance at language design time

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
On visual formalisms

Communications of the ACM
Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
On the power of one-way communication

Journal of the ACM (JACM)
Analysis of functional programs to detect run-time garbage cells

ACM Transactions on Programming Languages and Systems (TOPLAS)
Pseudo-natural algorithms for finitely generated presentations of monoids and groups

Journal of Symbolic Computation
Introducing finite automata in the first course

SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Visual simulation of finite state machines

ACM SIGCSE Bulletin
Constructing Submodule Specifications and Network Protocols

IEEE Transactions on Software Engineering
Statemate: a working environment for the development of complex reactive systems

ICSE '88 Proceedings of the 10th international conference on Software engineering
Probabilistic inductive inference

Journal of the ACM (JACM)
Relativized polynomial time hierarchies having exactly K levels

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Difficulties in parsing SGML

DOCPROCS '88 Proceedings of the ACM conference on Document processing systems
On accessing object-oriented databases: expressive power, complexity, and restrictions

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A Note on Nondeterminism in Small, Fast Parallel Computers

IEEE Transactions on Computers
On equational theories, unification, and (Un)decidability

Journal of Symbolic Computation
The family of concurrent logic programming languages

ACM Computing Surveys (CSUR)
Expressiveness of restricted recursive queries

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The minimum consistent DFA problem cannot be approximated within and polynomial

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proof of a conjecture of R. Kannan

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Invited talk: automata theory for database theoreticians

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety of datalog queries over infinite databases

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypothetical datalog negation and linear recursion

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Scannerless NSLR(1) parsing of programming languages

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Chameleon: A System for Solving the Data-Translation Problem

IEEE Transactions on Software Engineering
Unification in permutative equational theories is undecidable

Journal of Symbolic Computation
P-uniform circuit complexity

Journal of the ACM (JACM)
STATEMATE: A Working Environment for the Development of Complex Reactive Systems

IEEE Transactions on Software Engineering
Automated Test Case Generation for Programs Specified by Relational Algebra Queries

IEEE Transactions on Software Engineering
HYTREM-A Hybrid Text-Retrieval Machine for Large Databases

IEEE Transactions on Computers
Compression, information theory, and grammars: a unified approach

ACM Transactions on Information Systems (TOIS)
Constraint logic programming languages

Communications of the ACM
A formal model for context-free languages augmented with reduplication

Computational Linguistics
Specifying Ada Server Tasks with Executable Formal Grammars

IEEE Transactions on Software Engineering
Hard problems for simple logic programs

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Deciding ML typability is complete for deterministic exponential time

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Low overhead parallel schedules for task graphs

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
P-complete geometric problems

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Modeling concurrency in parallel debugging

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
A data processing performance model for the OSI application layer protocols

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
The complexity of type inference for higher-order lambda calculi

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modeling concurrency with geometry

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A note on Cohen's formal model for computer viruses

ACM SIGSAC Review
Some applications of a technique of Sakoda and Sipser

ACM SIGACT News
Chain Reactions in Networks

Computer
Integral equations, systems of quadratic equations, and exponential time completeness

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient simulation of finite automata by neural nets

Journal of the ACM (JACM)
A CYK approach to parsing in parallel: a case study

SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Efficient gateway synthesis from formal specifications

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
On key distribution systems

CRYPTO '89 Proceedings on Advances in cryptology
Generation and recognition of formal languages by modifiable grammars

ACM SIGPLAN Notices
Substring parsing for arbitrary context-free grammars

ACM SIGPLAN Notices
Comparing structurally different views of a VLSI design

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Layout optimization by pattern modification

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
AUTOMATE, a computing package for automata and finite semigroups

Journal of Symbolic Computation
The Formal Description and Verification of Hardware Timing

IEEE Transactions on Computers
Parallel computation over hyperbolic groups

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Learnability of description logics

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On learning limiting programs

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the computational power of neural nets

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An object-oriented specification for compiler

ACM SIGPLAN Notices
Hypercard automata simulation: finite-state, pushdown and Turing machines

ACM SIGCSE Bulletin
An object-oriented specification and its generation for compiler

CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Fast text searching: allowing errors

Communications of the ACM
Gross motion planning—a survey

ACM Computing Surveys (CSUR)
The complexity of reusing and modifying rulebases

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The minimum consistent DFA problem cannot be approximated within any polynomial

Journal of the ACM (JACM)
On parallel complexity of integer linear programming, GCD and the iterated mod function

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The use of Knuth-Bendix methods to solve the wordproblem in automatic groups

Journal of Symbolic Computation - Special issue on computational group theory: part 2
Bounded quantification is undecidable

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
The membership problem in aperiodic transformation monoids

Journal of the ACM (JACM)
Reasoning about systems with many processes

Journal of the ACM (JACM)
Synthesis from production-based specifications

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
An integrated approach to system modeling using a synthesis of artificial intelligence, software engineering and simulation methodologies

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient decision procedures for graph properties on context-free graph languages

Journal of the ACM (JACM)
The concurrency workbench: a semantics-based tool for the verification of concurrent systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
A polynomial algorithm for gateway generation from formal specifications

IEEE/ACM Transactions on Networking (TON)
The parallel complexity of simple logic programs

Journal of the ACM (JACM)
Efficient recursive subtyping

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional analysis of modular logic programs

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
MURAX: a robust linguistic approach for question answering using an on-line encyclopedia

SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Undecidability of static analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
Synthesis of real time acceptors

Journal of Symbolic Computation - Special issue on automatic programming
The regular problem and green equivalences for special monoids

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
High-level symbolic construction technique for high performance sequential synthesis

DAC '93 Proceedings of the 30th international Design Automation Conference
Linear recursive networks and their applications in topological design and data routing

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Enhancing compositional reachability analysis with context constraints

SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Size-depth trade-offs for threshold circuits

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Constant time factors do matter

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Building correct simulation models is difficult

WSC '92 Proceedings of the 24th conference on Winter simulation
On the power of sigmoid neural networks

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Probability is more powerful than team for language identification from positive data

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Multi-media RISC informatics: retrieving information with simple structural components

CIKM '93 Proceedings of the second international conference on Information and knowledge management
The generating power of the boundary NLC graph grammars

CSC '93 Proceedings of the 1993 ACM conference on Computer science
Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Undecidable optimization problems for database logic programs

Journal of the ACM (JACM)
Instance complexity

Journal of the ACM (JACM)
A really temporal logic

Journal of the ACM (JACM)
Model checking and modular verification

ACM Transactions on Programming Languages and Systems (TOPLAS)
Recognizing substrings of LR(k) languages in linear time

ACM Transactions on Programming Languages and Systems (TOPLAS)
A general data dependence test for dynamic, pointer-based data structures

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An optimal parallel algorithm for learning DFA

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the intrinsic complexity of language identification

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the complexity of equivalence between recursive and nonrecursive Datalog programs

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The undecidability of aliasing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated repair of complex systems by fault compensation

IEEE/ACM Transactions on Networking (TON)
A Markov Chain Model for Statistical Software Testing

IEEE Transactions on Software Engineering
Teaching EBNF first in CS 1

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Prerequisite confidentiality

CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Iterative algorithms for formal verification of embedded real-time systems

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
The quasilinear isomorphism challenge

ACM SIGACT News
Simulation model design

WSC '94 Proceedings of the 26th conference on Winter simulation
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimality and domination in repeated games with bounded players

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A reduced test suite for protocol conformance testing

ACM Transactions on Software Engineering and Methodology (TOSEM)
A modular partitioning approach for asynchronous circuit synthesis

DAC '94 Proceedings of the 31st annual Design Automation Conference
Exact minimum cycle times for finite state machines

DAC '94 Proceedings of the 31st annual Design Automation Conference
BDD variable ordering for interacting finite state machines

DAC '94 Proceedings of the 31st annual Design Automation Conference
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Consensus power makes (some) sense! (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A prototyping environment for control-oriented HW/SW systems using state-charts, activity-charts and FPGA's

EURO-DAC '94 Proceedings of the conference on European design automation
A general state graph transformation framework for asynchronous synthesis

EURO-DAC '94 Proceedings of the conference on European design automation
Sequential algorithms, deterministic parallelism, and intensional expressiveness

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formal model and specification language for procedure calling conventions

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Integrating a breadth-first curriculum with relevant programming projects in CS1/CS2

SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
OVIDE: a tool for data acquisition and validation

ACM SIGPLAN Notices
A comparative analysis of partial order planning and task reduction planning

ACM SIGART Bulletin
Parallel molecular computation

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Hierarchical optimization of asynchronous circuits

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Object-oriented state machines: subclassing, composition, delegation, and genericity

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Magic factoring of closure programs (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
State abstraction and modular software development

SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
An approach to guided incremental specification

EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
Simulation model design

WSC '95 Proceedings of the 27th conference on Winter simulation
On the simultaneous construction of sample paths

WSC '95 Proceedings of the 27th conference on Winter simulation
How many queries are needed to learn?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sequential synthesis using S1S

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Efficient instruction scheduling using finite state automata

Proceedings of the 28th annual international symposium on Microarchitecture
Concept learning with geometric hypotheses

COLT '95 Proceedings of the eighth annual conference on Computational learning theory
A logic-model semantics for SCR software requirements

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Computational issues for accessibility in discrete event simulation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
How many queries are needed to learn?

Journal of the ACM (JACM)
Context constraints for compositional reachability analysis

ACM Transactions on Software Engineering and Methodology (TOSEM)
Fast text searching for regular expressions or automaton searching on tries

Journal of the ACM (JACM)
Constructing deterministic finite-state automata in recurrent neural networks

Journal of the ACM (JACM)
Encoding of a priori Information in Active Contour Models

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Sat-k-DNF formulas from membership queries

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Synthesizing enumeration techniques for language learning

COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Elementary formal systems, intrinsic complexity, and procrastination

COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Customizing information capture and access

ACM Transactions on Information Systems (TOIS)
Future directions in program transformation

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
A divide-and-conquer approach for asynchronous interface synthesis

ISSS '94 Proceedings of the 7th international symposium on High-level synthesis
POSC—a partitioning and optimizing SISAL compiler

ICS '90 Proceedings of the 4th international conference on Supercomputing
Employing finite automata for resource scheduling

MICRO 26 Proceedings of the 26th annual international symposium on Microarchitecture
On the use of regular expressions for searching text

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fixpoint logics, relational machines, and computational complexity

Journal of the ACM (JACM)
An integrated method for effective behaviour analysis of distributed systems

ICSE '94 Proceedings of the 16th international conference on Software engineering
Interprocedural control flow analysis of first-order programs with tail-call optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Regular path queries with constraints

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Cut and paste

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Algorithmic aspects in speech recognition: an introduction

Journal of Experimental Algorithmics (JEA)
Optimizing designs containing black boxes

DAC '97 Proceedings of the 34th annual Design Automation Conference
I-regular expression: regular expression with continuous interval constraints

CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Second-order unification and type inference for Church-style polymorphism

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel beta reduction is not elementary recursive

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling generalization and polyvariance in partial deduction of normal logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the limit of control flow analysis for regression test selection

Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Reading and writing mathematics: the MAVIS project

Assets '98 Proceedings of the third international ACM conference on Assistive technologies
Event-response systems: a technique for specifying multi-threaded dialogues

CHI '87 Proceedings of the SIGCHI/GI Conference on Human Factors in Computing Systems and Graphics Interface
“Maximal-munch” tokenization in linear time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic synthesis of interfaces between incompatible protocols

DAC '98 Proceedings of the 35th annual Design Automation Conference
Aspects of complexity of conservative probabilistic learning

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Redundancy Removal during High-Level Synthesis Using Scheduling Don‘t-Cares

Journal of Electronic Testing: Theory and Applications
Concurrent automata, database computers, and security: a “new” security paradigm for secure parallel processing

NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
Hardness Results for Learning First-Order Representations and Programming by Demonstration

Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Deriving Logic Systems for Path Delay Test Generation

IEEE Transactions on Computers
Adaptive variable reordering for symbolic model checking

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Waiting false path analysis of sequential logic circuits for performance optimization

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
VisA: towards a students' green card to automata theory and formal languages

ACSE '98 Proceedings of the 3rd Australasian conference on Computer science education
Ambiguity and constraint in mathematical expression recognition

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Automated Software Synthesis: An Application in Mechanical CAD

IEEE Transactions on Software Engineering
A survey of structured and object-oriented software specification methods and techniques

ACM Computing Surveys (CSUR)
Undecidability on quantum finite automata

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Workflow, transactions and datalog

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A generalized state assignment theory for transformation on signal transition graphs

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Process control for large complex systems

WSC '91 Proceedings of the 23rd conference on Winter simulation
Temporal deductive databases and infinite objects

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing existential datalog queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Procedure-Level Verification of Real-time Concurrent Systems

Real-Time Systems
Fifty years of research on self-replication: an overview

Artificial Life - Special issue on self-replication
Self-replicating and self-repairing multicellular automata

Artificial Life - Special issue on self-replication
Counting and random generation of strings in regular languages

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Software engineering education: Rôles of formal specification and design calculi

Annals of Software Engineering - Special issue on software engineering education
Ambiguity in context-free grammars

SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
A new method for verifying sequential circuits

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Simulation graphs

WSC '88 Proceedings of the 20th conference on Winter simulation
A “disposable” graphical event synthesizer for teaching simulation model building

WSC '87 Proceedings of the 19th conference on Winter simulation
Software engineerng applied to discrete event simulations

WSC '86 Proceedings of the 18th conference on Winter simulation
Converses of pumping lemmas

SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
A formal model of the Ada Ravenscar tasking profile; delay until

Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Ada+SQL—an overview

Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Operational characteristics of a harware-based pattern matcher

ACM Transactions on Database Systems (TODS)
The design of a hardware recognizer for utilization in scanning operations

CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
The Compilation of Regular Expressions into Integrated Circuits

Journal of the ACM (JACM)
Inference of Reversible Languages

Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

Journal of the ACM (JACM)
The Complexity of LALR(k) Testing

Journal of the ACM (JACM)
Some combinatorial game problems require Ω(nk) time

Journal of the ACM (JACM)
Two-level grammar: data flow English for functional and logic programming

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Extending Earley's context-free parsing algorithm for string pattern matching

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Anaphora resolution in the extraction of treatment history language from court opinions by partial parsing

ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
Analyzing synchronization problems by using event histories as languages

CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for expressive security policies

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Existential second-order logic over strings

Journal of the ACM (JACM)
DTD inference for views of XML data

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
View-based query processing for regular path queries with inverse

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational aspects of resilient data extraction from semistructured sources (extended abstract)

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the decidability of accessibility problems (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
XMill: an efficient compressor for XML data

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
XTRACT: a system for extracting document type descriptors from XML documents

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Estimating DNA sequence entropy

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Undecidability of context-sensitive data-dependence analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Environment modeling and language universality

ACM Transactions on Design Automation of Electronic Systems (TODAES)
UML-Based integration testing

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Context-sensitive synchronization-sensitive analysis is undecidable

ACM Transactions on Programming Languages and Systems (TOPLAS)
Stochastic Grammatical Inference of Text Database Structure

Machine Learning
Regular expression types for XML

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Multiobject Behavior Recognition by Event Driven Selective Attention Method

IEEE Transactions on Pattern Analysis and Machine Intelligence
Programming by voice, VocalProgramming

Assets '00 Proceedings of the fourth international ACM conference on Assistive technologies
Query optimization by using derivability in a data warehouse environment

Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
A VLSI layout for a pipelined Dadda multiplier

ACM Transactions on Computer Systems (TOCS)
Regular expression pattern matching for XML

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Levels of exploration

Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Structural Operational Semantics for a Portable Subset of Behavioral VHDL-93

Formal Methods in System Design
MSO definable string transductions and two-way finite-state transducers

ACM Transactions on Computational Logic (TOCL)
Extending Graham-Glanville techniques for optimal code generation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Exploiting metrics to facilitate grammar transformation into LALR format

Proceedings of the 2001 ACM symposium on Applied computing
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
On the arithmetic power of context-free languages

CCSC '01 Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges
Exact analysis of the cache behavior of nested loops

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Automated design of finite state machine predictors for customized processors

ISCA '01 Proceedings of the 28th annual international symposium on Computer architecture
Complexity of Points-To Analysis of Java in the Presence of Exceptions

IEEE Transactions on Software Engineering
On String Replacement Exponentiation

Designs, Codes and Cryptography
A component-based approach to building formal analysis tools

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Encoding program executions

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Foundations of the Trace Assertion Method of Module Interface Specification

IEEE Transactions on Software Engineering
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
A machine learning approach to prior case retrieval

Proceedings of the 8th international conference on Artificial intelligence and law
Applying an update method to a set of receivers

ACM Transactions on Database Systems (TODS)
Real-time protocol analysis for detecting link-state routing protocol attacks

ACM Transactions on Information and System Security (TISSEC)
Efficient minimization of deterministic weak &ohgr;-automata

Information Processing Letters
Aspects of complexity of probabilistic learning under monotonicity constraints

Theoretical Computer Science - Algorithmic learning theory
Computing a context-free grammar-generating series

Information and Computation
An efficient security verification method for programs with stack inspection

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Static analysis in datalog extensions

Journal of the ACM (JACM)
Forced simulation: A technique for automating component reuse in embedded systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Minimal cover-automata for finite languages

Theoretical Computer Science
Subset construction complexity for homogeneous automata, position automata and ZPC-structures

Theoretical Computer Science
Using acceptors as transducers

Theoretical Computer Science
Direct and dual laws for automata with multiplicities

Theoretical Computer Science
The accepting power of unary string logic programs

Theoretical Computer Science
Undecidability and incompleteness results in automata theory

A half-century of automata theory
Automata theory: its past and future

A half-century of automata theory
Forty years of formal power series in automata theory

A half-century of automata theory
Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM (JACM)
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Closed Partition Lattice and Machine Decomposition

IEEE Transactions on Computers - Special issue on fault-tolerant embedded systems
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
An event-condition-action language for XML

Proceedings of the 11th international conference on World Wide Web
A New Pattern Representation Scheme Using Data Compression

IEEE Transactions on Pattern Analysis and Machine Intelligence
A novel synthesis technique for communication controller hardware from declarative data communication protocol specifications

Proceedings of the 39th annual Design Automation Conference
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
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reducing abstraction level when learning computability theory concepts

Proceedings of the 7th annual conference on Innovation and technology in computer science education
Skeleton-based agent development for electronic institutions

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Animating automata: a cross-platform program for teaching finite automata

SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Verification and validation: automated object-flow testing of dynamic process interaction models

Proceedings of the 33nd conference on Winter simulation
Distributed simulation: an enabling technology for the evaluation of virtual enterprises

Proceedings of the 33nd conference on Winter simulation
APEX: an adaptive path index for XML data

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Parallel beta reduction is not elementary recursive

Information and Computation
Control structures in hypothesis spaces: the influence on learning

Theoretical Computer Science
Associative language descriptions

Theoretical Computer Science
Computational complexity of some problems involving congruences on algebras

Theoretical Computer Science
On two-sided infinite fixed points of morphisms

Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Theoretical Computer Science
Probabilistic rebound Turing machines

Theoretical Computer Science
Constructible functions in cellular automata and their applications to hierarchy results

Theoretical Computer Science
A pumping lemma for random permitting context languages

Theoretical Computer Science
Two undecidability results for chain code picture languages

Theoretical Computer Science
Simulation preorder over simple process algebras

Information and Computation
Design of embedded systems: formal models, validation, and synthesis

Readings in hardware/software co-design
STATEMATE: a working environment for the development of complex reactive systems

Readings in hardware/software co-design
Clairvoyant: a synthesis system for production-based specification

Readings in hardware/software co-design
Stochastic activity networks: formal definitions and concepts

Lectures on formal methods and performance analysis
Sequential grammars and automata with valances

Theoretical Computer Science
Online Text Prediction with Recurrent Neural Networks

Neural Processing Letters
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition

Higher-Order and Symbolic Computation
Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol

IEEE Transactions on Parallel and Distributed Systems
Query automata over finite trees

Theoretical Computer Science
A unified language processing methodology

Theoretical Computer Science
Designing reactive systems: integration of abstraction techniques into a synthesis procedure

Journal of Systems and Software - Special issue on artificial and computational intelligence for decisions, control, and automation in engineering and industrial applications
XKvalidator: a constraint validator for XML

Proceedings of the eleventh international conference on Information and knowledge management
Repairing syntax errors in LR parsers

ACM Transactions on Programming Languages and Systems (TOPLAS)
MOPS: an infrastructure for examining security properties of software

Proceedings of the 9th ACM conference on Computer and communications security
Mimicry attacks on host-based intrusion detection systems

Proceedings of the 9th ACM conference on Computer and communications security
The evolution of stochastic regular motifs for protein sequences

New Generation Computing
Analytic sets in descriptive set theory and NP sets in complexity theory

Fundamenta Informaticae
Generalization and specialization strategies for learning r.e. languages

Annals of Mathematics and Artificial Intelligence
Synthesizing structured analysis and object-based formal specifications

Annals of Software Engineering
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions

Applied Intelligence
Moore Automata for the Supervisory Control of Robotic Manufacturing Workcells

Autonomous Robots
An Undecidable Problem for Timed Automata

Discrete Event Dynamic Systems
Coordinated Decentralized Protocols for Failure Diagnosisof Discrete Event Systems

Discrete Event Dynamic Systems
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories

Journal of Automated Reasoning
Checking Simple Properties of Transition Systems Defined by Thue Specifications

Journal of Automated Reasoning
Timing Diagrams: Formalization and Algorithmic Verification

Journal of Logic, Language and Information
A New Criterion for Comparing Fuzzy Logics for Uncertain Reasoning

Journal of Logic, Language and Information
Using Extra Output Learning to Insert a Symbolic Theory into a Connectionist Network

Minds and Machines
Computational versus Causal Complexity

Minds and Machines
Ansatz for dynamical hierarchies

Artificial Life
Learning DFA from Simple Examples

Machine Learning
Automatic composition of music by means of grammatical evolution

APL '02 Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications
Solution of parallel language equations for logic synthesis

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Efficient stemmer generation

Information Processing and Management: an International Journal
A framework to visualize equivalences between computational models of regular languages

Information Processing Letters
Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies

Autonomous Agents and Multi-Agent Systems
Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC

Higher-Order and Symbolic Computation
Motif statistics

Theoretical Computer Science
Automatic Synthesis of Communication Controller Hardware from Protocol Specifications

IEEE Design & Test
An Approach to Designing Very Fast Approximate String Matching Algorithms

IEEE Transactions on Knowledge and Data Engineering
PREPARE: A Tool for Knowledge Base Verification

IEEE Transactions on Knowledge and Data Engineering
Rule Revision With Recurrent Neural Networks

IEEE Transactions on Knowledge and Data Engineering
Generalized Production Rules as a Basis for Integrating Active and Deductive Databases

IEEE Transactions on Knowledge and Data Engineering
Schema Evolution of an Object-Oriented Real-Time Database System for Manufacturing Automation

IEEE Transactions on Knowledge and Data Engineering
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks

IEEE Transactions on Knowledge and Data Engineering
Automata for the Assessment of Knowledge

IEEE Transactions on Knowledge and Data Engineering
Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters

IEEE Transactions on Software Engineering
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

IEEE Transactions on Software Engineering
Specifying Transaction-Based Information Systems with Regular Expressions

IEEE Transactions on Software Engineering
A Framework for Source Code Search Using Program Patterns

IEEE Transactions on Software Engineering
A Formal Semantics for Object Model Diagrams

IEEE Transactions on Software Engineering
Behavior Protocols for Software Components

IEEE Transactions on Software Engineering
Valid identity problem for shuffle regular expressions

Journal of Automata, Languages and Combinatorics
Normal processes for modeling the desired behavior of distributed autonomous discrete event systems

Journal of Automata, Languages and Combinatorics
Algorithms, nymphs, and shepherds

Theoretical Computer Science
Some analytic features of algebraic data

Discrete Applied Mathematics
Canonical derivatives, partial derivatives and finite automaton constructions

Theoretical Computer Science
Public data structures: counters as a special case

Theoretical Computer Science
On the symbolic reduction of processes with cryptographic functions

Theoretical Computer Science
Genetic programming over context-free languages with linear constraints for the knapsack problem: first results

Evolutionary Computation
Simulating finite automata with context-free grammars

Information Processing Letters
A non-ambiguous decomposition of regular languages and factorizing codes

Discrete Applied Mathematics
On interacting automata with limited nondeterminism

Fundamenta Informaticae - Special issue on cellular automata
Pebble automata: figures families recognition and universality

Fundamenta Informaticae - Special issue on cellular automata
More on generalized automatic sequences

Journal of Automata, Languages and Combinatorics
A leaf-size hierarchy of alternating rebound Turing machines

Journal of Automata, Languages and Combinatorics
Output string languages of compositions of deterministic macro tree transducers

Journal of Computer and System Sciences
Pattern-matching problems for two-dimensional images described by finite automata

Nordic Journal of Computing
Algebraic aspects of families of fuzzy languages

Theoretical Computer Science - Algebraic methods in language processing
Formal Foundations for Object-Oriented Data Modeling

IEEE Transactions on Knowledge and Data Engineering
Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines

IEEE Transactions on Software Engineering
Inference Graphs: A Computational Structure Supporting Generation of Customizable and Correct Analysis Components

IEEE Transactions on Software Engineering
On decidability of the control reachability problem in the asynchronous π-calculus

Nordic Journal of Computing
Incremental construction and maintenance of minimal finite-state automata

Computational Linguistics
Linguistic computation with state space trajectories

Emergent neural computational architectures based on neuroscience
Finite-state computation in analog neural networks: steps towards biologically plausible models?

Emergent neural computational architectures based on neuroscience
Universal Regular Path Queries

Higher-Order and Symbolic Computation
Turing universality of the game of life

Collision-based computing
Compression and Adaptation

ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
Wrapping Web Information Providers by Transducer Induction

EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Querying Graph Databases

EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Type Management: A Key to Software Reuse in Open Distributed Systems

EDOC '97 Proceedings of the 1st International Conference on Enterprise Distributed Object Computing
Model Generation by Moderated Regular Extrapolation

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
A Parallel DFA Minimization Algorithm

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Incremental Learning of Context Free Grammars

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Inference of Sequential Association Rules Guided by Context-Free Grammars

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Locally Testable Even Linear Languages from Positive Data

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Fragmentation: Enhancing Identifiability

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
A PAC Learnability of Simple Deterministic Languages

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Algebraic Rewritings for Optimizing Regular Path Queries

ICDT '01 Proceedings of the 8th International Conference on Database Theory
New Rewritings and Optimizations for Regular Path Queries

ICDT '03 Proceedings of the 9th International Conference on Database Theory
On Reasoning about Structural Equality in XML: A Description Logic Approach

ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Replicating Quantified Noun Phrases in Database Semantics

NLDB '02 Proceedings of the 6th International Conference on Applications of Natural Language to Information Systems-Revised Papers
Average State Complexity of Operations on Unary Automata

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Automatic Graphs and Graph D0L-Systems

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Sublinear Ambiguity

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Family of NFA's Which Need 2n -alpha Deterministic States

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Unary Pushdown Automata and Auxiliary Space Lower Bounds

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards Regular Languages over Infinite Alphabets

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Checking Amalgamability Conditions for C ASL Architectural Specifications

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Algorithms for Computing Small NFAs

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
An Improved Algorithm for the Membership Problem for Extended Regular Expressions

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Evolving FPGA Based Cellular Automata

SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
Better Logging through Formality

RAID '00 Proceedings of the Third International Workshop on Recent Advances in Intrusion Detection
Towards Formal Specification of Client-Server Interactions for a Wide Range of Internet Applications

WI '01 Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development
Upper Bounds for Restricted Splicing

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Infinite Relations in Paraconsistent Databases

ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems

EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Using Genetic Algorithms to Enable Automated Auctions

EC-WEB '00 Proceedings of the First International Conference on Electronic Commerce and Web Technologies
Recognition of Abstract Regions in Cartographic Maps

COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
A Grammar Based Model for XML Schema Integration

BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
Simulation Preorder on Simple Process Algebras

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Persistent Turing Machines as a Model of Interactive Computation

FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Classification of Security Properties (Part I: Information Flow)

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Efficient Verification Algorithms for One-Counter Processes

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Communication Gap for Finite Memory Devices

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Model Checking of Unrestricted Hierarchical State Machines

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Intersection of Regular Languages and Star Hierarchy

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Synthesis of Uninitialized Systems

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constructing Finite Maximal Codes from Schützenberger Conjecture

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Efficient Minus and Signed Domination in Graphs

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Evolving Finite-State Machine Strategies for Protecting Resources

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
CASL: From Semantics to Tools

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Stability of Saturated Linear Dynamical Systems Is Undecidable

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems

EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Synchronization of Concurrent Workflows Using Interaction Expressions and Coordination Protocols

On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Optimizing Büchi Automata

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Finding Trading Partners to Establish Ad-hoc Business Processes

On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
On the Power of Input-Synchronized Alternating Finite Automata

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On Universally Polynomial Context-Free Languages

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Transducers with Set Output

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Evolving Turing Machines for Biosequence Recognition and Analysis

EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
On Rational Graphs

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
An Algebraic Foundation for Adaptive Programming

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Secure Computation (Abstract)

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results

PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Beyond Regular Model Checking

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
An Architecture for Simulating Needle-Based Surgical Procedures

MICCAI '01 Proceedings of the 4th International Conference on Medical Image Computing and Computer-Assisted Intervention
Composing Abstractions of Hybrid Systems

HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Characterizing the Software Development Process: A New Approach Based on Kolmogorov Complexity

Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Hyper-Automation System Applied to Geometry Demonstration Environment

Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Equivalence-Checking with Infinite-State Systems: Techniques and Results

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Zero-Knowledge and Code Obfuscation

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Decidability and Closure Properties of Equational Tree Languages

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
The Complexity of Real Recursive Functions

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Verification of Quantitative Temporal Properties of SDL Specifications

SDL '01 Proceedings of the 10th International SDL Forum Copenhagen on Meeting UML
Contextual Rules for Text Analysis

CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Practical Nondeterministic DR(k) Parsing on Graph-Structured Stack

CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Using Acceptors as Transducers

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Determinization of Glushkov Automata

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Metric Lexical Analysis

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State Complexity and Jacobsthal's Function

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Glushkov Construction for Multiplicities

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Unary Language Concatenation and Its State Complexity

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Cursors

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Bit Parallelism - NFA Simulation

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Linguistic Computation with State Space Trajectories

Emergent Neural Computational Architectures Based on Neuroscience - Towards Neuroscience-Inspired Computing
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?

Emergent Neural Computational Architectures Based on Neuroscience - Towards Neuroscience-Inspired Computing
Hierarchical State Machines

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
The Refinement Relation of Graph-Based Generic Programs

Selected Papers from the International Seminar on Generic Programming
Watching You, Watching Me

AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Timed Verification of Asynchronous Circuits

Concurrency and Hardware Design, Advances in Petri Nets
Compiling Adaptive Programs by Partial Evaluation

CC '00 Proceedings of the 9th International Conference on Compiler Construction
Creating Difficult Instances of the Post Correspondence Problem

CG '00 Revised Papers from the Second International Conference on Computers and Games
A Practical Hierarchical Design by Timed Simulation Relations for Real-Time Systems

FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Finding a One-Variable Pattern from Incomplete Data

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Erasing Pattern Languages with Queries

ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Learning Regular Languages Using RFSA

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Efficient Data Mining from Large Text Databases

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
The Root of a Language and Its Complexity

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Some Petri Net Languages and Codes

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Partially-Ordered Two-Way Automata: A New Characterization of DA

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A Note on Synchronized Automata and Road Coloring Problem

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Minimal Covers of Formal Languages

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automata: From Uncertainty to Quantum

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A Short Introduction to Infinite Automata

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Shuffle Quotient and Decompositions

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Power of One-Letter Rational Languages

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
DNA and Circular Splicing

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Computing the Equation Automaton of a Regular Expression in Space and Time

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Constructing NFA s by Optimal Use of Positions in Regular Expressions

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Definition of Discovery in Terms of Generalized Descriptional Complexity

DS '99 Proceedings of the Second International Conference on Discovery Science
Computing Cycle Covers without Short Cycles

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Kleene Theorems for Event-Clock Automata

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On Time-Constructible Functions in One-Dimensional Cellular Automata

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
A Parallel Context-Free Derivation Hierarchy

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On Two-Sided Infinite Fixed Points of Morphisms

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Prediction-Preserving Reducibility with Membership Queries on Formal Languages

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Advanced Thread Synchronization in Java Using Interaction Expressions

NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
Combinatorial and Computational Problems on Finite Sets of Words

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Nonterminal Complexity of Programmed Grammars

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computation in Gene Networks

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Data Mining of User Navigation Patterns

WEBKDD '99 Revised Papers from the International Workshop on Web Usage Analysis and User Profiling
An Intelligent Tutoring System for Teaching Formal Languages

ITS '98 Proceedings of the 4th International Conference on Intelligent Tutoring Systems
NEXPTIME-Complete Description Logics with Concrete Domains

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
View-Based Query Answering and Query Containment over Semistructured Data

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Optimization Properties for Classes of Conjunctive Regular Path Queries

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Reasoning about Keys for XML

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing

CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
From Searching Text to Querying XML Streams

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
The MERLin Environment Applied to *-NFAs

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Supernondeterministic Finite Automata

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Automatic Verification of Pointer Data-Structure Systems for All Numbers of Processes

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Estimating Grammar Parameters Using Bounded Memory

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Attribute Value Extraction and Standardization in Data Integration

WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
A New Recognition Algorithm for Extended Regular Expressions

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Minimal Cover-Automata for Finite Languages

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning How to Separate

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
On the Complexity of Decidable Cases of Commutation Problem for Languages

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Description logics for semantic query optimization in object-oriented database systems

ACM Transactions on Database Systems (TODS)
Tutorial: Compiling concurrent languages for sequential processors

ACM Transactions on Design Automation of Electronic Systems (TODAES)
The correspondence problem

Imitation in animals and artifacts
One complexity theorist's view of quantum computing

Theoretical Computer Science - Algorithms,automata, complexity and games
Converting two-way nondeterministic unary automata into simpler automata

Theoretical Computer Science - Mathematical foundations of computer science
Evaluating real-time software specification languages

Computer Standards & Interfaces
XML query processing using document type definitions

Journal of Systems and Software
A Model for Mobile Code Using Interacting Automata

IEEE Transactions on Mobile Computing
Transformation-Based Diagnosis of Student Programs for Programming Tutoring Systems

IEEE Transactions on Software Engineering
Model checking: a tutorial overview

Modeling and verification of parallel processes
Upper bounds for restricted splicing

Formal and natural computing
The subtyping problem for second-order types is undecidable

Information and Computation
Finite automata on timed ω-trees

Theoretical Computer Science
Automatic effective verification method for distributed and concurrent systems using timed language inclusion

Engineering of distributed control systems
Nonterminal complexity of programmed grammars

Theoretical Computer Science
E-services: a look behind the curtain

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Defunctionalization at work

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
On algebraic and logical specifications of classes of regular languages

Theoretical Computer Science - Australasian computer science
Decision lists over regular patterns

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Polynomial-time identification of very simple grammars from positive data

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Unambiguous Büchi automata

Theoretical Computer Science - Latin American theoretical informatics
Conversation specification: a new approach to design and analysis of e-service composition

WWW '03 Proceedings of the 12th international conference on World Wide Web
The monadic quantifier alternation hierarchy over grids and graphs

Information and Computation - Special issue: LICS'97
Model checking

Handbook of automated reasoning
McNaughton families of languages

Theoretical Computer Science
On viewing block codes as finite automata

Theoretical Computer Science
Design and implementation of a string database query language

Information Systems - Special issue: Data management in bioinformatics
On rule-number complexity of components of probabilistic cooperating distributed grammar systems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
State complexity of proportional removals

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the number of distinct languages accepted by finite automata with n states

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Finite codes over free binoids

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of finite automata: concepts and open problems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of cellular automata and decidability questions

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Algebraic rewritings for optimizing regular path queries

Theoretical Computer Science - Database theory
Alternating and empty alternating auxiliary stack automata

Theoretical Computer Science
Bilateral locally testable languages

Theoretical Computer Science
Using theoretical computer simulators for formal languages and automata theory

ACM SIGCSE Bulletin
A massively parallel implementation of the watershed based on cellular automata

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Proving testing preorders for process algebra descriptions

EDTC '95 Proceedings of the 1995 European conference on Design and Test
The Subtyping Problem for Second-Order Types is Undecidable

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computational Complexity of Some Problems Involving Congruences on Algebras

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
View-Based Query Processing and Constraint Satisfaction

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Reversible Space Equals Deterministic Space

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Six Hypotheses in Search of a Theorem

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On Operators of Higher Types

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Polynomial Vicinity Circuits and Nonlinear Lower Bounds

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

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Computability theory of generalized functions

Journal of the ACM (JACM)
The complexity of the temporal logic with "until" over general linear time

Journal of Computer and System Sciences
A taxonomy for spatiotemporal connectionist networks revisited: the unsupervised case

Neural Computation
Editing by example

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An upper level computer science curriculum

SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
The tight deterministic time hierarchy

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Pushdown automata, graphs, ends, second-order logic, and reachability problems

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reversal complexity of counter machines

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
LALR(k) testing is PSPACE-complete

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Bandwidth constrained NP-Complete problems

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Low level complexity for combinatorial games

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A decision method for the equivalence of some non-real-time deterministic pushdown automata

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for straight-line programs

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
CCS expressions, finite state processes, and three problems of equivalence

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Alternative proposals for implementing Prolog concurrently and implications regarding their respective microarchitectures

MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Alternation and the power of nondeterminism

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The random access hierarchy

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Iterated pushdown automata and complexity classes

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Unique decomposability of shuffled strings: A formal treatment of asynchronous time-multiplexed communication

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A logic minimizer for VLSI PLA design

DAC '82 Proceedings of the 19th Design Automation Conference
Social relations as algebraic relations

WSC '80 Proceedings of the 12th conference on Winter simulation
Design of an ATN generator/modifier for supporting a communication prosthesis

ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Why computer science students need math

ACM SIGCSE Bulletin
Implementation of design functions by available devices: a new algorithm

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Optimal insertion in deterministic DAWGs

Theoretical Computer Science
Efficient minus and signed domination in graphs

Theoretical Computer Science
A family of NFAs which need 2n - α deterministic states

Theoretical Computer Science
A pragmatic, rigorous integration of structural and behavioral modeling notations

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
DNA evolutionary linguistics and RNA structure modeling: a computational approach

INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Splicing systems on graphs

INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Linear and circular splicing systems

INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Program Segmentation for Controlling Test Coverage

ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
Translation of binary regular expressions into nondeterministic ɛ-free automata with O(n log n)transitions

Journal of Computer and System Sciences
Automatic component protocol adaptation with the CoConut/J tool suite

Future Generation Computer Systems - Tools for program development and analysis
XML with data values: typechecking revisited

Journal of Computer and System Sciences - Special issu on PODS 2001
On complexiy

Quantum mechanics, mathematics, cognition and action
Cut, paste and filter

Discrete Applied Mathematics
On predictive parsing and extended context-free grammars

Computer Science in Perspective
Automata-Based Verification of Temporal Properties on Running Programs

Proceedings of the 16th IEEE international conference on Automated software engineering
A New Way of Automating Statistical Testing Methods

Proceedings of the 16th IEEE international conference on Automated software engineering
Exchanging intensional XML data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
On the undecidability of probabilistic planning and related stochastic optimization problems

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Solving factored MDPs using non-homogeneous partitions

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Dynamic hierarchical machines

Fundamenta Informaticae - Concurrency specification and programming
Weighted grammars and automata with threshold interpretation

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
On Reachability Analysis of Communicating Finite State Machines

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
On the simulation of quantum Turing machines

Theoretical Computer Science
The complexity of bisimilarity-checking for one-counter processes

Theoretical Computer Science
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars

Theoretical Computer Science
Regular binoid expressions and regular binoid languages

Theoretical Computer Science
Mining free text for structure

Data mining
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
Why Agents for Automated Negotiations Should Be Adaptive

Netnomics
A new algorithm for the construction of minimal acyclic DFAs

Science of Computer Programming
A Boyer--Moore-style algorithm for regular expression pattern matching

Science of Computer Programming
Regular closed sets of permutations

Theoretical Computer Science
An algebraic characterization of deterministic regular languages over infinite alphabets

Theoretical Computer Science
Reducing NFAs by invariant equivalences

Theoretical Computer Science
XML access control using static analysis

Proceedings of the 10th ACM conference on Computer and communications security
Enhancing byte-level network intrusion detection signatures with context

Proceedings of the 10th ACM conference on Computer and communications security
A note on parallel parsing

ACM SIGPLAN Notices
Decomposing data machines

EURO-DAC '91 Proceedings of the conference on European design automation
Automatic Detection and Diagnosis of Faults in Generated Code for Procedure Calls

IEEE Transactions on Software Engineering
A top down approach for MAS protocol descriptions

Proceedings of the 2003 ACM symposium on Applied computing
Follow automata

Information and Computation
On the entropy of regular languages

Theoretical Computer Science - WORDS
The commutative closure of a binary slip-language is context-free: a new proof

Discrete Applied Mathematics
Path sharing and predicate evaluation for high-performance XML filtering

ACM Transactions on Database Systems (TODS)
Reasoning on regular path queries

ACM SIGMOD Record
Why computer science students need language

ACM SIGCSE Bulletin
Reasoning about keys for XML

Information Systems
Automatic graphs and D0L-sequences of finite graphs

Journal of Computer and System Sciences
Intrinsic complexity of learning geometrical concepts from positive data

Journal of Computer and System Sciences
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
Some variants in communication of parallel communicating pushdown automata

Journal of Automata, Languages and Combinatorics
On the complexity of Simon automata over the Dyck language

Journal of Automata, Languages and Combinatorics
On regular drawn symbolic picture languages

Information and Computation
Incremental training of first order recurrent neural networks to predict a context-sensitive language

Neural Networks
Semantic language and multi-language MT approach based on SL

Journal of Computer Science and Technology
One-level phonology: autosegmental representations and rules as finite automata

Computational Linguistics
Probabilistic top-down parsing and language modeling

Computational Linguistics
Finite-state transducers in language and speech processing

Computational Linguistics
Review of "Parsing with principles and classes of information" by Paola Merlo. Kluwer Academic Publishers 1996.

Computational Linguistics - Special issue on word sense disambiguation
Estimation of probabilistic context-free grammars

Computational Linguistics
Computational complexity and lexical-functional grammar

Computational Linguistics
On the complexity of ID/LP parsing 1

Computational Linguistics
An efficient incremental DFA minimization algorithm

Natural Language Engineering
Compound noun segmentation based on lexical data extracted from corpus

Natural Language Engineering
Compound noun segmentation based on lexical data extracted from corpus

ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Extended spelling correction for German

ANLC '92 Proceedings of the third conference on Applied natural language processing
Locomotive gait generation for inchworm-like robots using finite state approach

Robotica
A stochastic language model using dependency and its improvement by word clustering

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Transforming lattices into non-deterministic automata with optional null arcs

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
On the mathematical properties of linguistic theories

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
LR recursive transition networks for Earley and Tomita parsing

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Feature-based allomorphy

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
The intersection of finite state automata and definite clause grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Learning how to separate

Theoretical Computer Science - Special issue: Algorithmic learning theory
Learning regular languages using RFSAs

Theoretical Computer Science - Special issue: Algorithmic learning theory
New proposal for a common command language in information systems

ACM SIGMOD Record
Arabic morphological analysis techniques: a comprehensive survey

Journal of the American Society for Information Science and Technology
From searching text to querying XML streams

Journal of Discrete Algorithms - SPIRE 2002
Generalized acceptance, succinctness and supernondeterministic finite automata

Theoretical Computer Science - Implementation and application automata
Separability and one-way functions

Computational Complexity
Model-Based Performance Prediction in Software Development: A Survey

IEEE Transactions on Software Engineering
Nestable bracketed comments

ACM SIGPLAN Notices
A note on parallel parsing

ACM SIGPLAN Notices
Compact non-left-recursive grammars using the selective left-corner transform and factoring

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
An extensible probe architecture for network protocol performance measurement

Software—Practice & Experience
Reducing memory requirements in reachability-based finite automata operations

Software—Practice & Experience
Object-oriented parallel parsing for context-free grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Multi-tape two-level morphology: a case study in semitic non-linear morphology

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Parsing as tree traversal

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Automatic proofreading of frozen phrases in German

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Cross-serial dependencies are not hard to process

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Parsing schemata for grammars with variable number and order of constituents

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Automatic proofreading of frozen phrases in German

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Computational complexity of probabilistic disambiguation by means of tree-grammars

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Automata theory based on quantum logic: some characterizations

Information and Computation
The most nonelementary theory

Information and Computation
Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming

Annals of Mathematics and Artificial Intelligence
Analysis and Conversion of Documents

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
On one-way cellular automata with a fixed number of cells

Fundamenta Informaticae - Special issue on cellular automata
Lazy query evaluation for Active XML

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Tools for design of composite Web services

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication

Theoretical Computer Science - Algebraic and numerical algorithm
OQAFMA Querying agent for the foundational model of anatomy: a prototype for providing flexible and efficient access to large semantic networks

Journal of Biomedical Informatics - Special issue: Unified medical language system
The busy beaver on a one-way infinite tape

ACM SIGACT News
On teaching theoretical foundations of Computer Science

ACM SIGACT News
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines

Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Continuous-time computation with restricted integration capabilities

Theoretical Computer Science - Super-recursive algorithms and hypercomputation
On the computation of approximations of database queries

ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Optimizing the lazy DFA approach for XML stream processing

ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
An xpath-based discourse analysis module for spoken dialogue systems

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Finite state machines for strings over infinite alphabets

ACM Transactions on Computational Logic (TOCL)
Codeword design and information encoding in DNA ensembles

Natural Computing: an international journal
Trajectory-based embedding relations

Fundamenta Informaticae
Deletion along trajectories

Theoretical Computer Science
Families of languages defined by ciliate bio-operations

Theoretical Computer Science
The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

Journal of VLSI Signal Processing Systems
Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets

IEEE Transactions on Computers
Supervisory Control of Software Systems

IEEE Transactions on Computers
Finite State Machine-Based Optimization of Data Parallel Regular Domain Problems Applied in Low-Level Image Processing

IEEE Transactions on Parallel and Distributed Systems
Multiagent Planning as Control Synthesis

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Locality phase prediction

ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
The language intersection problem for non-recursive context-free grammars

Information and Computation
On the trace product and some families of languages closed under partial commutations

Journal of Automata, Languages and Combinatorics
Bimachines and structurally-reversed automata

Journal of Automata, Languages and Combinatorics
A knowledge-based framework for belief change part I: foundations

TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Reasoning about knowledge: an overview

TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Extensions of pushdown automata and Petri nets

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Indexing text data under space constraints

Proceedings of the thirteenth ACM international conference on Information and knowledge management
Minimal DFA for testing divisibility

Journal of Computer and System Sciences
Efficient parsing for bilexical context-free grammars and head automaton grammars

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
On the use of registers in achieving wait-free consensus

Distributed Computing
Scaling properties of generalized Carlitz sequences of polynomials

Discrete Applied Mathematics
Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997)

ACM SIGACT News
Evolution and observation: a non-standard way to generate formal languages

Theoretical Computer Science
Updatable timed automata

Theoretical Computer Science
Peg-solitaire, string rewriting systems and finite automata

Theoretical Computer Science
Many aspects of defect theorems

Theoretical Computer Science - Words, languages and combinatorics
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice

Theoretical Computer Science - Special issue: Computational systems biology
A classification of symbolic transition systems

ACM Transactions on Computational Logic (TOCL)
Processing XML streams with deterministic automata and stream indexes

ACM Transactions on Database Systems (TODS)
Results on catalytic and evolution-communication P systems

New Generation Computing - Membrane computing
Lower bounds and the hardness of counting properties

Theoretical Computer Science
A coalgebraic approach to Kleene algebra with tests

Theoretical Computer Science - Selected papers of CMCS'03
PSPACE-completeness of Modular Supervisory Control Problems

Discrete Event Dynamic Systems
A pumping lemma and decidability problems for recognizable tree series

Acta Cybernetica
Partially ordered regular languages for graph queries

Journal of Computer and System Sciences
A short introduction to failure detectors for asynchronous distributed systems

ACM SIGACT News
Introducing VAUCANSON

Theoretical Computer Science - Implementation and application of automata
Weak minimization of DFA: an algorithm and applications

Theoretical Computer Science - Implementation and application of automata
Bideterministic automata and minimal representations of regular languages

Theoretical Computer Science - Implementation and application of automata
Linear reachability problems and minimal solutions to linear Diophantine equation systems

Theoretical Computer Science - Implementation and application of automata
Pattern expressions and pattern automata

Information Processing Letters
Regular expression types for XML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Cognition and the Power of Continuous Dynamical Systems

Minds and Machines
Succinct representations of languages by DFA with different levels of reliability

Theoretical Computer Science - Descriptional complexity of formal systems
On the descriptional power of heads, counters, and pebbles

Theoretical Computer Science - Descriptional complexity of formal systems
On two-way communication in cellular automata with a fixed number of cells

Theoretical Computer Science - Descriptional complexity of formal systems
Polynomial time learning of simple deterministic languages via queries and a representative sample

Theoretical Computer Science
Mergible states in large NFA

Theoretical Computer Science - Insightful theory
XPath satisfiability in the presence of DTDs

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Regular rewriting of active XML and unambiguity

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Problem solving with insufficient resources

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Mechanism design for software agents with complete information

Decision Support Systems - Special issue: Decision theory and game theory in agent design
Distributed evaluation of generalized path queries

Proceedings of the 2005 ACM symposium on Applied computing
Tool support for plagiarism detection in text documents

Proceedings of the 2005 ACM symposium on Applied computing
A prolog toolkit for formal languages and automata

ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Parsing with Probabilistic Strictly Locally Testable Tree Languages

IEEE Transactions on Pattern Analysis and Machine Intelligence
Grammatical Inference in Bioinformatics

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation
Component Verification with Automatically Generated Assumptions

Automated Software Engineering
Practical issues in compiling typed unification grammars for speech recognition

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Joint and conditional estimation of tagging and parsing models

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Incremental construction of compact acyclic NFAs

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A topological characterization of weakness

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Algorithms, theory of

Encyclopedia of Computer Science
Automata theory

Encyclopedia of Computer Science
Formal languages

Encyclopedia of Computer Science
Sequential machine

Encyclopedia of Computer Science
Modular Fault Diagnosis Based on Discrete Event Systems

Discrete Event Dynamic Systems
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction

Discrete Event Dynamic Systems
Remote attribute grammars

Journal of the ACM (JACM)
Approximate recognition of non-regular languages by finite automata

ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics

Formal Methods in System Design
Avoiding large squares in infinite binary words

Theoretical Computer Science - Combinatorics on words
Functions with local state: regularity and undecidability

Theoretical Computer Science
Adding symbolic information to picture models: definitions and properties

Theoretical Computer Science
On the complexity of decidable cases of the commutation problem of languages

Theoretical Computer Science
The generative capacity of block-synchronized context-free grammars

Theoretical Computer Science
On state-alternating context-free grammars

Theoretical Computer Science
Decidable containment of recursive queries

Theoretical Computer Science - Database theory
XML Queries and constraints, containment and reformulation

Theoretical Computer Science - Database theory
On reasoning about structural equality in XML: a description logic approach

Theoretical Computer Science - Database theory
Exact matching of RNA secondary structure patterns

Theoretical Computer Science - Pattern discovery in the post genome
An adaptive path index for XML data using the query workload

Information Systems
About the undecidability of program equivalence in finitary languages with state

ACM Transactions on Computational Logic (TOCL)
Synthesis of correct and distributed adaptors for component-based systems: an automatic approach

Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
The maximum state complexity for finite languages

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Random generation models for NFA'S

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
State complexity of shuffle on trajectories

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Tradeoffs between reliability and conciseness of deterministic finite automata

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Descriptional complexity of block-synchronization context-free grammars

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Context derivation sets and context-free normal forms

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Büchi automata and their degrees of nondeterminism and ambiguity

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
New operations and regular expressions for two-dimensional languages over one-letter alphabet

Theoretical Computer Science - The art of theory
Fast Approximate Search in Large Dictionaries

Computational Linguistics
The Mathematics of Language

Computational Linguistics
Dependency Parsing with an Extended Finite-State Approach

Computational Linguistics
Generating Annotated Behavior Models from End-User Scenarios

IEEE Transactions on Software Engineering
Debugging user interface descriptions of knowledge-based recommender applications

Proceedings of the 11th international conference on Intelligent user interfaces
Taxonomy of XML schema languages using formal language theory

ACM Transactions on Internet Technology (TOIT)
Verifying LOC based functional and performance constraints

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Comparative Analysis of XML Compression Technologies

World Wide Web
Learning Beyond Finite Memory in Recurrent Networks of Spiking Neurons

Neural Computation
Lexicalized grammar 101

ETMTNLP '02 Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1
Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review

Neural Computation
Finite State Automata Resulting from Temporal Information Maximization and a Temporal Learning Rule

Neural Computation
Analyzing Holistic Parsers: Implications for Robust Parsing and Systematicity

Neural Computation
Spatiotemporal Connectionist Networks: A Taxonomy and Review

Neural Computation
Reduction -- an abstract thinking pattern: the case of the computational models course

Proceedings of the 37th SIGCSE technical symposium on Computer science education
LZ trie and dictionary compression

Software—Practice & Experience
All superlinear inverse schemes are coNP-hard

Theoretical Computer Science - Mathematical foundations of computer science 2004
Sublogarithmic ambiguity

Theoretical Computer Science - Mathematical foundations of computer science 2004
The existential theory of equations with rational constraints in free groups is PSPACE-complete

Information and Computation
A theory of computation based on quantum logic (I)

Theoretical Computer Science
A boundary result on enhanced time-varying distributed H systems with parallel computations

Theoretical Computer Science
Context-free languages can be accepted with absolutely no space overhead

Information and Computation
Relations between gold-style learning and query learning

Information and Computation
Using software simulations to teach automata

Journal of Computing Sciences in Colleges
On the decidability of phase ordering problem in optimizing compilation

Proceedings of the 3rd conference on Computing frontiers
Software integrity protection using timed executable agents

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Functional verification methodology based on formal interface specification and transactor generation

Proceedings of the conference on Design, automation and test in Europe: Proceedings
A language-theoretic approach to covering problems

Journal of Automata, Languages and Combinatorics
Transducers with set output

Journal of Automata, Languages and Combinatorics
Equivalence-checking on infinite-state systems: Techniques and results

Theory and Practice of Logic Programming
Representing and querying XML with incomplete information

ACM Transactions on Database Systems (TODS)
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars

Theoretical Computer Science
Fuzzy context-free languages: part 2: Recognition and parsing algorithms

Theoretical Computer Science
ASDL: a wide spectrum language for designing web services

Proceedings of the 15th international conference on World Wide Web
A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching

Proceedings of the 33rd annual international symposium on Computer Architecture
Computational complexity of diagram satisfaction in Euclidean geometry

Journal of Complexity
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics
Length synchronization context-free grammars

Journal of Automata, Languages and Combinatorics
Development in parsing technology: from theory to application

New developments in parsing technology
A context-free superset approximation of unification-based grammars

New developments in parsing technology
Optimal ambiguity packing in context-free parsers with interleaved unification

New developments in parsing technology
Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
Graph splicing systems

Discrete Applied Mathematics
The state complexity of L2 and Lk

Information Processing Letters
Periodic and Sturmian languages

Information Processing Letters
Progress in computational complexity theory

Journal of Computer Science and Technology
Weighted path queries on semistructured databases

Information and Computation
Modeling component connectors in Reo by constraint automata

Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
On the suitability of programming tasks for automated evaluation

Informatics in education
On the structure of the counting function of sparse context-free languages

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On partially blind multihead finite automata

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
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
Determination of equivalence between quantum sequential machines

Theoretical Computer Science
An alternative definition of splicing

Theoretical Computer Science
Inference of concise DTDs from XML data

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Variations on U-shaped learning

Information and Computation
Expressiveness and complexity of XML Schema

ACM Transactions on Database Systems (TODS)
Automated pattern detection: an algorithm for constructing optimally synchronizing multi-regular language filters

Theoretical Computer Science
Constructing an even grammar from a 2-element sample

Proceedings of the 43rd annual Southeast regional conference - Volume 1
Comparative analysis of frameworks for knowledge-intensive intelligent agents

AI Magazine - Special issue on achieving human-level AI through integrated systems and research
Propositional dynamic logic of context-free programs and fixpoint logic with chop

Information Processing Letters
LTL Over integer periodicity constraints

Theoretical Computer Science
Boolean operations and inclusion test for attribute-element constraints

Theoretical Computer Science
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
Protomatching network traffic for high throughputnetwork intrusion detection

Proceedings of the 13th ACM conference on Computer and communications security
A natural language approach to automated cryptanalysis of two-time pads

Proceedings of the 13th ACM conference on Computer and communications security
PPMexe: Program compression

ACM Transactions on Programming Languages and Systems (TOPLAS)
Scenarios, goals, and state machines: a win-win partnership for model synthesis

Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
A formal framework for verification of embedded custom memories of the Motorola MPC7450 microprocessor

Formal Methods in System Design
Advanced algorithms for fast and scalable deep packet inspection

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Inductive bases and their application to searches for minimal unary NFAs

Proceedings of the 44th annual Southeast regional conference
Computer science students' difficulties with proofs by induction: an exploratory study

Proceedings of the 44th annual Southeast regional conference
Some properties of one-pebble turing machines with sublogarithmic space

Theoretical Computer Science
Decision procedures for term algebras with integer constraints

Information and Computation - Special issue: Combining logical systems
Finite graph automata for linear and boundary graph languages

Theoretical Computer Science
Small fast universal turing machines

Theoretical Computer Science
Finite transducers for divisibility monoids

Theoretical Computer Science
On size reduction techniques for multitape automata

Theoretical Computer Science - Implementation and application of automata
Fuzzy h-ideals of hemirings

Information Sciences: an International Journal
Kullback-Leibler distance between probabilistic context-free grammars and probabilistic finite automata

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
A genetic system based on simulated crossover of sequences of two-bit genes

Theoretical Computer Science
View-based query processing: On the relationship between rewriting, answering and losslessness

Theoretical Computer Science
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank

Fundamenta Informaticae
On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On Effective Methods for Diagnosis of Retaining Faults in Circuits

Fundamenta Informaticae
Interpreted Trajectories

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On Metalinear CD Grammar Systems

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Parallel communicating Watson-Crick automata systems

Acta Cybernetica
Anyone but him: The complexity of precluding an alternative

Artificial Intelligence
Context-dependent nondeterminism for pushdown automata

Theoretical Computer Science
On some variations of two-way probabilistic finite automata models

Theoretical Computer Science
An equational logic based approach to the security problem against inference attacks on object-oriented databases

Journal of Computer and System Sciences
Semi-automated adaptation of service interactions

Proceedings of the 16th international conference on World Wide Web
Visibly pushdown automata for streaming XML

Proceedings of the 16th international conference on World Wide Web
Defect particle kinematics in one-dimensional cellular automata

Theoretical Computer Science
Minimization of lattice finite automata and its application to the decomposition of lattice languages

Fuzzy Sets and Systems
P systems with minimal parallelism

Theoretical Computer Science
Comparing the size of NFAs with and without ε-transitions

Theoretical Computer Science
The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx

Neural Computation
Intelligent tutoring systems: Formalization as automata and interface design using neural networks

Computers & Education
Efficient Revalidation of XML Documents

IEEE Transactions on Knowledge and Data Engineering
Lightweight structured text processing

ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
XTREAM: An efficient multi-query evaluation on streaming XML data

Information Sciences: an International Journal
Probabilistic Context-Free Grammars Estimated from Infinite Distributions

IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Inverse monoids: Decidability and complexity of algebraic questions

Information and Computation
Complementing two-way finite automata

Information and Computation
Analyzing the effects of module encapsulation on search space bias

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Arity and alternation: a proper hierarchy in higher order logics

Annals of Mathematics and Artificial Intelligence
RE-Tree: an efficient index structure for regular expressions

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
PICCOLO Logic for a Picture Database Computer and Its Implementation

IEEE Transactions on Computers
Memory exploitation in learning classifier systems

Evolutionary Computation
Evolutionary program induction directed by logic grammars

Evolutionary Computation
Language constrained graph problems: a microcosm of engineering research and development

CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal

Fundamenta Informaticae
Learning one-counter languages in polynomial time

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A UNIFIED APPROACH TO GRAPHEME-TO-PHONEME CONVERSION FOR THE PLATTOS SLOVENIAN TEXT-TO-SPEECH SYSTEM

Applied Artificial Intelligence
Decision problems in membrane systems with peripheral proteins, transport and evolution

Theoretical Computer Science
Membrane systems with proteins embedded in membranes

Theoretical Computer Science
(Mem)brane automata

Theoretical Computer Science
Post Correspondence Problem for short words

Information Processing Letters
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Composition of Model Programs

FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Integrating Domain Knowledge in Equation Discovery

Computational Discovery of Scientific Knowledge
Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A Characterization of Simple Recurrent Neural Networks with Two Hidden Units as a Language Recognizer

Neural Information Processing
Resolving Hidden Representations

Neural Information Processing
Model Checking: From Tools to Theory

25 Years of Model Checking
On the Merits of Temporal Testers

25 Years of Model Checking
Protocol Modeling with Model Program Composition

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Conjunctive Grammars and Alternating Pushdown Automata

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Finite Automata, Digraph Connectivity, and Regular Expression Size

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Analyzing Context-Free Grammars Using an Incremental SAT Solver

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Hopcroft's Minimization Technique: Queues or Stacks?

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Five Determinisation Algorithms

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Deterministic Pushdown Automata and Unary Languages

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Progressive Solutions to FSM Equations

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Decidability of Bounded Valuedness for Transducers

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
k-Petri Net Controlled Grammars

Language and Automata Theory and Applications
On Alternating Phrase-Structure Grammars

Language and Automata Theory and Applications
An Infinite Automaton Characterization of Double Exponential Time

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages

Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
The Average State Complexity of the Star of a Finite Set of Words Is Linear

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Extended Multi Bottom-Up Tree Transducers

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning Commutative Regular Languages

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A blueprint for higher-level fusion systems

Information Fusion
Synthesis of decentralized and concurrent adaptors for correctly assembling distributed component-based systems

Journal of Systems and Software
Machine semantics

Theoretical Computer Science
Implementation of a Finite State Machine with Active Libraries in C++

Generative and Transformational Techniques in Software Engineering II
Minimum-cost delegation in service composition

Theoretical Computer Science
On Rational Stochastic Languages

Fundamenta Informaticae
Some algebraic properties of measure-once two-way quantum finite automata

Quantum Information Processing
Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems

CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Handling Left-Quadratic Rules When Completing Tree Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Four-dimensional multi-inkdot finite automata

WSEAS Transactions on Computers
Property Patterns for Runtime Monitoring of Web Service Conversations

Runtime Verification
Grammar-based classifier system: a universal tool for grammatical inference

WSEAS Transactions on Computers
Fast Signature Matching Using Extended Finite Automaton (XFA)

ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Experiences with model inference assisted fuzzing

WOOT'08 Proceedings of the 2nd conference on USENIX Workshop on offensive technologies
Applications of fuzzy languages and pictorial databases to decision support systems design

AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
Dynamic Programming Algorithms as Products of Weighted Logic Programs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
From Philosophical to Industrial Logics

ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
A New Family of Regular Operators Fitting with the Position Automaton Computation

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
State fusion of fuzzy automata with application on target tracking

Computers & Mathematics with Applications
A survey of three-dimensional automata

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Regular production systems and triangle tilings

Theoretical Computer Science
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Fundamenta Informaticae
Disappearing Cryptography: Information Hiding: Steganography & Watermarking

Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Automated construction of web accessibility models from transaction click-streams

Proceedings of the 18th international conference on World wide web
Ethological data mining: an automata-based approach to extract behavioral units and rules

Data Mining and Knowledge Discovery
Deciding Substitutability of Services with Operating Guidelines

Transactions on Petri Nets and Other Models of Concurrency II
Synthesis from Component Libraries

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Verified, Executable Parsing

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Descriptional and Computational Complexity of Finite Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Decision Problems for Convex Languages

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Multi-tilde Operators and Their Glushkov Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the Average Size of Glushkov's Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Interacting process classes

ACM Transactions on Software Engineering and Methodology (TOSEM)
Extending finite automata to efficiently match Perl-compatible regular expressions

CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A probabilistic plan recognition algorithm based on plan tree grammars

Artificial Intelligence
Grid management support by means of collaborative learning agents

GMAC '09 Proceedings of the 6th international conference industry session on Grids meets autonomic computing
Verified Compilation and the B Method: A Proposal and a First Appraisal

Electronic Notes in Theoretical Computer Science (ENTCS)
Reformulating Global Grammar Constraints

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Polytope of Context-Free Grammar Constraints

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Short Regular Expressions from Finite Automata: Empirical Results

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Small Extended Expressions for Acyclic Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Induction as a tool for conceptual coherence in computer science

Proceedings of the 46th Annual Southeast Regional Conference on XX
Zero knowledge hidden Markov model inference

Pattern Recognition Letters
Hierarchies and Characterizations of Stateless Multicounter Machines

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Approximation of fuzzy context-free grammars

Information Sciences: an International Journal
On Stateless Multicounter Machines

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
How evolutionary algorithms are applied to statistical natural language processing

Artificial Intelligence Review
On the size of Boyer-Moore automata

Theoretical Computer Science
On Models of a Nondeterministic Computation

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the Hairpin Completion of Regular Languages

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Regular Expressions with Numerical Constraints and Automata with Counters

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Set Algebra for Service Behavior: Applications and Constructions

BPM '09 Proceedings of the 7th International Conference on Business Process Management
Experimental evaluation of a tool for the verification and transformation of source code in event-driven systems

Empirical Software Engineering
Anyone but him: the complexity of precluding an alternative

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A diachronic approach for schwa deletion in Indo Aryan languages

SIGMorPhon '04 Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology: Current Themes in Computational Phonology and Morphology
Learning geometrically-constrained hidden Markov models for robot navigation: bridging the topological-geometrical gap

Journal of Artificial Intelligence Research
Logical hidden Markov models

Journal of Artificial Intelligence Research
A guide to the modal logics of knowledge and belief: preliminary draft

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Freshmen's CL curriculum: the benefits of redundancy

TeachCL '08 Proceedings of the Third Workshop on Issues in Teaching Computational Linguistics
Theory of one-tape linear-time Turing machines

Theoretical Computer Science
Maximum likelihood analysis of algorithms and data structures

Theoretical Computer Science
An approach for generating state machine designs from scenarios

SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
Item-based constructions and the logical problem

PMHLA '05 Proceedings of the Workshop on Psychocomputational Models of Human Language Acquisition
The weak generative capacity of linear tree-adjoining grammars

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Verification of real-time DEVS models

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
An axiom system for sequence-based specification

Theoretical Computer Science
Using sensors sensibility toward sensor localization and K-coverage problems

CSN '07 Proceedings of the Sixth IASTED International Conference on Communication Systems and Networks
Closures in Binary Partial Algebras

Electronic Notes in Theoretical Computer Science (ENTCS)
Identification of design motifs with pattern matching algorithms

Information and Software Technology
Multiple von neumann computers: An evolutionary approach to functional emergence

Artificial Life
Generation of restart states for manufacturing systems with discarded workpieces

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
A computational model for inference chains in expert systems

INES'09 Proceedings of the IEEE 13th international conference on Intelligent Engineering Systems
Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Regular Expression Matching on Graphics Hardware for Intrusion Detection

RAID '09 Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection
The Evolution of Story Spaces of Digital Games beyond the Limits of Linearity and Monotonicity

ICIDS '09 Proceedings of the 2nd Joint International Conference on Interactive Digital Storytelling: Interactive Storytelling
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models

ACC'09 Proceedings of the 2009 conference on American Control Conference
A dynamic programming approach to multi-level supervision

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
On the power of circular splicing

Discrete Applied Mathematics
Linear splicing and syntactic monoid

Discrete Applied Mathematics
Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
Regular approximation and bounded domains for size-change termination

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Type Theory and Language Constructs for Objects with States

Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy automata with ε-moves compute fuzzy measures between strings

Fuzzy Sets and Systems
A categorical approach to lattice-valued fuzzy automata

Fuzzy Sets and Systems
Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

Fuzzy Sets and Systems
The parallel complexity of finite-state automata problems

Information and Computation
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation
A note on the space complexity of some decision problems for finite automata

Information Processing Letters
Pattern expressions and pattern automata

Information Processing Letters
The state complexity of L2 and Lk

Information Processing Letters
Periodic and Sturmian languages

Information Processing Letters
A probabilistic approach to navigation in Hypertext

Information Sciences: an International Journal
A proof rule for restoring logic circuits

Integration, the VLSI Journal
New directions in fuzzy automata

International Journal of Approximate Reasoning
Grammar constraints

Constraints
Boundedness problems for Minsky counter machines

Programming and Computing Software
Inference of concise regular expressions and DTDs

ACM Transactions on Database Systems (TODS)
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems

Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
On the expressiveness of interaction

Theoretical Computer Science
Analytical and knowledge based approaches for a bioprocess supervision

Knowledge-Based Systems
Automatic verification of sequential infinite-state processes

Automatic verification of sequential infinite-state processes
Incremental learning of context free grammars based on bottom-up parsing and search

Pattern Recognition
Finite automata based algorithms on subsequences and supersequences of degenerate strings

Journal of Discrete Algorithms
Suffix trees and string complexity

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Efficient transformations from regular expressions to finite automata

DLT'02 Proceedings of the 6th international conference on Developments in language theory
Carriers and counters: P systems with carriers vs. (blind) counter automata

DLT'02 Proceedings of the 6th international conference on Developments in language theory
On the separation between k-party and (k - 1)-party nondeterministic message complexities

DLT'02 Proceedings of the 6th international conference on Developments in language theory
Unary language operations and their nondeterministic state complexity

DLT'02 Proceedings of the 6th international conference on Developments in language theory
Roots and powers of regular languages

DLT'02 Proceedings of the 6th international conference on Developments in language theory
An analysis of exponentiation based on formal languages

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Finite automata and non-self-embedding grammars

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
The number of similarity relations and the number of minimal deterministic finite cover automata

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Regex and extended regex

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Prime decompositions of regular prefix codes

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
On predictive parsing and extended context-free grammars

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Star normal form, rational expressions, and glushkov WFAs properties

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Dynamic programming: NFA simulation

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
The specker-blatter theorem revisited

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A fast bit-parallel algorithm for matching extended regular expressions

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Covering problems from a formal language point of view

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Computing languages by (Bounded) local sets

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Build a dictionary, learn a grammar, decipher stegoscripts, and discover genomic regulatory elements

RECOMB'05 Proceedings of the 2005 joint annual satellite conference on Systems biology and regulatory genomics
Flip-pushdown automata: k + 1 pushdown reversals are better than k

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An effective algorithm for the membership problem for extended regular expressions

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Running time complexity of printing an acyclic automaton

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
New complexity results for some linear counting problems using minimal solutions to linear diophantine equations

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Boolean operations for attribute-element constraints

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Weak minimization of DFA: an algorithm and applications

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Bag automata and stochastic retrieval of biomolecules in solution

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
LR parsing for global index languages (GILs)

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
The effect of rewriting regular expressions on their accepting automata

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Knitting for fun: a recursive sweater

FUN'07 Proceedings of the 4th international conference on Fun with algorithms
A semi-supervised algorithm for pattern discovery in information extraction from textual data

PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization

Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization
Modular specification and verification of object-oriented programs

Modular specification and verification of object-oriented programs
Mode reconstruction for source coding and multi-modal control

HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Learning correction grammars

COLT'07 Proceedings of the 20th annual conference on Learning theory
History-dependent Petri nets

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Towards user-level extensibility of an Ada library: an experiment with cheddar

Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
SAT-based compositional verification using lazy learning

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Defining and Providing Coverage for Assertion-Based Dynamic Verification

Journal of Electronic Testing: Theory and Applications
Homomorphisms preserving types of density

Acta Cybernetica
An alternative algorithm for constraint automata product

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Regulated nondeterminism in pushdown automata

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Deterministic caterpillar expressions

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
An implementation of deterministic tree automata minimization

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A measure for the degree of nondeterminism of context-free languages

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Analyzing ambiguity of context-free grammars

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Regular linear temporal logic

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Linear context free languages

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Incremental validation of string-based XML data in databases, file systems, and streams

ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Contextual spelling correction

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Assisted problem solving and decompositions of finite automata

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On 5' → 3' sensing Watson-Crick finite automata

DNA13'07 Proceedings of the 13th international conference on DNA computing
Keep off the grass: locking the right path for atomicity

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
Restricted global grammar constraints

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On-the-fly techniques for game-based software model checking

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Interprocedural analysis of concurrent programs under a context bound

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Context-bounded analysis of concurrent queue systems

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Classes of tree homomorphisms with decidable preservation of regularity

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model-checking ω-regular properties of interval Markov chains

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Note on Two-pebble Automata Over Infinite Alphabets

Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Analyzing architectural styles

Journal of Systems and Software
From monadic logic to PSL

Pillars of computer science
Exploring XML web collections with DescribeX

ACM Transactions on the Web (TWEB)
Simplifying XML schema: single-type approximations of regular tree languages

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental learning with temporary memory

Theoretical Computer Science
On probabilistic pushdown automata

Information and Computation
Computable Bayesian compression for uniformly discretizable statistical models

ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Difficulties in forcing fairness of polynomial time inductive inference

ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Automata theory with modern applications by James A. Anderson, Cambridge University Press, 2006, viii+256 pages

ACM SIGACT News
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives

Electronic Notes in Theoretical Computer Science (ENTCS)
A Systematic Approach to Construct Compositional Behaviour Models for Network-structured Safety-critical Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Performance Evaluation
On the regularity of circular splicing languages: a survey and new developments

Natural Computing: an international journal
Robust and fast pattern matching for intrusion detection

INFOCOM'10 Proceedings of the 29th conference on Information communications
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
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution

Science of Computer Programming
Computational power of two stacks with restricted communication

Information and Computation
Systematic Refinement of Performance Models for Concurrent Component-based Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Acyclic automata and small expressions using multi-tilde-bar operators

Theoretical Computer Science
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton

Theoretical Computer Science
On pebble automata for data languages with decidable emptiness problem

Journal of Computer and System Sciences
Simple restriction in context-free rewriting

Journal of Computer and System Sciences
Synchronized alternating turing machines on four-dimensional input tapes

WSEAS Transactions on Computers
Hardware hierarchies and recognizabilities of four-dimensional synchronized alternating turing machines

WSEAS Transactions on Computers
Applying the new primer on prime numbers

WSEAS Transactions on Mathematics
Formatting time-aligned ASR transcripts for readability

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Context-free reordering, finite-state translation

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Why synchronous tree substitution grammars?

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Compositional matrix-space models of language

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
On the (Un-)Decidability of Model Checking Resource-Bounded Agents

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
SetExp: a method of transformation of timed automata into finite state automata

Real-Time Systems
The new primer on prime numbers: sums of second derivatives

AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
On sets of numbers accepted by P/T systems composed by join

Theoretical Computer Science
Solving constraint satisfaction problems using finite state automata

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Computing least common subsumers in description logics

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
The scheduling of rail at union pacific railroad

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Monitor optimization via stutter-equivalent loop transformation

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Processing SPARQL queries with regular expressions in RDF databases

DTMBIO '10 Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics
Building the minimal automaton of A*X in linear time, when X is of bounded cardinality

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms for three versions of the shortest common superstring problem

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Inference concerning physical systems

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Ensuring critical event sequences in high consequence computer based systems as inspired by path expressions

ECBS'97 Proceedings of the 1997 international conference on Engineering of computer-based systems
Mildly context-sensitive languages via buffer augmented pregroup grammars

Time for verification
On the Krohn-Rhodes cascaded decomposition theorem

Time for verification
Revisiting the power and equivalence of one-way quantum finite automata

ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
The complexity of regular(-like) expressions

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Undecidability and hierarchy results for parallel communicating finite automata

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Two-way unary automata versus logarithmic space

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Automata with extremal minimality conditions

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata

RP'10 Proceedings of the 4th international conference on Reachability problems
Tracking down the origins of ambiguity in context-free grammars

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
From object fields to local variables: a practical approach to field-sensitive analysis

SAS'10 Proceedings of the 17th international conference on Static analysis
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
Algorithmic aspects of natural language processing

Algorithms and theory of computation handbook
Basic notions in computational complexity

Algorithms and theory of computation handbook
Formal grammars and languages

Algorithms and theory of computation handbook
Computability

Algorithms and theory of computation handbook
Complexity classes

Algorithms and theory of computation handbook
Reducibility and completeness

Algorithms and theory of computation handbook
Observability of Turing Machines: A Refinement of the Theory of Computation

Informatica
A local search algorithm for grammatical inference

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Multipebble simulations for alternating automata

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Self-testability in unit testing

COMPSAC-W'05 Proceedings of the 29th annual international conference on Computer software and applications conference
Petri net controlled grammars with a bounded number of additional places

Acta Cybernetica
Languages generated by context-free grammars extended by type AB → BA rules

Journal of Automata, Languages and Combinatorics
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
Learning models of intelligent agents

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Learning figures with the hausdorff metric by fractals

ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Inductive inference of languages from samplings

ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Compositions of top-down tree transducers with ε-rules

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Joining composition and trimming of finite-state transducers

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Optimal grids for five-axis machining

Mathematics and Computers in Simulation
Finite automata theory with membership values in lattices

Information Sciences: an International Journal
High-performance dynamic pattern matching over disordered streams

Proceedings of the VLDB Endowment
One Pebble Versus ε · log n Bits

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Algebraic Myhill-Nerode Theorems

Theoretical Computer Science
The tree width of auxiliary storage

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular expression containment: coinductive axiomatization and computational interpretation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Complexity of pattern-based verification for multithreaded programs

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental learning of cellular automata for parallel recognition of formal languages

DS'10 Proceedings of the 13th international conference on Discovery science
Probabilistic automata on infinite words: decidability and undecidability results

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Nevertrace claims for model checking

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Symbolic automata constraint solving

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Querying XML data sources that export very large sets of views

ACM Transactions on Database Systems (TODS)
Construction of minimal deterministic finite automata from biological motifs

Theoretical Computer Science
Block insertion and deletion on trajectories

Theoretical Computer Science
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
Hardness of preorder checking for basic formalisms

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Synthesis of trigger properties

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Runtime verification in context: can optimizing error detection improve fault diagnosis?

RV'10 Proceedings of the First international conference on Runtime verification
Optimized temporal monitors for SystemC

RV'10 Proceedings of the First international conference on Runtime verification
Arm-hand behaviours modelling: from attention to imitation

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Computational complexity of the problem of tree generation under fine-grained access control policies

Information and Computation
Decidability of operation problems for T0L languages and subclasses

Information and Computation
P systems and unique-sum sets

CMC'10 Proceedings of the 11th international conference on Membrane computing
An evaluation of automata algorithms for string analysis

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
One-reversal counter machines and multihead automata: revisited

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
The set of realizations of a max-plus linear sequence is semi-polyhedral

Journal of Computer and System Sciences
From sequential extended regular expressions to NFA with symbolic labels

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
State complexity of catenation combined with union and intersection

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Complexity results and the growths of hairpin completions of regular languages

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Types of trusted information that make DFA identification with correction queries feasible

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Regular expressions at their best: a case for rational design

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Two-variable logic on data words

ACM Transactions on Computational Logic (TOCL)
An alternative to synchronous tree substitution grammars*

Natural Language Engineering
Products of weighted logic programs

Theory and Practice of Logic Programming
Monitoring and recovery of web service applications

The smart internet
Quickest path distances on context-free labeled graphs

ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Left-most derivation and shadow-pushdown automata for context-sensitive languages

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Two-way unary automata versus logarithmic space

Information and Computation
Stochastic grammars for intelligent software systems modeling

MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Reverse engineering using graph queries

Graph transformations and model-driven engineering
Patching vulnerabilities with sanitization synthesis

Proceedings of the 33rd International Conference on Software Engineering
Automated cross-browser compatibility testing

Proceedings of the 33rd International Conference on Software Engineering
Monitoring and recovery of web service applications

The smart internet
Linear conjunctive grammars and one-turn synchronized alternating pushdown automata

FG'09 Proceedings of the 14th international conference on Formal grammar
HTML Validation of context-free languages

FOSSACS'11/ETAPS'11 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
On lifecycle constraints of artifact-centric workflows

WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
On nondeterministic workflow executions

WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
On iterated hairpin completion

Theoretical Computer Science
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
Clairvoyant: a synthesis system for production-based specification

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Bulking II: Classifications of cellular automata

Theoretical Computer Science
A survey of grammatical inference methods for natural language learning

Artificial Intelligence Review
A unifying Kleene theorem for weighted finite automata

Rainbow of computer science
Local squares, periodicity and finite automata

Rainbow of computer science
Optimal head-driven parsing complexity for linear context-free rewriting systems

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Fully unsupervised word segmentation with BVE and MDL

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Qualitative reachability in stochastic BPA games

Information and Computation
Quantum automata, braid group and link polynomials

Quantum Information & Computation
Measuring 4-local qubit observables could probabilistically solve PSPACE

Quantum Information & Computation
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the capabilities of grammars, automata, and transducers controlled by monoids

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Runtime analysis of probabilistic programs with unbounded recursion

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Note: On the complexity of computing the profinite closure of a rational language

Theoretical Computer Science
Formal modeling of RESTful systems using finite-state machines

ICWE'11 Proceedings of the 11th international conference on Web engineering
State complexity research and approximation

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Chop operations and expressions: descriptional complexity considerations

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Nodes connected by path languages

DLT'11 Proceedings of the 15th international conference on Developments in language theory
On two-way transducers

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Dynamic behavior matching: a complexity analysis and new approximation algorithms

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Gaining power by input operations: finite automata and beyond

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Decidability and shortest strings in formal languages

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Descriptional complexity of two-way pushdown automata with restricted head reversals

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Transition function complexity of finite automata

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On the complexity of szilard languages of regulated grammars

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Immunity and pseudorandomness of context-free languages

Theoretical Computer Science
Software model checking using languages of nested trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Deciding according to the shortest computations

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Performing operations on structured information space of Braille music

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
Graph-theoretic formalization of hybridization in DNA sticker complexes

DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Structuring and composition mechanisms to address scalability issues in task models

INTERACT'11 Proceedings of the 13th IFIP TC 13 international conference on Human-computer interaction - Volume Part III
Binary bubble languages and cool-lex order

Journal of Combinatorial Theory Series A
Quasi-rocking real-time pushdown automata

Theoretical Computer Science
Hardness of preorder checking for basic formalisms

Theoretical Computer Science
Model checking EGF on basic parallel processes

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A succinct canonical register automaton model

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
An efficient algorithm for learning event-recording automata

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Parsing algorithms for grammars with regulated rewriting

ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
The MovieOracle - Content Based Movie Recommendations

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Lattice-Based Sampling for Path Property Monitoring

ACM Transactions on Software Engineering and Methodology (TOSEM)
Minimization of the kinematics error for five-axis machining

Computer-Aided Design
Splittability of bilexical context-free grammars is undecidable

Computational Linguistics
Learning beyond finite memory in recurrent networks of spiking neurons

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
A prototype of a descriptive type system for Xcerpt

PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Solving SAT and HPP with accepting splicing systems

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Papílio cryptography algorithm

CIS'04 Proceedings of the First international conference on Computational and Information Science
Constraint relaxations for discovering unknown sequential patterns

KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Infinite hierarchies of conformon-p systems

WMC'06 Proceedings of the 7th international conference on Membrane Computing
Simulating a Turing machine

XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Dickie George: looking back on 40 years at the NSA

XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Peptide computing: universality and theoretical model

UC'06 Proceedings of the 5th international conference on Unconventional Computation
The theory of grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Counting time in computing with cells

DNA'05 Proceedings of the 11th international conference on DNA Computing
FSM test translation through context

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
On nonforgetting restarting automata that are deterministic and/or monotone

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Behavioural approximations for restricted linear differential hybrid automata

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Decision problems for the verification of real-time software

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Communication of two stacks and rewriting

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Revisiting the election problem in asynchronous distributed systems

APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Inference improvement by enlarging the training set while learning DFAs

CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Learnability of probabilistic automata via oracles

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Gold-style and query learning under various constraints on the target class

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Algorithms for learning regular expressions

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Experimental evaluation of classical automata constructions

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decomposing controllers into non-conflicting distributed controllers

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Idealized algol with ground recursion, and DPDA equivalence

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Decidability and complexity results for timed automata via channel machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Congruences for visibly pushdown languages

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Evolution of song communication in a 2d space

ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Removing superfluous versions in polyvariant specialization of prolog programs

LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Hexagonal pattern languages

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Characterizations of one-way general quantum finite automata

Theoretical Computer Science
Average complexity of Moore's and Hopcroft's algorithms

Theoretical Computer Science
Diagnosing faulty transitions in recommender user interface descriptions

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Modelling cellular processes using membrane systems with peripheral and integral proteins

CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Symbolic analysis of imperative programming languages

JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Query-monotonic turing reductions

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
P systems, petri nets, and program machines

WMC'05 Proceedings of the 6th international conference on Membrane Computing
UCSG shallow parser

CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing
Solving election problem in asynchronous distributed systems

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
On the state complexity of combined operations

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Around hopcroft’s algorithm

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Correctness preservation and complexity of simple RL-automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Generating model-based test cases from natural language requirements for space application software

Software Quality Control
Minimal parallelism for polarizationless p systems

DNA'06 Proceedings of the 12th international conference on DNA Computing
Regular linear temporal logic with past

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Pattern-unit based regular expression matching with reconfigurable function unit

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
The language theory of bounded context-switching

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complexity of operations on cofinite languages

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The election problem in asynchronous distributed systems with bounded faulty processes

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Using grammars to generate very large scale neighborhoods for the traveling salesman problem and other sequencing problems

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
PTIME queries revisited

ICDT'05 Proceedings of the 10th international conference on Database Theory
View-based query processing: on the relationship between rewriting, answering and losslessness

ICDT'05 Proceedings of the 10th international conference on Database Theory
On the complexity of error explanation

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
An overview of probabilistic tree transducers for natural language processing

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Reducing the size of NFAs by using equivalences and preorders

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Regular expression constrained sequence alignment

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
P-completeness of cellular automaton rule 110

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Languages of nested trees

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Clustering cycles into cycles of clusters

GD'04 Proceedings of the 12th international conference on Graph Drawing
Service discovery and component reuse with semantic interfaces

SDL'05 Proceedings of the 12th international conference on Model Driven
Variations on u-shaped learning

COLT'05 Proceedings of the 18th annual conference on Learning Theory
Removing bidirectionality from nondeterministic finite automata

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Topological automata

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
LSTAFF: system software for large block flash memory

AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
Playing a toy-grammar with GCS

IWINAC'05 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
Computation of partial automata through span composition

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Automatically composing and parameterizing skills by evolving Finite State Automata

Robotics and Autonomous Systems
An automata-theoretic characterization of the chomsky-hierarchy

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Bounded underapproximations

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Time–independent p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing
P systems generating trees

WMC'04 Proceedings of the 5th international conference on Membrane Computing
Protocol system integration, interface and interoperability

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Arity and alternation: a proper hierarchy in higher order logics

FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Finite sets of words and computing

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Computing by observing bio-systems: the case of sticker systems

DNA'04 Proceedings of the 10th international conference on DNA computing
Computing beyond the turing limit using the h systems

DNA'04 Proceedings of the 10th international conference on DNA computing
Biomolecular implementation of computing devices with unbounded memory

DNA'04 Proceedings of the 10th international conference on DNA computing
Fixed points avoiding Abelian k-powers

Journal of Combinatorial Theory Series A
Nondeterministic fuzzy automata

Information Sciences: an International Journal
Deterministic automata on unranked trees

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Translational lemmas for alternating TMs and PRAMs

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Shrinking multi-pushdown automata

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Measuring over-generalization in the minimal multiple generalizations of biosequences

DS'05 Proceedings of the 8th international conference on Discovery Science
Visualising larger state spaces in ProB

ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Verifying protocol conformance for logic-based communicating agents

CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
A polynomial time extension of parallel multiple context-free grammar

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Regular vacuity

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Descriptive typing rules for xcerpt

PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Verifying the conformance of web services to global interaction protocols: a first step

EPEW'05/WS-FM'05 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
Some non-semi-decidability problems for linear and deterministic context-free languages

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Computing the follow automaton of an expression

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Minimal unambiguous εNFA

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State complexity and the monoid of transformations of a finite set

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Parametric weighted finite automata for figure drawing

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Regular expressions for two-dimensional languages over one-letter alphabet

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Input reversals and iterated pushdown automata: a new characterization of khabbaz geometric hierarchy of languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Journal of Computer and System Sciences
Adaptive star grammars

ICGT'06 Proceedings of the Third international conference on Graph Transformations
Expressive completeness of an event-pattern reactive programming language

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Equilibria in quantitative reachability games

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
PSL model checking and run-time verification via testers

FM'06 Proceedings of the 14th international conference on Formal Methods
Propositional tree automata

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
On the complexity of the equational theory of relational action algebras

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Enhanced regular path queries on semistructured databases

EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Incremental learning of context free grammars by bridging rule generation and search for semi-optimum rule sets

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Stochastic analysis of lexical and semantic enhanced structural language model

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Protein motif prediction by grammatical inference

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
A merging states algorithm for inference of RFSAs

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Complexity of the satisfiability problem for a class of propositional schemata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Equivalence and inclusion problem for strongly unambiguous büchi automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Pregroup grammars with letter promotions

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The inclusion problem for regular expressions

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
An architecture for self-organising evolvable virtual machines

Engineering Self-Organising Systems
Automatic image description based on textual data

Journal on Data Semantics VII
Model theory for process algebra

Processes, Terms and Cycles
On teaching fast adder designs: revisiting ladner & fischer

Theoretical Computer Science
State

Theoretical Computer Science
Algebraic properties of LA-languages

Information Sciences: an International Journal
The relationships among several types of fuzzy automata

Information Sciences: an International Journal
On the containment and equivalence problems for two-way transducers

Theoretical Computer Science
Algebraic structures of automata

Theoretical Computer Science
A model for security vulnerability pattern

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Synchronizing behavioural mismatch in software composition

FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Context-Dependent nondeterminism for pushdown automata

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Prime decompositions of regular languages

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On weakly ambiguous finite transducers

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On some variations of two-way probabilistic finite automata models

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Selected decision problems for square-refinement collage grammars

Algebraic Foundations in Computer Science
Deterministic dynamic monitors for linear-time assertions

FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Conformon p systems and topology of information flow

WMC'09 Proceedings of the 10th international conference on Membrane Computing
Computer science in primary schools – not possible, but necessary?!

ISSEP'11 Proceedings of the 5th international conference on Informatics in Schools: situation, Evolution and Perspectives
An extension of complex role inclusion axioms in the description logic SROIQ

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A maple package for conditional event algebras

WCII'02 Proceedings of the 2002 international conference on Conditionals, Information, and Inference
Turing machine representation in temporal concept analysis

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
A formal framework to reduce communications in communication systems

IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Borel ranks and wadge degrees of context free ω-languages

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
An incremental algorithm for constructing minimal deterministic finite cover automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Deterministic recognition of trees accepted by a linear pushdown tree automaton

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Size reduction of multitape automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
On two-dimensional pattern matching by finite automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
The safety simple subset

HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
Classical computability and fuzzy turing machines

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Verification of protocol conformance and agent interoperability

CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Semantics for UML model transformation and generation of regular grammar

ACM SIGSOFT Software Engineering Notes
Automatic verification of parameterized data structures

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A symbolic analysis framework for static analysis of imperative programming languages

Journal of Systems and Software
Sensing and Filtering: A Fresh Perspective Based on Preimages and Information Spaces

Foundations and Trends in Robotics
Iterated hairpin completions of non-crossing words

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Parikh's theorem and descriptional complexity

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Efficient and formal generalized symbolic execution

Automated Software Engineering
Transaction models for Web accessibility

World Wide Web
Bounded underapproximations

Formal Methods in System Design
A practical algorithm for intersecting weighted context-free grammars with finite-state automata

FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Characterizations of complete residuated lattice-valued finite tree automata

Fuzzy Sets and Systems
A comment on “Automata theory based on complete residuated lattice-valued logic: Pushdown automata”

Fuzzy Sets and Systems
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata

Theoretical Computer Science
The complexity of evaluating path expressions in SPARQL

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The derivational complexity of string rewriting systems

Theoretical Computer Science
Safety, translation and evaluation of alignment calculus

ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
A general approach to speech recognition

MIRO'95 Proceedings of the Final conference on Multimedia Information Retrieval
Groups, graphs, languages, automata, games and second-order monadic logic

European Journal of Combinatorics
Round-trip software engineering with codedesigner RAD

BICA'12 Proceedings of the 5th WSEAS congress on Applied Computing conference, and Proceedings of the 1st international conference on Biologically Inspired Computation
A finite-state machine approach for modeling and analyzing restful systems

Journal of Web Engineering
Modeling and mining of learnflows

Transactions on Petri Nets and Other Models of Concurrency V
Brief Paper: On the Markov Property of Quantised State Measuirement Sequences

Automatica (Journal of IFAC)
Computing with infinite argumentation frameworks: the case of AFRAs

TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Two-Way automata making choices only at the endmarkers

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Characterizing the rational functions by restarting transducers

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Maximally permissive mutually and globally nonblocking supervision with application to switching control

Automatica (Journal of IFAC)
Protocol converter generation using the STS approach

Computer Communications
Oblivious two-way finite automata: decidability and complexity

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Design of simplified protocol converters through protocol complementation

Computer Communications
A formal approach to subgrammar extraction for NLP

Mathematical and Computer Modelling: An International Journal
Language-Theoretic abstraction refinement

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Subgame perfection for equilibria in quantitative reachability games

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Bus versus cellular automata, and ultimate limitations of parallel processing

Mathematical and Computer Modelling: An International Journal
The emptiness problem for CA limit sets

Mathematical and Computer Modelling: An International Journal
Enforceable security policies revisited

POST'12 Proceedings of the First international conference on Principles of Security and Trust
A method for detecting structure in polyhedra

Pattern Recognition Letters
A new character recognition scheme with lower ambiguity and higher recognizability

Pattern Recognition Letters
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules

Theoretical Computer Science
Deciding regularity of hairpin completions of regular languages in polynomial time

Information and Computation
Descriptional complexity of two-way pushdown automata with restricted head reversals

Theoretical Computer Science
Sampling different kinds of acyclic automata using Markov chains

Theoretical Computer Science
A finite state intersection approach to propositional satisfiability

Theoretical Computer Science
The compass that steered robotics

Logic and Program Semantics
Symbolic tree transducers

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
SAN lite-solver: a user-friendly software tool to solve SAN models

Proceedings of the 2012 Symposium on Theory of Modeling and Simulation - DEVS Integrative M&S Symposium
Regular path queries on large graphs

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
On the Magnitude of Completeness Thresholds in Bounded Model Checking

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Perfect Model for Bounded Verification

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Generative Power of ω-Grammars and ω-Automata

Fundamenta Informaticae
Spiking Neural dP Systems

Fundamenta Informaticae
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On Approximating Non-regular Languages by Regular Languages

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Characterizations and Existence of Easy Sets without Hard Subsets

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Modelling of Complex Systems: Systems as Dataflow Machines

Fundamenta Informaticae - Machines, Computations and Universality, Part II
On inverse operations and their descriptional complexity

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Descriptional complexity of pushdown store languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Minimal DFA for symmetric difference NFA

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Computing the edit-distance between a regular language and a context-free language

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Semigroups with a context-free word problem

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Generalized derivations with synchronized context-free grammars

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
From equivalence to almost-equivalence, and beyond--minimizing automata with errors

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
States and heads do count for unary multi-head finite automata

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Converting nondeterministic automata and context-free grammars into parikh equivalent deterministic automata

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Accepting Networks of Genetic Processors are computationally complete

Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal

Fundamenta Informaticae
On Rational Stochastic Languages

Fundamenta Informaticae
Preferential Regular Path Queries

Fundamenta Informaticae
On Metalinear CD Grammar Systems

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Spectral Domain Boundaries in Cellular Automata

Fundamenta Informaticae - Special issue on DLT'04
Types for coordinating secure behavioural variations

COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages

Fundamenta Informaticae
An efficient linear pseudo-minimization algorithm for aho-corasick automata

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Regularity problems for weak pushdown ω-automata and games

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Interpreted Trajectories

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Nondeterministic Bimachines and Rational Relations with Finite Codomain

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
One-reversal counter machines and multihead automata: Revisited

Theoretical Computer Science
Results on Transforming NFA into DFCA

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Time and Synchronization in Membrane Systems

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
New Iteration Lemmata for Regular Languages

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On Winning Conditions of High Borel Complexity in Pushdown Games

Fundamenta Informaticae
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank

Fundamenta Informaticae
Dynamic Hierarchical Machines

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
The Intrinsic Complexity of Learning: A Survey

Fundamenta Informaticae
On One-Way Cellular Automata with a Fixed Number of Cells

Fundamenta Informaticae - Cellular Automata
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory

Fundamenta Informaticae
Trajectory-Based Embedding Relations

Fundamenta Informaticae
Residual Finite State Automata

Fundamenta Informaticae
On Interacting Automata with Limited Nondeterminism

Fundamenta Informaticae - Cellular Automata
Pebble Automata. Figures Families Recognition and Universality

Fundamenta Informaticae - Cellular Automata
From Mirkin's Prebases to Antimirov's Word Partial Derivatives

Fundamenta Informaticae
Decomposing Timed Push Down Automata

Fundamenta Informaticae
Pregroup grammars with letter promotions: Complexity and context-freeness

Journal of Computer and System Sciences
The inclusion problem for regular expressions

Journal of Computer and System Sciences
Reversible pushdown automata

Journal of Computer and System Sciences
Operator precedence and the visibly pushdown property

Journal of Computer and System Sciences
On the complexity of minimizing probabilistic and quantum automata

Information and Computation
Multi-Bracketed Contextual Rewriting Grammars

Fundamenta Informaticae
A Relation Between Unambiguous Regular Expressions and Abstract Data Types

Fundamenta Informaticae
Remarks on Operations Suggested by Mutations in Genomes

Fundamenta Informaticae
Chomsky Hierarchy And Systolic Y-Tree Automata

Fundamenta Informaticae
On The Computational Complexity of Marcus Contextual Languages

Fundamenta Informaticae
Pattern Ambiguities for Pure Context—Free Grammars

Fundamenta Informaticae
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes

Fundamenta Informaticae
Jumping Petri Nets. Specific Properties

Fundamenta Informaticae
(UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE GRAMMARS

Fundamenta Informaticae
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY

Fundamenta Informaticae
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY

Fundamenta Informaticae
An information-theoretic framework for image complexity

Computational Aesthetics'05 Proceedings of the First Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements

Theoretical Computer Science
Rational Processes And Linear Systems In Gsp

Fundamenta Informaticae
A Survey of Results on Stateless Multicounter Automata

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths

Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case

Natural Computing: an international journal
Geometric Representations for Minimalist Grammars

Journal of Logic, Language and Information
On the security of PPPoE network

Security and Communication Networks
Ubiquity symposium: Evolutionary computation and the processes of life: on the role of evolutionary models in computing

Ubiquity
Fractal unfolding: a metamorphic approach to learning to parse recursive structure

CMCL '12 Proceedings of the 3rd Workshop on Cognitive Modeling and Computational Linguistics
Local testing of message sequence charts is difficult

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A context-dependent XML compression approach to enable business applications on mobile devices

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Automatic derivation of compositional rules in automated compositional reasoning

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Pushdown module checking with imperfect information

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
State complexity of basic operations on suffix-free regular languages

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On Watson-Crick automata

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Polarizationless P systems with active membranes working in the minimally parallel mode

UC'07 Proceedings of the 6th international conference on Unconventional Computation
Probabilistic automata for computing with words

Journal of Computer and System Sciences
A measure of tortuosity based on chain coding

Pattern Recognition
A hybrid MIP/CP approach for multi-activity shift scheduling

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A succinct canonical register automaton model for data domains with binary relations

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Linear-Time model-checking for multithreaded programs under scope-bounding

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Counterexample guided synthesis of monitors for realizability enforcement

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A context-free linear ordering with an undecidable first-order theory

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On union-free and deterministic union-free languages

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
New Undecidability Results for Properties of Term Rewrite Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Pushdown module checking with imperfect information

Information and Computation
Optimized temporal monitors for SystemC

Formal Methods in System Design
Checking NFA equivalence with bisimulations up to congruence

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lfg generation by grammar specialization

Computational Linguistics
Motivation management in AGI systems

AGI'12 Proceedings of the 5th international conference on Artificial General Intelligence
On efficient algorithms for SAT

CMC'12 Proceedings of the 13th international conference on Membrane Computing
Improving regular-expression matching on strings using negative factors

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
GPU acceleration of regular expression matching for large datasets: exploring the implementation space

Proceedings of the ACM International Conference on Computing Frontiers
Descriptional complexity of determinization and complementation for finite automata

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Descriptional complexity of bounded context-free languages

Information and Computation
Simplifying XML Schema: Single-type approximations of regular tree languages

Journal of Computer and System Sciences
A distributed protocol for motion coordination in free-range vehicular systems

Automatica (Journal of IFAC)
Automatic synthesis of modular connectors via composition of protocol mediation patterns

Proceedings of the 2013 International Conference on Software Engineering
Enforceable Security Policies Revisited

ACM Transactions on Information and System Security (TISSEC)
High-performance hardware monitors to protect network processors from data plane attacks

Proceedings of the 50th Annual Design Automation Conference
Fine-tuning the search for microsatellites

Journal of Discrete Algorithms
A balance of power: expressive, analyzable controller programming

Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
The complexity of regular expressions and property paths in SPARQL

ACM Transactions on Database Systems (TODS) - Invited papers issue
Banana Algebra: Compositional syntactic language extension

Science of Computer Programming
Graph-theoretic formalization of hybridization in DNA sticker complexes

Natural Computing: an international journal
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata

Information and Computation
Bounded repairability of word languages

Journal of Computer and System Sciences
Single-tape and multi-tape Turing machines through the lens of the Grossone methodology

The Journal of Supercomputing
State succinctness of two-way finite automata with quantum and classical states

Theoretical Computer Science
A complete proof system for propositional projection temporal logic

Theoretical Computer Science
Non-blocking parallel subset construction on shared-memory multicore architectures

AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Brzozowski's minimization algorithm: more robust than expected

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Input-Driven queue automata: finite turns, decidability, and closure properties

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Incomplete transition complexity of basic operations on finite languages

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Automata for infinite argumentation structures

Artificial Intelligence
Deterministic compilation of temporal safety properties in explicit state model checking

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Branching-time model-checking of probabilistic pushdown automata

Journal of Computer and System Sciences
Managing the network with Merlin

Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Minimization of symbolic automata

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Linear temporal logic and linear dynamic logic on finite traces

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A mechanisation of some context-free language theory in HOL4

Journal of Computer and System Sciences
Branching-time logics with path relativisation

Journal of Computer and System Sciences
Binary trees as a computational framework

Computer Languages, Systems and Structures
Fuzzy local ω-systems

Journal of Discrete Algorithms
Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors

The Journal of Supercomputing
On Equilibria in Quantitative Games with Reachability/Safety Objectives

Theory of Computing Systems
Adaptive finite state machine based visual autonomous navigation system

Engineering Applications of Artificial Intelligence
Finding the smallest binarization of a CFG is NP-hard

Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata

Formal Methods in System Design
EXTRACTION OF PROCESS TYPES AND REMARKABLE STEPS ON BEHAVIOR BASED DIAGRAMS

Journal of Integrated Design & Process Science
EXTRACTION OF DATABASE TABLE DESIGN BY TRANSACTIONS

Journal of Integrated Design & Process Science
From Monadic Second-Order Definable String Transformations to Transducers

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
From Two-Way to One-Way Finite State Transducers

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Functions Computable with Nonadaptive Queries to NP

Theory of Computing Systems
Computing Issues of Asynchronous CA

Fundamenta Informaticae
The Complexity of Szilard Languages of Matrix Grammars Revisited

Fundamenta Informaticae
Effective verification of confidentiality for multi-threaded programs

Journal of Computer Security - Foundational Aspects of Security

Quantified Score

Hi-index	0.20

Visualization

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.