Work

Languages that are Recognized by Simple Counter Automata are not necessarily Testable

Year: 2005

Type: preprint

Source: Electronic colloquium on computational complexity

Authors: Oded Lachish, Ilan Newman

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W52870181

Cites: 7

Cited by: 2

Related to: 10