Christiane Bercoff A Family of p-Uniform Tag Systems for p-Paperfolding Sequences. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:3-12 [Conf]
Julien Cassaigne Special Factors of Sequences with Linear Subword Complexity. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:25-34 [Conf]
Lucian Ilie On Disjunctivity, Ultimate Periodicity and Ultimate Identity. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:44-53 [Conf]
Gianina Georgescu The Orthogonality of Some Complexity Measures of Context-Free Languages. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:73-78 [Conf]
Markus Holzer On Emptiness and Counting for Alternating Finite Automata. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:88-97 [Conf]
Masami Ito Height Functions and Linear Languages. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:98-101 [Conf]
Marjo Lipponen On F-Prime Solutions of the Post Correspondence Problem. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:139-147 [Conf]
Andreas Weber Transforming a Single-Valued Transducer Into a Mealy Machine. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:176-185 [Conf]
Igor Baník Colonies as Systems of Turing Machines Without States. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:189-198 [Conf]
Liming Cai The Computational Complexity of PCGS with Regular Components. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:209-219 [Conf]
Rudolf Freund Array Grammars with Prescribed Teams of Array Productions. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:220-229 [Conf]
Juraj Hromkovic On the Communication Complexity of Distributive Language Generation. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:237-246 [Conf]
Valeria Mihalache Szilard Languages Associated to Parallel Communicating Grammar Systems. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:247-256 [Conf]
Owen Rambow Imposing Vertical Context Conditions on Derivations. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:257-266 [Conf]
Giorgio Satta The Membership Problem for Unordered Vector Languages. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:267-275 [Conf]
Heiko Dörr Computing an Upper Bound for SVS(gg) by Abstract Interpretation. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:279-288 [Conf]
Frank Drewes On the Connectedness of Pictures Defined by Iterated Function Systems. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:289-298 [Conf]
Dora Giammarresi Finite State Recognizability for Two-Dimensional Languages: A Brief Survey. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:299-308 [Conf]
Peter Hartmann Efficient Subgraph Matching Within Cellular Hypergraphs. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:309-318 [Conf]
Peter R. J. Asveld Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:443-453 [Conf]
Blanca Cases From Synonymy to Self-Modifying Automata: Q-Diam Language. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:454-459 [Conf]
José Fortes Gálvez A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:460-465 [Conf]
Mark-Jan Nederhof Reversible Pushdown Automata and Bidirectional Parsing. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:472-481 [Conf]
Ulrich Nitsche A Finitary-Language Semantics for Propositional Linear Temporal Logic. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1995, pp:482-489 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
