Church-Rosser Thue systems and formal languages

Authors:
Robert McNaughton;Paliath Narendran;Friedrich Otto
Affiliations:
Rensselaer Polytechnic Institute, Troy, NY;General Electric CR&D, Schenectady, NY;State Univ. of New York at Albany, Albany
Venue:
Journal of the ACM (JACM)
Year:
1988

Citing 9
Cited 49

NTS languages are deterministic and congruential

Journal of Computer and System Sciences
Formal languages

Formal languages
Computational Complexity of One-Tape Turing Machine Computations

Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Derivations et Redutions dans les Grammaires Algebriques

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Finite and infinite regular thue systems

Finite and infinite regular thue systems
Church-rosser and related thue systems (word problem, rewrite rules, congruence)

Church-rosser and related thue systems (word problem, rewrite rules, congruence)

Church-Rosser Languages vs. UCFL

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Prefix Languages of Church-Rosser Languages

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Connections between Rewriting and Formal Language Theory

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Normal Form for Church-Rosser Language Systems

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Some Regular Languages That Are Church-Rosser Congruential

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
McNaughton families of languages

Theoretical Computer Science
The context-splittable normal form for Church--Rosser language systems

Information and Computation - RTA 2001
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation
Context-free languages can be accepted with absolutely no space overhead

Information and Computation
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics
Learning deterministic context free grammars: The Omphalos competition

Machine Learning
LARS: A learning algorithm for rewriting systems

Machine Learning
Restarting automata with restricted utilization of auxiliary symbols

Theoretical Computer Science - Implementation and application of automata
Observation of String-Rewriting Systems

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Degrees of non-monotonicity for restarting automata

Theoretical Computer Science
Lower bound technique for length-reducing automata

Information and Computation
The size of Higman-Haines sets

Theoretical Computer Science
On the Computational Capacity of Parallel Communicating Finite Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Non-recursive trade-offs for deterministic restarting automata

Journal of Automata, Languages and Combinatorics
The Boolean Closure of Growing Context-Sensitive Languages

Fundamenta Informaticae
How to make biological systems compute: simply observe them

Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Church-Rosser groups and growing context-sensitive groups

Journal of Automata, Languages and Combinatorics
Note: A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems

Theoretical Computer Science
Context-free languages can be accepted with absolutely no space overhead

Information and Computation
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
Computing by observing: Simple systems and simple observers

Theoretical Computer Science
Clearing Restarting Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Characterizing the regular languages by nonforgetting restarting automata

DLT'11 Proceedings of the 15th international conference on Developments in language theory
On restarting automata with window size one

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Completion attacks and weak keys of oleshchuk’s public key cryptosystem

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Probabilistic length-reducing automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Shrinking restarting automata

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Shrinking multi-pushdown automata

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the complexity of 2-monotone restarting automata

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On CD-systems of stateless deterministic R-automata with window size one

Journal of Computer and System Sciences
The boolean closure of growing context-sensitive languages

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Restricting the use of auxiliary symbols for restarting automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Regular languages are church-rosser congruential

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Growing Grammars and Length-reducing Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Characterizing languages by normalization and termination in string rewriting

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The Boolean Closure of Growing Context-Sensitive Languages

Fundamenta Informaticae
Observation of String-Rewriting Systems

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Star-free languages are Church-Rosser congruential

Theoretical Computer Science
Parallel parsing of operator precedence grammars

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Since about 1971, much research has been done on Thue systems that have properties that ensure viable and efficient computation. The strongest of these is the Church-Rosser property, which states that two equivalent strings can each be brought to a unique canonical form by a sequence of length-reducing rules. In this paper three ways in which formal languages can be defined by Thue systems with this property are studied, and some general results about the three families of languages so determined are studied.