Report on the algorithmic language ALGOL 60
Communications of the ACM
Journal of the ACM (JACM)
The Cellar Principle of State Transition and Storage Allocation
IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
An introduction to ultimately periodic sets of integers
ACM SIGACT News
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Some Recursively Unsolvable Problems in ALGOL-Like Languages
Journal of the ACM (JACM)
Operations Which Preserve Definability in Languages
Journal of the ACM (JACM)
Quotients of Context-Free Languages
Journal of the ACM (JACM)
Solvability of Machine Mappings of Regular Sets to Regular Sets
Journal of the ACM (JACM)
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Mappings of languages by two-tape devices
Journal of the ACM (JACM)
Ambiguity in context free languages
Journal of the ACM (JACM)
On the Syntax of Algorithmic Languages
Journal of the ACM (JACM)
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
Journal of the ACM (JACM)
Matrix Equations and Normal Forms for Context-Free Grammars
Journal of the ACM (JACM)
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
Journal of the ACM (JACM)
The role of programming in a Ph.D. computer science program
Communications of the ACM
An extension of ALGOL-like languages
Communications of the ACM
Mechanical languages: a course specification
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
Information and Computation
Forty years of formal power series in automata theory
A half-century of automata theory
Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On decomposing languages defined by parallel devices
STOC '75 Proceedings of seventh 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
Transformations and translations from the point of view of generalized finite automata theory
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
ACM '67 Proceedings of the 1967 22nd national conference
Invited papers—1: basic concepts of automata theory
ACM '65 Proceedings of the 1965 20th national conference
The evaluation, classification and interpretation of expressions
ACM '64 Proceedings of the 1964 19th ACM national conference
A new algorithm for regularizing one-letter context-free grammars
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2004
Generating all permutations by context-free grammars in Chomsky normal form
Theoretical Computer Science - Algebraic methods in language processing
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Language equations with complementation: Decision problems
Theoretical Computer Science
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Information and Computation
On the Computational Completeness of Equations over Sets of Natural Numbers
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Generating all permutations by context-free grammars in Greibach normal form
Theoretical Computer Science
Compiler generation using formal specification of procedure-oriented and machine languages
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Conjunctive Grammars with Restricted Disjunction
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Bi-inductive structural semantics
Information and Computation
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation
Journal of Computer and System Sciences
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Decision problems for language equations
Journal of Computer and System Sciences
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Conjunctive grammars with restricted disjunction
Theoretical Computer Science
Grammar analysis and parsing by abstract interpretation
Program analysis and compilation, theory and practice
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Least and greatest solutions of equations over sets of integers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
Univariate Equations Over Sets of Natural Numbers
Fundamenta Informaticae
Grammar semantics, analysis and parsing by abstract interpretation
Theoretical Computer Science
Context-free languages, coalgebraically
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Language equations with complementation: Expressive power
Theoretical Computer Science
LR parsing for boolean grammars
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Strict language inequalities and their decision problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Language equations with complementation
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Parikh's theorem and descriptional complexity
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Equations x+a=b and (x+x)+c=(x−x)+d over sets of natural numbers
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Descriptional complexity of bounded context-free languages
Information and Computation
RC'13 Proceedings of the 5th international conference on Reversible Computation
| Hi-index | 0.08 |