Bounded fixed-point definability and tabular recognition of languages

DOI10.1007/3-540-61377-3_50zbMATH Open1540.68123MaRDI QIDQ6560180FDOQ6560180

Authors: Hans Leiß 

Publication date: 21 June 2024

Recommendations

• On efficient recognition of transductions and relations
• scientific article; zbMATH DE number 1670480
• First-order definable languages
• scientific article; zbMATH DE number 3958761
• On the expressive power of FO[+]

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• Alternation
• Title not available (Why is that?)
• An efficient recognizer for the Boolean closure of context-free languages
• On multiple context-free grammars
• Relational queries computable in polynomial time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast uniform analysis of Coupled-Context-Free languages

Cited In (1)

• Some questions on polynomially computable representations for generating grammars and Backus-Naur forms

This page was built for publication: Bounded fixed-point definability and tabular recognition of languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560180)