Sheila A. Greibach

Weiping Shi

Shai Simonson

Proceedings of the Theoretical Studies in Computer Science, 1992

1989

A Note on the Best-Case Complexity.

[BibT_eX]

[DOI]

José D. P. Rolim

Inf. Process. Lett., 1989

1988

On the IO-Complexity and Approximation Languages.

[BibT_eX]

[DOI]

José D. P. Rolim

Inf. Process. Lett., 1988

1986

Single-Tape Reset Machines.

[BibT_eX]

[DOI]

Celia Wrathall

RAIRO Theor. Informatics Appl., 1986

Complexity of pattern generation via planar parallel binary fission/fusion grammars.

[BibT_eX]

[DOI]

Jack W. Carlyle

Azaria Paz

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1983

Matching and Spanning in Certain Planar Graphs.

[BibT_eX]

[DOI]

Jack W. Carlyle

Azaria Paz

Math. Syst. Theory, 1983

1982

A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

1981

Comments on the roots of theorems and languages both easy and hard.

[BibT_eX]

[DOI]

SIGACT News, 1981

Formal Languages: Origins and Directions.

[BibT_eX]

[DOI]

IEEE Ann. Hist. Comput., 1981

1980

Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.

[BibT_eX]

[DOI]

J. ACM, 1980

1979

Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia

[BibT_eX]

[DOI]

Inf. Control., July, 1979

Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

Monadic Recursion Schemes: The Effect of Constants.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

Reset Machines.

[BibT_eX]

[DOI]

Celia Wrathall

J. Comput. Syst. Sci., 1979

One counter languages and the chevron operation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

1978

Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms

[BibT_eX]

[DOI]

Inf. Control., November, 1978

Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines

[BibT_eX]

[DOI]

Inf. Control., February, 1978

Remarks on Blind and Partially Blind One-Way Multicounter Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

One Way Finite Visit Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

The strong independence of substitution and homomorphic replication.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

The Independence of Certain Operations on semiAFLS.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

Hierarchy Theorems for Two-Way Finite State Transducers.

[BibT_eX]

[DOI]

Acta Informatica, 1978

Comparisons and Reset Machines (Preliminary Report).

[BibT_eX]

[DOI]

Celia Wrathall

Proceedings of the Automata, 1978

1977

Control Sets of Context-Free Grammar Forms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1977

A Note on NSPACE(log2 n) and Substitution.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1977

1976

Remarks on the Complexity of Nondeterministic Counter Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

Some Uniformly Erasable Families of Languages.

[BibT_eX]

[DOI]

Jonathan Goldstine

Theor. Comput. Sci., 1976

1975

Erasable Context-Free Languages

[BibT_eX]

[DOI]

Inf. Control., December, 1975

A Remark on Code Sets and Context-Free Languages.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1975

One Counter Languages and the IRS Condition.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1975

Uniformly Erasable AFL.

[BibT_eX]

[DOI]

Jonathan Goldstine

J. Comput. Syst. Sci., 1975

A Note on the Recognition of One Counter Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1975

Theory of Program Structures: Schemes, Semantics, Verification

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 36, Springer, ISBN: 3-540-07415-5, 1975

1974

Jump PDA's and Hierarchies of Deterministic Context-Free Languages.

[BibT_eX]

[DOI]

SIAM J. Comput., 1974

Some restrictions onW-grammars.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1974

Some Restrictions on W-Grammars

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)

[BibT_eX]

[DOI]

Jack W. Carlyle

Azaria Paz

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

The Hardest Context-Free Language.

[BibT_eX]

[DOI]

SIAM J. Comput., 1973

On AFL Generators for Finitely Encoded AFA.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1973

Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

1972

Erasing in Context-Free AFLs

[BibT_eX]

[DOI]

Inf. Control., December, 1972

Syntactic Operators on Full SemiAFLs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1972

Multitape AFA.

[BibT_eX]

[DOI]

J. ACM, 1972

A generalization of Parikh's semilinear theorem.

[BibT_eX]

[DOI]

Discret. Math., 1972

1971

Characteristic and Ultrarealtime Languages

[BibT_eX]

[DOI]

Inf. Control., February, 1971

Ambiguity in Graphs and Expressions.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1971

1970

Full AFLs and Nested Iterated Substitution

[BibT_eX]

[DOI]

Inf. Control., March, 1970

Chains of Full AFL's.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1970

Quasi-Realtime Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1970

Principal AFL.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

Time- and Tape-Bounded Turing Acceptors and AFLs.

[BibT_eX]

[DOI]

Ben Wegbreit

J. Comput. Syst. Sci., 1970

Tape-Bounded Turing Acceptors and Principal AFLs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract

[BibT_eX]

[DOI]

Ben Wegbreit

Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1969

Scattered Context Grammars.

[BibT_eX]

[DOI]

John E. Hopcroft

J. Comput. Syst. Sci., 1969

Checking Automata and One-Way Stack Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1969

An Infinite Hierarchy of Context-Free Languages.

[BibT_eX]

[DOI]

J. ACM, 1969

Quasi-Realtime Languages-Extended Abstract

[BibT_eX]

[DOI]

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

1968

A Note on Undecidable Properties of Formal Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1968

Checking Automata and One-Way Stack Languages (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

One-way stack automata.

[BibT_eX]

[DOI]

Michael A. Harrison

J. ACM, 1967

Stack automata and compiling.

[BibT_eX]

[DOI]

Michael A. Harrison

J. ACM, 1967

Abstract Families of Languages

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966

Deterministic Context Free Languages

[BibT_eX]

[DOI]

Inf. Control., December, 1966

Mappings which Preserve Context Sensitive Languages

[BibT_eX]

[DOI]

Inf. Control., December, 1966

The Unsolvability of the Recognition of Linear Context-Free Languages.

[BibT_eX]

[DOI]

J. ACM, 1966

One-Way Stack Automata (Extended Abstract)

[BibT_eX]

[DOI]

Michael A. Harrison

Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966

1965

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars.

[BibT_eX]

[DOI]

J. ACM, 1965

1964

Formal parsing systems.

[BibT_eX]

[DOI]

Commun. ACM, 1964

1963

The Undecidability of the Ambiguity Problem for Minimal Linear Grammars

[BibT_eX]

[DOI]