Trellis Languages

Adrian Atanasiu ()
Additional contact information
Adrian Atanasiu: University of Bucharest, Department of Computer Science, Faculty of Mathematics

Chapter Chapter 16 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 187-198 from Springer

Abstract: Abstract We shall present here a new approach to languages representation, suggested by a technique widely used nowadays in the area of signal coding. Each word of the language is written in an array frame, where rows are words of regular languages and columns are equal length words of a finite language. Some simple properties of languages are presented, together with a “packing” method, which leads to an exprimation of words of a trellis language using a minimal number of symbols.

Keywords: Regular Language; Finite Automaton; Finite Deterministic Automaton; Grammar System; Regular Grammar (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_16

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().