Work

L(A) = L(B)? Decidability Results from Complete Formal Systems

Year: 2002

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-45465-9_4

Author: Géraud Sénizergues

Institution: Université de Bordeaux

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1541953080

FWCI:

Cites:

Cited by: 12

Related to: 10