Logic and Branching Automata

DOI10.2168/LMCS-11(4:2)2015MaRDI QIDQ5895230zbMATH OpenFDO

Authors Nicolas Bedon

Publication date 29 October 2015

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-11(4:2)2015

zbMATH Keywords

automatacommutative monoidsmonadic second-order logicN-free posetsPresburger logicseries-parallel posetssp-rational languages

Mathematics Subject Classification ID

Higher-order logic (03B16) Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Partial orders, general (06A06) Formal languages and automata (68Q45)

Recommendations

• Logic and branching automata
• Automatentheorie und Logik
• Automaton logic
• scientific article; zbMATH DE number 847943
• scientific article; zbMATH DE number 459361
• scientific article; zbMATH DE number 3976378
• scientific article; zbMATH DE number 3189696
• scientific article; zbMATH DE number 5872401
• scientific article; zbMATH DE number 49206
• scientific article; zbMATH DE number 618821

Cited in

(7)

• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
• Communicating finite-state machines and two-variable logic
• Branching automata with costs -- a way of reflecting parallelism in costs
• Complementation of Branching Automata for Scattered and Countable N-Free Posets
• Logic and branching automata
• Logic and languages of higher-dimensional automata

This page was built for publication: Logic and Branching Automata

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