On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy

Authors:
Martin Beaudry;Markus Holzer;Gundula Niemann;Friedrich Otto
Affiliations:
-;-;-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 14
Cited 1

NTS languages are deterministic and congruential

Journal of Computer and System Sciences
The Boolean formula value problem is in ALOGTIME

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Problems complete for deterministic logarithmic space

Journal of Algorithms
Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
String-rewriting systems

String-rewriting systems
On weakly confluent monadic string-rewriting systems

STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Pushdown automata with bounded nondeterminism and bounded ambiguity

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
On the Tape Complexity of Deterministic Context-Free Languages

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

Introduction To Automata Theory, Languages, And Computation
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the Complexities of Linear LL(1) and LR(1) Grammars

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

By generalizing the Church-Rosser languages the McNaughton families of languages are obtained. Here we concentrate on those families that are defined by monadic or special string-rewriting systems. We investigate the relationship of these families to each other and to the lower classes of the Chomsky hierarchy and present some closure and some non-closure properties for them. Moreover, we address some complexity issues for their membership problems.