Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata

DOI10.1007/978-3-642-31653-1_19zbMath1370.68179MaRDI QIDQ3167496

Christos A. Kapoutsis, Nans Lefebvre

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_19

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions