A hierarchy of random context grammars and automata

A hierarchy of random context grammars and automata

Ph.D. (Computer Science) === Traditionally a formal language can be characterized in two ways: by a generative device (a grammar) and an acceptive device (an automaton). The characterization of two- and three-dimensional Random Context Grammars by two- and three-dimensional Random Context Automata a...

Full description

Bibliographic Details
Main Author: Ehlers, Elizabeth Marie
Published: 2014
Subjects:
Machine theory
Formal languages
Artificial intelligence
Online Access:http://hdl.handle.net/10210/10004

Internet

http://hdl.handle.net/10210/10004

Similar Items