We develop an algebraic theory on semiring-semimodule pairs for ω-context-free languages. We define ω-algebraic systems and characterize their solutions of order k by behaviors of algebraic finite automata. These solutions are then set in correspondence to ω-context-free languages.
|Number of pages||13|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - Jan 1 2004|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)