Journal of the ACM (JACM)
A formal protocol conversion method
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Teaching theory of computation at the junior level
APL '87 Proceedings of the international conference on APL: APL in transition
Undergraduate theory of computation: an approach using simulation tools
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
An annotated bibliography on user interface design
ACM SIGCHI Bulletin
A transaction-based approach to relational database specification
Journal of the ACM (JACM)
A parsing algorithm for unification grammar
Computational Linguistics
Optimal Correspondence of String Subsequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
A data processing performance model for the OSI application layer protocols
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dynamic parsers and evolving grammars
ACM SIGPLAN Notices
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Approximating grammar probabilities: solution of a conjecture
Journal of the ACM (JACM)
Robust learning, smoothing, and parameter tying on syntactic ambiguity resolution
Computational Linguistics
Symbolic optimization of FSM networks based on sequential ATPG techniques
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Computational models of information scent-following in a very large browsable text collection
Proceedings of the ACM SIGCHI Conference on Human factors in computing systems
Efficient composite data flow analysis applied to concurrent programs
Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
IEEE Transactions on Software Engineering
Proceedings of the seventh international conference on Information and knowledge management
Learning deterministic finite automata from smallest counterexamples
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On verification of database temporal constraints
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Developing a natural language interface to complex data
ACM Transactions on Database Systems (TODS)
A transformational grammar-based query processor for access control in a planning system
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Parsing of Graph-Representable Pictures
Journal of the ACM (JACM)
A Grammatical Characterization of One-Way Nondeterministic Stack Languages
Journal of the ACM (JACM)
Linear and Context-Free Graph Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Weak and Mixed Strategy Precedence Parsing
Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Decidable Properties of Monadic Functional Schemas
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
On the Complete Covering Problem for LR(k)Grammars
Journal of the ACM (JACM)
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Even Simple Programs Are Hard To Analyze
Journal of the ACM (JACM)
A Study of Schedules as Models of Synchronous Parallel Computation
Journal of the ACM (JACM)
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM (JACM)
Time Bounded Random Access Machines with Parallel Processing
Journal of the ACM (JACM)
A Purely Homomorphic Characterization of Recursively Enumerable Sets
Journal of the ACM (JACM)
Synchronization Problems Solvable by Generalized PV Systems
Journal of the ACM (JACM)
Stack Machines and Classes of Nonnested Macro Languages
Journal of the ACM (JACM)
On the Correctness of Semantic-Syntax-Directed Translations
Journal of the ACM (JACM)
Complex Properties of Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Morphic Representation of Complements of Recursively Enumerable Sets
Journal of the ACM (JACM)
Dynamic Programming as Graph Searching: An Algebraic Approach
Journal of the ACM (JACM)
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Decidability of Grammar Problems
Journal of the ACM (JACM)
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
SNACC: a parser generator for use with Miranda
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
On deciding stability of scheduling policies in queueing systems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Scenario-Based Hypersequential Programming
International Journal of Parallel Programming - Special issue on international symposium on high performance computing 1997, part I
ACM Transactions on Information and System Security (TISSEC)
A List Structure Form of Grammars for Syntactic Analysis
ACM Computing Surveys (CSUR)
The Vienna Definition Language
ACM Computing Surveys (CSUR)
Data Flow Analysis in Software Reliability
ACM Computing Surveys (CSUR)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Probabilistic Languages: A Review and Some Open Questions
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
On Parsing and Compiling Arithmetic Expressions on Vector Computers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Introduction to S/SL: Syntax/Semantic Language
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Construction of Submodule Specifications and Communication Protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Communications of the ACM
Protection in operating systems
Communications of the ACM
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Deterministic parsing of ambiguous grammars
Communications of the ACM
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
A theory of discrete patterns and their implementation in SNOBOL4
Communications of the ACM
Equivalence between AND/OR graphs and context-free grammars
Communications of the ACM
On the capabilities of while, repeat, and exit statements
Communications of the ACM
A simple technique for structured variable lookup
Communications of the ACM
Computer science: a conceptual framework for curriculum planning
Communications of the ACM
Communications of the ACM
An experimental course in advanced programming methods
ACM SIGCSE Bulletin
Theoretical Computer Science
ACM-SE 14 Proceedings of the 14th annual Southeast regional conference
A parsing method on l-1 bounded context parsing
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Deterministic parsing of ambiguous grammars
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Even simple programs are hard to analyze
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the complexity of the circularity test for attribute grammars
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On deciding stability of constrained random walks and queueing systems
ACM SIGMETRICS Performance Evaluation Review
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Java-based framework to support computer-assisted creation of structured XML documents
ACM SIGAPP Applied Computing Review
A simple hardware model of a Turing machine: its educational use
ACM '72 Proceedings of the ACM annual conference - Volume 1
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
Automated generation of electronic procedures: procedure constraint grammars
Decision Support Systems - Special issue: Formal modeling and electronic commerce
Learning recursive languages from good examples
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Stochastic Finite Learning of the Pattern Languages
Machine Learning
On the power of incremental learning
Theoretical Computer Science
Unified Integration of Explicit Knowledge and Learning by Example in Recurrent Networks
IEEE Transactions on Knowledge and Data Engineering
Non-closure property of space-bounded two-dimensional alternating turing machines
Information Sciences—Applications: An International Journal
Some analytic features of algebraic data
Discrete Applied Mathematics
On the presence of periodic configurations in Turing machines and in counter machines
Theoretical Computer Science
Extensions and submonoids of automatic monoids
Theoretical Computer Science
The homomorphism problem for the free monoid
Discrete Mathematics
Lorentz lattice gases and many-dimensional Turing machines
Collision-based computing
A finite state machine based format model of software pipelined loops with conditions
Progress in computer research
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Solving NP-Complete Problems With Networks of Evolutionary Processors
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Computational Power of Neuroidal Nets
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
VisA: A Tool for Visualizing and Animating Automata and Formal Languages
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On the Strength of Incremental Learning
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Extending Elementary Formal Systems
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Decision Procedure for an Extension of WS1S
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On Variants of Iterative Learning
DS '98 Proceedings of the First International Conference on Discovery Science
A Unifying Approach to HTML Wrapper Representation and Learning
DS '00 Proceedings of the Third International Conference on Discovery Science
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Variants of iterative learning
Theoretical Computer Science
Advanced elementary formal systems
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Borel hierarchy and omega context free languages
Theoretical Computer Science
On omega context free languages which are Borel sets of infinite rank
Theoretical Computer Science
A Logic for Reasoning about Digital Rights
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Two tapes are better than one for nondeterministic machines
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Two-dimensional alternating Turing machines
STOC '82 Proceedings of the fourteenth 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
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Test plan generation using formal grammars
ICSE '79 Proceedings of the 4th international conference on Software engineering
Representation and generation of rectangular dissections
DAC '78 Proceedings of the 15th Design Automation Conference
An approach to describing a data link level protocol with a formal language
SIGCOMM '77 Proceedings of the fifth symposium on Data communications
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Separating tape bounded auxiliary pushdown automata classes
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A useful device for showing the solvability of some decision problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On (un)predictability of formal languages (Extended Abstract)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Degree-languages, polynomial time recognition, and the LBA problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Polynomial and abstract subrecursive classes
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Some restrictions on W-grammars
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A partial solution to the reachability-problem for vector-addition systems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Attributed translations(Extended Abstract)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Computer Science And Recursion Theory
ACM '78 Proceedings of the 1978 annual conference
How to show something is not: Proofs in formal language and computability theory
SIGCSE '78 Proceedings of the ninth SIGCSE technical symposium on Computer science education
On time-space classes and their relation to the theory of real addition
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the complexity of the Maximum Subgraph Problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Indexing of subrecursive classes
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Computable queries for relational data bases (Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On some deterministic space complexity problems
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A language for two-dimensional digital picture processing
The papers of the ACM symposium on Graphic languages
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Time-bounded random access machines
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Maze recognizing automata (Extended Abstract)
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Absolutely parallel grammars and two-way deterministic finite-state transducers
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The degree hierarchy of undecidable problems of formal grammars
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Complexity problems in real time computation
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Closure of families of languages under substitution operators
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Some properties of precedence languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Formal properties of sequential/parallel matrix languages
ACM '76 Proceedings of the 1976 annual conference
Selection processes and their relation to automata
ACM '73 Proceedings of the ACM annual conference
On protection in operating systems
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
Translating recursion schemes into program schemes
Proceedings of ACM conference on Proving assertions about programs
The detection of anomalous interprocedural data flow
ICSE '76 Proceedings of the 2nd international conference on Software engineering
On the probability of deadlock in computer systems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
SIGCSE '73 Proceedings of the third SIGCSE technical symposium on Computer science education
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Classes of pebble games and complete problems
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Recognition of two-dimensional patterns
ACM '77 Proceedings of the 1977 annual conference
A course on the Relationship of Formal Language Theory to Automata
SIGCSE '70 Proceedings of the first SIGCSE technical symposium on Education in computer science
The influence of productions on derivations and parsing (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A complexity theory of grammar problems
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Ambiguity in omega context free languages
Theoretical Computer Science
Journal of Computer and System Sciences
A course on the relationship of formal language theory to automata
ACM SIGCSE Bulletin
Inducing grammars from sparse data sets: a survey of algorithms and results
The Journal of Machine Learning Research
Gödel numbers: a new approach to structured programming
ACM SIGPLAN Notices
A subset algorithm for deterministic FSMs within determinisitic PDAs
ACM SIGPLAN Notices
The homomorphism problem for trace monoids
Theoretical Computer Science - WORDS
Information extraction from case law and retrieval of prior cases
Artificial Intelligence - Special issue on AI and law
A characterization of Thompson digraphs
Discrete Applied Mathematics
FSM-Hume: programming resource-limited systems using bounded automata
Proceedings of the 2004 ACM symposium on Applied computing
Application of a remote code generator
ACM SIGPLAN Notices
Categorial grammars for strata of non-CF languages and their parsers
COLING '86 Proceedings of the 11th coference on Computational linguistics
Operational specification as the basis for rapid prototyping
Proceedings of the workshop on Rapid prototyping
Independence results in computer science
ACM SIGACT News
On teaching theoretical foundations of Computer Science
ACM SIGACT News
Some linguistical problems about colloquies
ACM SIGCOMM Computer Communication Review
Events as atomic contracts for component integration
Data & Knowledge Engineering - Special issue: Contract-driven coordination and collaboration in the internet context
Unsupervised learning of morphology for English and Inuktitut
NAACL-Short '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume of the Proceedings of HLT-NAACL 2003--short papers - Volume 2
Context-sensitive domain-independent algorithm composition and selection
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
On a Construction of Context-free Grammars
Fundamenta Informaticae
Prelanguages Versus Submonoids
Fundamenta Informaticae
On Equations Including Strings
Fundamenta Informaticae
The origins of combinatorics on words
European Journal of Combinatorics
The degree diagram of undecidable problems of formal grammars
ACM SIGACT News
Proceedings of the 6th ACM SIGCHI conference on Creativity & cognition
Universal Modular Trees: A Design Procedure
IEEE Transactions on Computers
Syntactic Recognition of Imperfectly Specified Patterns
IEEE Transactions on Computers
An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation
IEEE Transactions on Computers
Polynomially Complete Fault Detection Problems
IEEE Transactions on Computers
Formal Models of Capability-Based Protection Systems
IEEE Transactions on Computers
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
IEEE Transactions on Computers
Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
IEEE Transactions on Computers
A Class of Push-Down Acceptors for Adjunct Languages
IEEE Transactions on Computers
Inference of Finite-State Probabilistic Grammars
IEEE Transactions on Computers
On Some Open Problems in the Theory of Cellular Automata
IEEE Transactions on Computers
IEEE Transactions on Computers
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
IEEE Transactions on Computers
IEEE Transactions on Computers
Stochastic Syntactic Decoding for Pattern Classification
IEEE Transactions on Computers
Watchdog Processors and Structural Integrity Checking
IEEE Transactions on Computers
A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification
IEEE Transactions on Computers
Solution of an Open Problem on Probabilistic Grammars
IEEE Transactions on Computers
A Search Technique for Clause Interconnectivity Graphs
IEEE Transactions on Computers
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages
IEEE Transactions on Computers
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Towards management of software as assets: A literature review with additional sources
Information and Software Technology
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Operating systems principles and undergraduate computer science curricula
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A syntax-directed approach to pattern recognition and description
AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
Grammar-based classifier system: a universal tool for grammatical inference
WSEAS Transactions on Computers
Geoinformatica
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Formal grammars as models of logic derivations
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
On multi-level machines for continuous speech recognition
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
On stochastic context-free languages
Information Sciences: an International Journal
Complexity problems in real time languages
Information Sciences: an International Journal
Information Sciences: an International Journal
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
Classes of discrete optimization problems and their decision problems
Journal of Computer and System Sciences
A geometric hierarchy of languages
Journal of Computer and System Sciences
Deterministic multitape automata computations
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Syntax directed translations and the pushdown assembler
Journal of Computer and System Sciences
On the density of honest subrecursive classes
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On some questions of rationality and decidability
Journal of Computer and System Sciences
Complexity metatheorems for context-free grammar problems
Journal of Computer and System Sciences
Time bounded random access machines
Journal of Computer and System Sciences
Maze recognizing automata and nondeterministic tape complexity
Journal of Computer and System Sciences
Deterministic one-counter automata
Journal of Computer and System Sciences
Abstract families of length-preserving processors
Journal of Computer and System Sciences
Complexity measures for regular expressions
Journal of Computer and System Sciences
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
A characterization of the power of vector machines
Journal of Computer and System Sciences
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Journal of Computer and System Sciences
1-Way stack automaton with jumps
Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages
Journal of Computer and System Sciences
Hierarchies of turing machines with restricted tape alphabet size
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Some properties of the class of L languages with interactions
Journal of Computer and System Sciences
Dynamics of discrete systems and pattern reproduction
Journal of Computer and System Sciences
The tape-complexity of context-independent developmental languages
Journal of Computer and System Sciences
Formal grammars and the regeneration capability of biological systems
Journal of Computer and System Sciences
Ambiguity in the developmental systems of lindenmayer
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The derivation language of a phrase structure grammar
Journal of Computer and System Sciences
The halting problem for linear turing assemblers
Journal of Computer and System Sciences
A useful device for showing the solvability of some decision problems
Journal of Computer and System Sciences
A homomorphism theorem for weighted context-free grammars
Journal of Computer and System Sciences
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
The relation between derivations and syntactical structures in phrase-structure grammars
Journal of Computer and System Sciences
Generalized overlap resolvable grammars and their parsers
Journal of Computer and System Sciences
A result on the equivalence problem for deterministicpushdown automata
Journal of Computer and System Sciences
Complexity-class-encoding sets
Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Absolutely parallel grammars and two-way finite-state transducers
Journal of Computer and System Sciences
Tessellations with local transformations
Journal of Computer and System Sciences
The Markov algorithm as a language parser-Linear bounds
Journal of Computer and System Sciences
Effective proper procedures and universal classes of program schemata
Journal of Computer and System Sciences
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
A note on multiple-entry finite automata
Journal of Computer and System Sciences
Nonexistence of program optimizers in several abstract settings
Journal of Computer and System Sciences
A generalized approach to formal languages
Journal of Computer and System Sciences
Pushdown automata with counters
Journal of Computer and System Sciences
Journal of Computer and System Sciences
What makes some language theory problems undecidable
Journal of Computer and System Sciences
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On pure multi-pushdown automata that perform complete pushdown pops
Acta Cybernetica
Continuous Petri nets: expressive power and decidability issues
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Church's problem and a tour through automata theory
Pillars of computer science
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
A note on prefixes of regular languages
ACM SIGACT News
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Semantics and Ambiguity of Stochastic RNA Family Models
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
ACMOS'05 Proceedings of the 7th WSEAS international conference on Automatic control, modeling and simulation
Model projection: simplifying models in response to restricting the environment
Proceedings of the 33rd International Conference on Software Engineering
Survey of polynomial transformations between NP-complete problems
Journal of Computational and Applied Mathematics
Δ-clearing restarting automata and CFL
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Context-free languages, coalgebraically
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Logspace complexity of functions and structures
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
May embodiment cause hyper-computation?
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
On the computational power of timed differentiable petri nets
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Inductive inference and language learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Prime decomposition problem for several kinds of regular codes
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Detecting sequences and understanding language with neural associative memories and cell assemblies
Biomimetic Neural Learning for Intelligent Robots
Learning regular expressions from noisy sequences
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Algebraic generating functions in enumerative combinatorics and context-free languages
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An associative cortical model of language understanding and action planning
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
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Codes and length-increasing transitive binary relations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Context-Free grammars and XML languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The church-turing thesis: breaking the myth
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Complexity of stability and controllability of elementary hybrid systems
Automatica (Journal of IFAC)
Inference for transition network grammars
Computer Languages
Why automatic error correctors fail
Computer Languages
The formal definition of semantics by string automata
Computer Languages
Syntax optimization for and parsing of patterns
Computer Languages
Cellular automata models in biology
Mathematical and Computer Modelling: An International Journal
Parallel string acceptance using lattice graphs
Pattern Recognition Letters
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Two-dimensional sgraffito automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Equations Including Strings
Fundamenta Informaticae
Prelanguages Versus Submonoids
Fundamenta Informaticae
On a Construction of Context-free Grammars
Fundamenta Informaticae
Fundamenta Informaticae
Fundamenta Informaticae
TWO LOWER BOUNDS ON DISTRIBUTIVE GENERATION OF LANGUAGES
Fundamenta Informaticae
There exist some ω-powers of any Borel rank
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Turing's three pioneering initiatives and their interplays
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Finding overlaps within regular expressions with variable-length gaps
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Deterministic counter machines and parallel matching computations
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Data-parallel finite-state machines
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
Operating systems principles and undergraduate computer science curricula
ACM SIGMIS Database
ACM SIGMIS Database
Decision Problems for Probabilistic Finite Automata on Bounded Languages
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
| Hi-index | 0.26 |