1999
Automatic Data Restructuring.
J. Univers. Comput. Sci., 1999
1998
Regular Sequence Operations and Their Use in Database Queries.
J. Comput. Syst. Sci., 1998
1995
Interval Queries on Object Histories.
Theor. Comput. Sci., 1995
On Decompositions of Chain Datalog Programs into <i>P</i> (left-)linear 1-rule Components.
J. Log. Program., 1995
1993
Content-Related Interval Queries on Object Histories
Inf. Comput., March, 1993
Object and Spreadsheet Histories.
Proceedings of the Temporal Databases: Theory, Design, and Implementation., 1993
1992
Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data.
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992
1991
Localizable Constraints for Object Histories.
Theor. Comput. Sci., 1991
1990
On the Decomposition of Datalog Program Mappings.
Theor. Comput. Sci., 1990
Input-Dependent-Only Object Histories.
J. Comput. Syst. Sci., 1990
1989
Decision Problems of Object histories
Inf. Comput., November, 1989
Cohesion of Object Histories.
Theor. Comput. Sci., 1989
1988
Object-History and Spreadsheet P-Simulation.
Proceedings of the ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31, 1988
1987
Object Histories Which Avoid Certain Subsequences
Inf. Comput., May, 1987
Canonical Forms for Interval Functions.
Theor. Comput. Sci., 1987
1986
Computation-Tuple Sequences and Object Histories.
ACM Trans. Database Syst., 1986
Projection of Object Histories.
Theor. Comput. Sci., 1986
Sort sets in the relational model.
J. ACM, 1986
Tuple sequences and lexicographic indexes.
J. ACM, 1986
1985
On Completing Tables to Satisfy Functional Dependencies.
Theor. Comput. Sci., 1985
Computation-Tuple Sequences and Object Histories: Extended Abstract.
Proceedings of the Foundations of Data Organization, 1985
1984
Interval Queries on Object Histories: Extended Abstract.
Proceedings of the Tenth International Conference on Very Large Data Bases, 1984
Tuple Sequences and Indexes.
Proceedings of the Automata, 1984
1983
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families.
Theor. Comput. Sci., 1983
Order Dependency in the Relational Model.
Theor. Comput. Sci., 1983
On the Equality of Grammatical Families.
J. Comput. Syst. Sci., 1983
1982
Position-Restricted Grammar Forms and Grammars.
Theor. Comput. Sci., 1982
A Prime Decomposition Theorem for Grammatical Families.
J. Comput. Syst. Sci., 1982
Properties of functional-dependency families.
J. ACM, 1982
Tree acceptors and grammar forms.
Computing, 1982
1981
Strict Interpretations of Deterministic Pushdown Acceptors.
Math. Syst. Theory, 1981
Ordered Attribute Domains in the Relational Model.
Proceedings of the XP2 Workshop on Relational Database Theory, 1981
Characterization for Functional Dependency and Boyce-Codd Normal Form Databases.
Proceedings of the XP2 Workshop on Relational Database Theory, 1981
1979
On Strict Interpretations of Grammar Forms.
Math. Syst. Theory, 1979
1978
Dynamic Syntax Specification Using Grammar Forms.
IEEE Trans. Software Eng., 1978
Precedence Relations in Grammar Forms.
Acta Informatica, 1978
1977
Theor. Comput. Sci., 1977
Derivation Complexity in Context-Free Grammar Forms.
SIAM J. Comput., 1977
The Structure of Context-Free Grammatical Families.
J. Comput. Syst. Sci., 1977
On quasi-interpretations of grammar forms.
Computing, 1977
A survey of grammar forms - 1977.
Acta Cybern., 1977
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms.
Proceedings of the Fundamentals of Computation Theory, 1977
1976
Some Uniformly Erasable Families of Languages.
Theor. Comput. Sci., 1976
Size complexity in context-free grammars forms.
J. ACM, 1976
On strongly equivalent context-free grammar forms.
Computing, 1976
On Strict Interpretations of Grammar Forms.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976
1975
TOL Schemes and Control Sets
Inf. Control., February, 1975
J. Comput. Syst. Sci., 1975
Context-Free Grammar Forms.
J. Comput. Syst. Sci., 1975
Substitution of Grammar Forms.
Acta Informatica, 1975
Comparative Complexity of Grammar Forms
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975
1974
On the Periodicity of Word-Length in DOL Languages
Inf. Control., September, 1974
On Incomparable Abstract Family of Languages (AFL).
J. Comput. Syst. Sci., 1974
The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors.
J. Comput. Syst. Sci., 1974
Characterization of Context-Free Grammatical Families
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974
1973
Intersection-Closed Full AFL and the Recursively Enumerable Languages
Inf. Control., April, 1973
IEEE Trans. Computers, 1973
On AFL Generators for Finitely Encoded AFA.
J. Comput. Syst. Sci., 1973
Substitution and (Semi-)AFL.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973
1972
On the Largest Full SubAFL of an AFL.
Math. Syst. Theory, 1972
Multi-Stack-Counter Languages.
Math. Syst. Theory, 1972
Structured-Storage AFA (Abstract).
Proceedings of the Formal Aspects of Cognitive Processes, 1972
1971
Images of AFL under Certain Families of Homomorphisms.
Math. Syst. Theory, 1971
AFL with the Semilinear Property.
J. Comput. Syst. Sci., 1971
1970
On the Closure of AFL under Reversal
Inf. Control., November, 1970
J. Comput. Syst. Sci., 1970
Two-way balloon automata and AFL.
J. ACM, 1970
Substitution in families of languages.
Inf. Sci., 1970
On the existence of generators for certain AFL.
Inf. Sci., 1970
1969
A Mathematical Model of Transformational Grammars
Inf. Control., October, 1969
1968
On the Elimination of Endmarkers
Inf. Control., February, 1968
Control Sets on Grammars.
Math. Syst. Theory, 1968
Derivation-Bounded Languages.
J. Comput. Syst. Sci., 1968
One-way nondeterministic real-time list-storage languages.
J. ACM, 1968
A Note on Preservation of Languages by Transducers
Inf. Control., 1968
1967
Bracketed Context-Free Languages.
J. Comput. Syst. Sci., 1967
Stack automata and compiling.
J. ACM, 1967
Abstract Families of Languages
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967
1966
Deterministic Context Free Languages
Inf. Control., December, 1966
Mappings which Preserve Context Sensitive Languages
Inf. Control., December, 1966
Preservation of Languages by Transducers
Inf. Control., April, 1966
Preservation of unambiguity and inherent ambiguity in context-free languages.
J. ACM, 1966
Ambiguity in context free languages.
J. ACM, 1966
One-Way Stack Automata (Extended Abstract)
Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966
1965
Mappings of languages by two-tape devices.
J. ACM, 1965
1964
Solvability of Machine Mappings of Regular Sets to Regular Sets.
J. ACM, 1964
1963
Quotients of Context-Free Languages.
J. ACM, 1963
Operations Which Preserve Definability in Languages.
J. ACM, 1963
Some Recursively Unsolvable Problems in ALGOL-Like Languages.
J. ACM, 1963
1962
Examples of Abstract Machines.
IRE Trans. Electron. Comput., 1962
Two Families of Languages Related to ALGOL.
J. ACM, 1962
1961
Compatibility of States in Input-Independent Machines.
J. ACM, 1961
Sets of Tapes Accepted by Different Types of Automata.
J. ACM, 1961
Theory of abstract machines.
Commun. ACM, 1961
1960
Connective Properties Preserved in Minimal State Machines.
J. ACM, 1960
1959
Synthesis of Minimal-State Machines.
IRE Trans. Electron. Comput., 1959
A Technique for the Reduction of a Given Machine to a Minimal-State Machine.
IRE Trans. Electron. Comput., 1959
A Synthesis Technique for Minimal State Sequential Machines.
IRE Trans. Electron. Comput., 1959
On the Reduction of Superfluous States in a Sequential Machine.
J. ACM, 1959
1958
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine.
J. ACM, 1958
Some remarks on abstract machines.
Proceedings of the Preprints of papers presented at the 13th national meeting of the Association for Computing Machinery, 1958
