scientific article; zbMATH DE number 3639163

MaRDI QIDQ4198075zbMATH OpenFDO

Authors Michael A. Harrison

Publication date 1978

Cited in

(only showing first 100 items - show all)

Membrane computing with transport and embedded proteins
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
Maximum likelihood analysis of algorithms and data structures
Tests for the LR-, LL-, and LC-regular conditions
Constructing a realtime deterministic pushdown automaton from a grammar
Fundamental properties of infinite trees
Bicentres de langages algébriques
Synchronized EOL forms
On binary equality sets and a solution to the test set conjecture in the binary case
On the equivalence of some transductions involving letter to letter morphisms on regular languages
Complexity and decidability for chain code picture languages
On derivation preservation
Tree pushdown automata
A regularity test for dual bordered OS systems
On test sets for checking morphism equivalence on languages with fair distribution of letters
A homomorphic characterization of recursively enumerable languages
On linear context-free languages and one-way multihead automata
A note on depth-first derivations
A note on Parikh maps, abstract languages, and decision problems
Precedence technique is not worse than SLR(1)
Test sets for morphisms with bounded delay
An undecidable problem for context-free grammars
On permutative grammars generating context-free languages
Classes of regular and context-free languages over countably infinite alphabets
The undecidability of form equivalence for context-free and EOL forms
Order dependency in the relational model
On two problems related to cancellativity
Adherences of DOL languages
Rational languages and the Burnside problem
A pumping lemma for real-time deterministic context-free languages
On coordinated selective substitutions: Towards a unified theory of grammars and machines
Pattern selector grammars and several parsing algorithms in the context- free style
Applications of scheduling theory to formal language theory
On erasing in E0L forms
Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
A property of three-element codes
On morphic generation of regular languages
The theory of ends, pushdown automata, and second-order logic
On total regulators generated by derivation relations
On the impossibility of the homomorphic characterization of context- sensitive languages
Database survivability under dynamic constraints
Analytic models and ambiguity of context-free languages
Rational strong codes and structure of rational group languages
On the size of unambiguous context-free grammars
Handle NLC grammars and r. e. languages
A note on pure grammars
On commutative context-free languages
A Yacc extension for LRR grammar parsing
Parallel parsing of programming languages
Balance of many-valued transductions and equivalence problems
On purely morphic characterizations of context-free languages
Grammars, derivation modes and properties of indexed and type-0 languages
Literal shuffle
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Context-free languages and random walks on groups
Representations of language families by homomorphic equality operations and generalized equality sets
Recording the use of memory in right-boundary grammars and push-down automata
On the active and full use of memory in right-boundary grammars and push- down automata
Cyclic automata
Repeatable words for substitution
The interchange or pump (di)lemmas for context-free languages
Some subclasses of context-free languages in NC^ 1
A note on word chains and regular languages
A representation of recursively enumerable languages by two homomorphisms and a quotient
A unified framework for disambiguating finite transductions
Alternating multihead finite automata
A note on regular classes in special Thue systems
On the generation of powers by OS schemes
A pumping lemma for deterministic context-free languages
Simple computation of LALR(1) lookahead sets
The suffix tree of a tree and minimizing sequential transducers
Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
Comparisons of Parikh's condition to other conditions for context-free languages
A hierarchy of deterministic languages
Iteration theorems for families of strict deterministic languages
Test sets and checking words for homomorphism equivalence
A closure property of deterministic context-free languages
LR(0) grammars generated by LR(0) parsers
An optimal algorithm for computing the repetitions in a word
On the decidability of equivalence for deterministic pushdown transducers
DPDA's in 'Atomic normal form' and applications to equivalence problems
Time complexity of languages recognized by one-way multihead pushdown automata
Sub-regular grammar forms
Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages
A new proof technique to establish equivalence of the original and the generated lambda-free CFG with linear increase in size
A note on grammatical covers
Tree correspondence problems
On the subword complexity of square-free DOL languages
The equivalence problem for LL- and LR-regular grammars
On LLP(k) parsers
Permutations are not context-free: An application of the interchange lemma
Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms
Basic formulas and languages. I: The theory
Basic formulas and languages. II: Applications to EOL systems and forms
On LLP(k) grammars and languages
On the relationship between the LL(k) and LR(k) grammars
The (generalized) Post correspondence problem with lists consisting of two words is decidable
A Noetherian and confluent rewrite system for idempotent semigroups
On the Hotz group of a context-free grammar
A note on two-way nondeterministic pushdown automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198075)