A hierarchy of real-time deterministic languages and their equivalence

Research output: Contribution to journalArticlepeer-review

Abstract

An infinite hierarchy of real-time deterministic context free languages is introduced. It specializes the hierarchy of all deterministic languages based on the number of accepting configurations in deterministic pushdown automata accepting the languages. The recently found decision procedure for the equivalence of a real-time strict deterministic language and a deterministic language is then used to show that equivalence of two deterministic languages, one of which is real-time of finite rank in the hierarchy, is also decidable. It was recently shown how to decide whether a deterministic language is real-time strict. This result is used to obtain a decision procedure for a deterministic language checking whether it is real-time of finite rank, and computing its rank if it is finite.

Original languageEnglish
Pages (from-to)91-100
Number of pages10
JournalJournal of Computer and System Sciences
Volume24
Issue number1
DOIs
StatePublished - Feb 1982

Fingerprint

Dive into the research topics of 'A hierarchy of real-time deterministic languages and their equivalence'. Together they form a unique fingerprint.

Cite this